Franz Baader (Volume ed.)

Term Rewriting and Applications

18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings
Herausgegeben:Baader, Franz

• Broschiertes Buch

Produktbeschreibung

The 18th International Conference on Rewriting Techniques and Applications, held in Paris, France in June 2007, featured presentations and discussions centering on some of the latest advances in the field. This volume presents the proceedings from that meeting. Papers cover current research on all aspects of rewriting, including applications, foundational issues, frameworks, implementations, and semantics.

Produktdetails

• Theoretical Computer Science and General Issues 4533
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12086580, 978-3-540-73447-5
• 2007
• Seitenzahl: 436
• Erscheinungstermin: 21. Juni 2007
• Englisch
• Abmessung: 235mm x 155mm x 24mm
• Gewicht: 664g
• ISBN-13: 9783540734475
• ISBN-10: 3540734473
• Artikelnr.: 22963593

Inhaltsangabe

Formal Verification of an Optimizing Compiler.- Challenges in Satisfiability Modulo Theories.- On a Logical Foundation for Explicit Substitutions.- Intruders with Caps.- Tom: Piggybacking Rewriting on Java.- Rewriting Approximations for Fast Prototyping of Static Analyzers.- Determining Unify-Stable Presentations.- Confluence of Pattern-Based Calculi.- A Simple Proof That Super-Consistency Implies Cut Elimination.- Bottom-Up Rewriting Is Inverse Recognizability Preserving.- Adjunction for Garbage Collection with Application to Graph Rewriting.- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers.- Symbolic Model Checking of Infinite-State Systems Using Narrowing.- Delayed Substitutions.- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.- Termination of Rewriting with Right-Flat Rules.- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations.- On the Completeness of Context-Sensitive Order-Sorted Specifications.- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis.- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi.- Proving Termination of Rewrite Systems Using Bounds.- Sequence Unification Through Currying.- The Termination Competition.- Random Descent.- Correctness of Copy in Calculi with Letrec.- A Characterization of Medial as Rewriting Rule.- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus.- On Linear Combinations of ?-Terms.- Satisfying KBO Constraints.- Termination by Quasi-periodic Interpretations.