Rewriting Techniques and Applications : 14th International Conference, Rta 2003, Valencia, Spain, June 2003 : Proceedings

International Conference on Rewriting Techniques and Applications (14th : 2003 : Valencia, Spain) (COR); Nieuwenhuis, Robert

ISBN 10: 3540402543 / ISBN 13: 9783540402541

Editore: Springer, 2003

Riguardo questo articolo

Unread book in perfect condition.

Codice articolo 5907032

Dati bibliografici

• Titolo: Rewriting Techniques and Applications : 14th International Conference, Rta 2003, Valencia, Spain, June 2003 : Proceedings
• Editore: Springer
• Data di pubblicazione: 2003
• Lingua: Inglese
• ISBN 10: 3540402543
• ISBN 13: 9783540402541
• Rilegatura: Brossura
• Condizione: As New

Descrizione articolo

Riassunto

The refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003.

The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributions were carefully reviewed and selected from 61 submissions. All current aspects of rewriting are addressed.

Contenuti

Invited Talk.- Symbolic Systems Biology.- Confluence as a Cut Elimination Property.- Associative-Commutative Rewriting on Large Terms.- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.- Efficient Reductions with Director Strings.- Rewriting Logic and Probabilities.- The Maude 2.0 System.- Diagrams for Meaning Preservation.- Expression Reduction Systems with Patterns.- Residuals in Higher-Order Rewriting.- Rewriting UNITY.- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.- Rule-Based Analysis of Dimensional Safety.- Invited Talk.- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems.- On the Complexity of Higher-Order Matching in the Linear ?-Calculus.- XML Schema, Tree Logic and Sheaves Automata.- Size-Change Termination for Term Rewriting.- Monotonic AC-Compatible Semantic Path Orderings.- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.- Tsukuba Termination Tool.- Liveness in Rewriting.- Validation of the JavaCard Platform with Implicit Induction Techniques.- “Term Partition” for Mathematical Induction.- Equational Prover of Theorema.- Termination of Simply Typed Term Rewriting by Translation and Labelling.- Rewriting Modulo in Deduction Modulo.- Termination of String Rewriting Rules That Have One Pair of Overlaps.- Environments for Term Rewriting Engines for Free!.- Joint RTA-TLCA Invited Talk.- A Logical Algorithm for ML Type Inference.- A Rewriting Alternative to Reidemeister-Schreier.- Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication).- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.- Testing Extended Regular Language Membership Incrementally by Rewriting.