Rewriting Techniques and Applications: 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, Volume 14Robert Nieuwenhuis This volume contains the proceedings of the14thInternationalConferenceon RewritingTechniquesandApplications (RTA2003). It was held June 9-11, 2003 in Valencia, Spain, as part of RDP, theFederatedConferenceonRewriting,- ductionandProgramming, together with the International Conference on Typed Lambda Calculi and Applications (TLCA2003), the International Workshop on First-order Theorem Proving (FTP2003), the annual meeting of the IFIP Working Group 1.6 on Term Rewriting, the International Workshop on Rule- Based Programming (RULE2003), the International Workshop on Uni?cation (UNIF2003), the International Workshop on Functional and (Constraint) Logic Programming (WFLP2003), the International Workshop on Reduction Stra- gies in Rewriting and Programming (WRS2003), and the International Wo- shop on Termination (WST2003). RTA is the major forum for the presentation of research on all aspects of rewr- ing. Previous RTA conferences were held in Dijon (1985), Bordeaux (1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), New Brunswick, NJ (1996), Sitges, Barcelona (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), and Copenhagen (2002). This year, there were 61 submissions of which 57 regular research papers and 4 system descriptions, with authors from institutions in France (19.6 authors of submitted papers, of which 11.3 were accepted), USA (6.5 of 9), UK (3.5 of 4.5), Japan(3of6),Germany(2.5 of 4),TheNetherlands(2.2 of 5.2),Spain(1.5 of 4), Austria (1 of 1), Israel (0.5 of 2.5), Portugal (0 of 1), Algeria (0 of 1), Denmark (0 of 1), Canada (0 of 1), Brazil (0 of 0.6), and Poland (0 of 0.5). |
Contents
Symbolic Systems Biology | 1 |
Confluence as a Cut Elimination Property | 2 |
AssociativeCommutative Rewriting on Large Terms | 14 |
A RuleBased Approach for Automated Generation of Kinetic Chemical Mechanisms | 30 |
Efficient Reductions with Director Strings | 46 |
Rewriting Logic and Probabilities | 61 |
The Maude 20 System | 76 |
Diagrams for Meaning Preservation | 88 |
Monotonic ACCompatible Semantic Path Orderings | 279 |
Relating Derivation Lengths with the SlowGrowing Hierarchy Directly | 296 |
Tsukuba Termination Tool | 311 |
Liveness in Rewriting | 321 |
Validation of the JavaCard Platform with Implicit Induction Techniques | 337 |
Term Partition for Mathematical Induction | 352 |
Equational Prover of Theorema | 367 |
Termination of Simply Typed Term Rewritingby Translation and Labelling | 380 |
Expression Reduction Systems with Patterns | 107 |
Residuals in HigherOrder Rewriting | 123 |
Rewriting UNITY | 138 |
New Decidability Results for Fragments of FirstOrder Logic and Application to Cryptographic Protocols | 148 |
An Eunification Algorithm for Analyzing Protocols That Use Modular Exponentiation | 165 |
Decidability and Closure Properties | 180 |
RuleBased Analysis of Dimensional Safety | 197 |
Topological Collections Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems | 208 |
On the Complexity of HigherOrder Matching in the Linear λCalculus | 234 |
XML Schema Tree Logic and Sheaves Automata | 246 |
SizeChange Termination for Term Rewriting | 264 |
Rewriting Modulo in Deduction Modulo | 395 |
Termination of String Rewriting Rules That Have One Pair of Overlaps | 410 |
Environments for Term Rewriting Engines for Free | 424 |
A Logical Algorithm for ML Type Inference | 436 |
A Rewriting Alternative to ReidemeisterSchreier | 452 |
Stable Computational Semantics of ConflictFree Rewrite Systems Partial Orders with Duplication | 467 |
Recognizing Boolean Closed ATree Languages with Membership Conditional Rewriting Mechanism | 483 |
Testing Extended Regular Language Membership Incrementally by Rewriting | 499 |
| 515 | |
Other editions - View all
Rewriting Techniques and Applications: 14th International Conference, RTA ... Robert Nieuwenhuis No preview available - 2003 |
Rewriting Techniques and Applications: 14th International ..., Volume 14 Robert Nieuwenhuis No preview available - 2003 |
Common terms and phrases
abstract acspo ACUX algebraic algorithm application argument arity automata Automated automaton Axiom bytecode calculus clauses confluence consider constraints constructor contains corresponding coset critical pairs cryptographic protocols cut elimination data structure defined definition denote dependency pairs elements equations example finite first-order function symbol given graph Gröbner basis higher-order implementation implies induction labelling Lemma linear LNCS matching Maude method modulo monoid multiset node normal form notion operator path ordering pattern polynomial problem Proc programming language properties proposition protocol prove recursive red-black tree redex reduction pair regular expression relation result rewrite rules rewrite step rewrite system rewriting engine rewriting logic satisfies schema semantics sequence size-change principle Springer-Verlag substitution subterms syntax t₁ techniques term rewriting term rewriting systems termination proofs Theorem theory tion transformation tree automata TRSS unification variables