
Conferences in DBLP
 Xavier Leroy
Formal Verification of an Optimizing Compiler. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:1 [Conf]
 Robert Nieuwenhuis, Albert Oliveras, Enric RodríguezCarbonell, Albert Rubio
Challenges in Satisfiability Modulo Theories. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:218 [Conf]
 Frank Pfenning
On a Logical Foundation for Explicit Substitutions. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:19 [Conf]
 Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch
Intruders with Caps. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:2035 [Conf]
 Emilie Balland, Paul Brauner, Radu Kopetz, PierreEtienne Moreau, Antoine Reilles
Tom: Piggybacking Rewriting on Java. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:3647 [Conf]
 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:4862 [Conf]
 Thierry Boy de la Tour, Mnacho Echenim
Determining UnifyStable Presentations. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:6377 [Conf]
 Horatiu Cirstea, Germain Faure
Confluence of PatternBased Calculi. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:7892 [Conf]
 Gilles Dowek, Olivier Hermant
A Simple Proof That SuperConsistency Implies Cut Elimination. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:93106 [Conf]
 Irène Durand, Géraud Sénizergues
BottomUp Rewriting Is Inverse Recognizability Preserving. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:107121 [Conf]
 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:122136 [Conf]
 Rachid Echahed, Nicolas Peltier
Non Strict Confluent Rewrite Systems for DataStructures with Pointers. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:137152 [Conf]
 Santiago Escobar, José Meseguer
Symbolic Model Checking of InfiniteState Systems Using Narrowing. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:153168 [Conf]
 José Espírito Santo
Delayed Substitutions. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:169183 [Conf]
 Guillem Godoy, Eduard Huntingford
InnermostReachability and InnermostJoinability Are Decidable for Shallow Term Rewrite Systems. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:184199 [Conf]
 Guillem Godoy, Eduard Huntingford, Ashish Tiwari
Termination of Rewriting with RightFlat Rules. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:200213 [Conf]
 Rémy Haemmerlé, François Fages
Abstract Critical Pairs and Confluence of Arbitrary Binary Relations. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:214228 [Conf]
 Joe Hendrix, José Meseguer
On the Completeness of ContextSensitive OrderSorted Specifications. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:229245 [Conf]
 Mark Hills, Grigore Rosu
KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:246256 [Conf]
 Kentaro Kikuchi
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:257272 [Conf]
 Martin Korp, Aart Middeldorp
Proving Termination of Rewrite Systems Using Bounds. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:273287 [Conf]
 Temur Kutsia, Jordi Levy, Mateu Villaret
Sequence Unification Through Currying. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:288302 [Conf]
 Claude Marché, Hans Zantema
The Termination Competition. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:303313 [Conf]
 Vincent van Oostrom
Random Descent. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:314328 [Conf]
 Manfred SchmidtSchauß
Correctness of Copy in Calculi with Letrec. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:329343 [Conf]
 Lutz Straßburger
A Characterization of Medial as Rewriting Rule. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:344358 [Conf]
 Makoto Tatsuta
The Maximum Length of MuReduction in Lambda MuCalculus. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:359373 [Conf]
 Lionel Vaux
On Linear Combinations of lambda Terms. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:374388 [Conf]
 Harald Zankl, Aart Middeldorp
Satisfying KBO Constraints. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:389403 [Conf]
 Hans Zantema, Johannes Waldmann
Termination by Quasiperiodic Interpretations. [Citation Graph (0, 0)][DBLP] RTA, 2007, pp:404418 [Conf]
