04250nam 22007575 450 99646533700331620230221020934.03-540-73449-X10.1007/978-3-540-73449-9(CKB)1000000000491020(SSID)ssj0000320333(PQKBManifestationID)11235212(PQKBTitleCode)TC0000320333(PQKBWorkID)10348129(PQKB)11212809(DE-He213)978-3-540-73449-9(MiAaPQ)EBC3063275(MiAaPQ)EBC6694654(Au-PeEL)EBL6694654(PPN)123163471(EXLCZ)99100000000049102020100301d2007 u| 0engurnn|008mamaatxtccrTerm Rewriting and Applications[electronic resource] 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings /edited by Franz Baader1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (XII, 422 p.) Theoretical Computer Science and General Issues,2512-2029 ;4533Bibliographic Level Mode of Issuance: Monograph3-540-73447-3 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;4533Compilers (Computer programs)Machine theoryComputer scienceArtificial intelligenceComputer science—MathematicsCompilers and InterpretersFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingArtificial IntelligenceSymbolic and Algebraic ManipulationCompilers (Computer programs).Machine theory.Computer science.Artificial intelligence.Computer science—Mathematics.Compilers and Interpreters.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.Artificial Intelligence.Symbolic and Algebraic Manipulation.006.3Baader FranzMiAaPQMiAaPQMiAaPQBOOK996465337003316Term Rewriting and Applications772114UNISA