Rewriting Techniques and Applications [[electronic resource] ] : 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings / / edited by Ralf Treinen

• Record Nr.: UNISA996465596003316
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
• ISBN: 3-642-02348-7
• Edizione: [1st ed. 2009.]
• Descrizione fisica: 1 online resource (XII, 391 p.)
• Collana: Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5595
• Classificazione: DAT 554f; SS 4800
• Disciplina: 005.131
• Soggetti: Machine 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
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: 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.