Rewriting Techniques and Applications 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings / [electronic resource] :
edited by Ralf Treinen.
- 1st ed. 2009.
- XII, 391 p. online resource.
- Theoretical Computer Science and General Issues, 5595 2512-2029 ; .
- Theoretical Computer Science and General Issues, 5595 .
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.
9783642023484
10.1007/978-3-642-02348-4 doi
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.
QA267-268.5
005.131
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.
9783642023484
10.1007/978-3-642-02348-4 doi
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.
QA267-268.5
005.131