41st TRS Meeting

September 26 (Fri) – 28 (Sun), 2014
Sapporo, Hokkaido

What's new

About the TRS Meeting

The Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk of approximately 15 to 60 minutes in English on their research activities. The subject of the talk is not required to be one's original result; for example, explaining an interesting paper is perfectly OK.(See Rewriting Researchers Forum for further information: http://www.jaist.ac.jp/~hirokawa/trs-meeting/)

Information

date: September 26 (Fri) – 28 (Sun), 2014
venue: URI: Jozankei Manseikaku Hotel Milione
Postal address: Minami-ku Jozankei-onsen Higashi Minami 3-chome, Jozankei, Sapporo, 061-2302, Japan
Access: see details from here.
organizer: Haruhiko Sato (Hokkaido Univ.)
hotel information: Share rooms (4-5 persons/1 room) : 22,980 yen (including breakfast and dinner for 2 days)

Program (tentative)

September 26 (Friday)

16:30 – 17:30 Session 1
Basic Normalization Revisited
Nao Hirokawa(JAIST)
Discovering Inductive Theorems using Random Testing and Rewriting Induction
Haruhiko Sato(Hokkaido University)
19:00 Dinner

September 27 (Saturday)

09:00 – 11:30 Session 2
Layer Systems for Proving Confluence
Bertram Felgenhauer (University of Innsbruck)
Residual Systems and Proof Terms for Formalizing Confluence Criteria
Julian Nagele (University of Innsbruck)
Certification of Confluence Proofs by Decreasing Diagrams
Harald Zankl (University of Innsbruck)
Certifying Termination and Complexity Proofs of Programs
René Thiemann (University of Innsbruck)
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
Naohi Eguchi(Chiba University)
13:30 – 15:30 Session 3
Program Transformations for LCTRS
Cynthia Kop(University of Innsbruck)
On Uninterpreted Functions in Proving Termination of Constrained Rewriting
Naoki Nishida(Nagoya University)
Fundamental Properties of Thue-Morse Sequence
Munehiro Iwami(Shimane University)
Unifying Completion and Rewriting Induction
Takahito Aoto(Tohoku University)
15:45 – 18:00 Session 4
Term Rewrite System Synthesis
Yoshihito Toyama(Tohoku University)
Towards Automatic Infeasibility
Thomas Sternagel(University of Innsbruck)
A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion
Sarah Winkler(University of Innsbruck)
Polynomial Interpretations over the Naturals, Rational and Real Numbers Revisited
Aart Middeldorp(University of Innsbruck)
19:00 Dinner

September 28 (Sunday)

09:00 – 11:30 Session 5
Sufficient Completeness of TRSs with Variable Binding
Yuki Chiba(JAIST)
Sufficient Completeness of CafeOBJ Parameterized Specifications
Masaki Nakamura(Toyama Prefectural University)
Automating the Commutative Decomposition
Kiraku Shintani(JAIST)
On Coding for Problems on Bounded-Integers to Efficient Pseudo-Boolean Constraints - Magic Square as an Example -
Masahiko Sakai(Nagoya University)
Some Remarks on Confluence of Left-Linear TRSs
Michio Oyamaguchi(Nagoya University)

Participants

Contact

Haruhiko Sato (mail: haru at complex.ist.hokudai.ac.jp)