Term Rewriting and Applications
Springer Berlin (Verlag)
978-3-540-73447-5 (ISBN)
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.
Erscheint lt. Verlag | 21.6.2007 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XII, 422 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 664 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | Approximation • automated deduction • Constraint • Constraint Solving • formal analysis • Formal Verification • Graph Rewriting • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Higher Order Rewriting • Java • Lambda Calculus • Logic • Logic Programming • Model Checking • Object-oriented Languages • Optimization • programming calculi • Programming Language Semantics • Proof theory • Rewriting • Rewriting Systems • Semantics • Static Analysis • Terme (Mathematik) • termination • Term Rewriting • theorem proving • type inference • unification • verification |
ISBN-10 | 3-540-73447-3 / 3540734473 |
ISBN-13 | 978-3-540-73447-5 / 9783540734475 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich