Conferences in DBLP

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

1. Xavier Leroy
   Formal Verification of an Optimizing Compiler. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:1- [Conf]
   
2. Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
   Challenges in Satisfiability Modulo Theories. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:2-18 [Conf]
   
3. Frank Pfenning
   On a Logical Foundation for Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:19- [Conf]
   
4. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
   Intruders with Caps. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:20-35 [Conf]
   
5. Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, Antoine Reilles
   Tom: Piggybacking Rewriting on Java. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:36-47 [Conf]
   
6. Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux
   Rewriting Approximations for Fast Prototyping of Static Analyzers. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:48-62 [Conf]
   
7. Thierry Boy de la Tour, Mnacho Echenim
   Determining Unify-Stable Presentations. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:63-77 [Conf]
   
8. Horatiu Cirstea, Germain Faure
   Confluence of Pattern-Based Calculi. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:78-92 [Conf]
   
9. Gilles Dowek, Olivier Hermant
   A Simple Proof That Super-Consistency Implies Cut Elimination. [Citation Graph (0, 0)][DBLP]
   RTA, 2007, pp:93-106 [Conf]
   
10. Irène Durand, Géraud Sénizergues
    Bottom-Up Rewriting Is Inverse Recognizability Preserving. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:107-121 [Conf]
    
11. Dominique Duval, Rachid Echahed, Frédéric Prost
    Adjunction for Garbage Collection with Application to Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:122-136 [Conf]
    
12. Rachid Echahed, Nicolas Peltier
    Non Strict Confluent Rewrite Systems for Data-Structures with Pointers. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:137-152 [Conf]
    
13. Santiago Escobar, José Meseguer
    Symbolic Model Checking of Infinite-State Systems Using Narrowing. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:153-168 [Conf]
    
14. José Espírito Santo
    Delayed Substitutions. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:169-183 [Conf]
    
15. Guillem Godoy, Eduard Huntingford
    Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:184-199 [Conf]
    
16. Guillem Godoy, Eduard Huntingford, Ashish Tiwari
    Termination of Rewriting with Right-Flat Rules. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:200-213 [Conf]
    
17. Rémy Haemmerlé, François Fages
    Abstract Critical Pairs and Confluence of Arbitrary Binary Relations. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:214-228 [Conf]
    
18. Joe Hendrix, José Meseguer
    On the Completeness of Context-Sensitive Order-Sorted Specifications. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:229-245 [Conf]
    
19. Mark Hills, Grigore Rosu
    KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:246-256 [Conf]
    
20. Kentaro Kikuchi
    Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:257-272 [Conf]
    
21. Martin Korp, Aart Middeldorp
    Proving Termination of Rewrite Systems Using Bounds. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:273-287 [Conf]
    
22. Temur Kutsia, Jordi Levy, Mateu Villaret
    Sequence Unification Through Currying. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:288-302 [Conf]
    
23. Claude Marché, Hans Zantema
    The Termination Competition. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:303-313 [Conf]
    
24. Vincent van Oostrom
    Random Descent. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:314-328 [Conf]
    
25. Manfred Schmidt-Schauß
    Correctness of Copy in Calculi with Letrec. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:329-343 [Conf]
    
26. Lutz Straßburger
    A Characterization of Medial as Rewriting Rule. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:344-358 [Conf]
    
27. Makoto Tatsuta
    The Maximum Length of Mu-Reduction in Lambda Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:359-373 [Conf]
    
28. Lionel Vaux
    On Linear Combinations of lambda -Terms. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:374-388 [Conf]
    
29. Harald Zankl, Aart Middeldorp
    Satisfying KBO Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:389-403 [Conf]
    
30. Hans Zantema, Johannes Waldmann
    Termination by Quasi-periodic Interpretations. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:404-418 [Conf]