Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
2009 (conf/rta/2009)

1. 
   Automatic Termination. [Citation Graph (, )][DBLP]
   
   
2. 
   Loops under Strategies. [Citation Graph (, )][DBLP]
   
   
3. 
   Proving Termination of Integer Term Rewriting. [Citation Graph (, )][DBLP]
   
   
4. 
   Dependency Pairs and Polynomial Path Orders. [Citation Graph (, )][DBLP]
   
   
5. 
   Unique Normalization for Shallow TRS. [Citation Graph (, )][DBLP]
   
   
6. 
   The Existential Fragment of the One-Step Parallel Rewriting Theory. [Citation Graph (, )][DBLP]
   
   
7. 
   Proving Confluence of Term Rewriting Systems Automatically. [Citation Graph (, )][DBLP]
   
   
8. 
   A Proof Theoretic Analysis of Intruder Theories. [Citation Graph (, )][DBLP]
   
   
9. 
   Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. [Citation Graph (, )][DBLP]
   
   
10. 
    Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions. [Citation Graph (, )][DBLP]
    
    
11. 
    YAPA: A Generic Tool for Computing Intruder Knowledge. [Citation Graph (, )][DBLP]
    
    
12. 
    Well-Definedness of Streams by Termination. [Citation Graph (, )][DBLP]
    
    
13. 
    Modularity of Convergence in Infinitary Rewriting. [Citation Graph (, )][DBLP]
    
    
14. 
    A Heterogeneous Pushout Approach to Term-Graph Transformation. [Citation Graph (, )][DBLP]
    
    
15. 
    An Explicit Framework for Interaction Nets. [Citation Graph (, )][DBLP]
    
    
16. 
    Dual Calculus with Inductive and Coinductive Types. [Citation Graph (, )][DBLP]
    
    
17. 
    Comparing Böhm-Like Trees. [Citation Graph (, )][DBLP]
    
    
18. 
    The Derivational Complexity Induced by the Dependency Pair Method. [Citation Graph (, )][DBLP]
    
    
19. 
    Local Termination. [Citation Graph (, )][DBLP]
    
    
20. 
    VMTL-A Modular Termination Laboratory. [Citation Graph (, )][DBLP]
    
    
21. 
    Tyrolean Termination Tool 2. [Citation Graph (, )][DBLP]
    
    
22. 
    From Outermost to Context-Sensitive Rewriting. [Citation Graph (, )][DBLP]
    
    
23. 
    A Fully Abstract Semantics for Constructor Systems. [Citation Graph (, )][DBLP]
    
    
24. 
    The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity). [Citation Graph (, )][DBLP]
    
    
25. 
    Unification in the Description Logic EL. [Citation Graph (, )][DBLP]
    
    
26. 
    Unification with Singleton Tree Grammars. [Citation Graph (, )][DBLP]
    
    
27. 
    Unification and Narrowing in Maude 2.4. [Citation Graph (, )][DBLP]