04248nam 22007695 450 99646559600331620230406061303.03-642-02348-710.1007/978-3-642-02348-4(CKB)1000000000753990(SSID)ssj0000319845(PQKBManifestationID)11272089(PQKBTitleCode)TC0000319845(PQKBWorkID)10354535(PQKB)11775268(DE-He213)978-3-642-02348-4(MiAaPQ)EBC3064305(PPN)136306748(EXLCZ)99100000000075399020100301d2009 u| 0engurnn|008mamaatxtccrRewriting Techniques and Applications[electronic resource] 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings /edited by Ralf Treinen1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (XII, 391 p.) Theoretical Computer Science and General Issues,2512-2029 ;5595Bibliographic Level Mode of Issuance: Monograph3-642-02347-9 Automatic Termination -- Loops under Strategies -- Proving Termination of Integer Term Rewriting -- Dependency Pairs and Polynomial Path Orders -- Unique Normalization for Shallow TRS -- The Existential Fragment of the One-Step Parallel Rewriting Theory -- Proving Confluence of Term Rewriting Systems Automatically -- A Proof Theoretic Analysis of Intruder Theories -- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case -- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions -- YAPA: A Generic Tool for Computing Intruder Knowledge -- Well-Definedness of Streams by Termination -- Modularity of Convergence in Infinitary Rewriting -- A Heterogeneous Pushout Approach to Term-Graph Transformation -- An Explicit Framework for Interaction Nets -- Dual Calculus with Inductive and Coinductive Types -- Comparing Böhm-Like Trees -- The Derivational Complexity Induced by the Dependency Pair Method -- Local Termination -- VMTL–A Modular Termination Laboratory -- Tyrolean Termination Tool 2 -- From Outermost to Context-Sensitive Rewriting -- A Fully Abstract Semantics for Constructor Systems -- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) -- Unification in the Description Logic -- Unification with Singleton Tree Grammars -- Unification and Narrowing in Maude 2.4.Theoretical Computer Science and General Issues,2512-2029 ;5595Machine theoryComputer scienceCompilers (Computer programs)Computer science—MathematicsDiscrete mathematicsMathematical logicFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingCompilers and InterpretersDiscrete Mathematics in Computer ScienceSymbolic and Algebraic ManipulationMathematical Logic and FoundationsMachine theory.Computer science.Compilers (Computer programs).Computer science—Mathematics.Discrete mathematics.Mathematical logic.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.Compilers and Interpreters.Discrete Mathematics in Computer Science.Symbolic and Algebraic Manipulation.Mathematical Logic and Foundations.005.131DAT 554fstubSS 4800rvkTreinen Ralfedthttp://id.loc.gov/vocabulary/relators/edtInternational Conference on Rewriting Techniques and ApplicationsBOOK996465596003316Rewriting Techniques and Applications774195UNISA