Conferences in DBLP

Birthday ... (birthday)
2007 (conf/birthday/2007jouannaud)

1. Nachum Dershowitz, Georg Moser
   The Hydra Battle Revisited. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:1-27 [Conf]
   
2. Cristina Borralleras, Albert Rubio
   Orderings and Constraints: Theory and Practice of Proving Termination. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:28-43 [Conf]
   
3. Isabelle Gnaedig, Hélène Kirchner
   Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:44-67 [Conf]
   
4. Frédéric Blanqui
   Computability Closure: Ten Years Later. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:68-88 [Conf]
   
5. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
   Reduction Strategies and Acyclicity. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:89-112 [Conf]
   
6. Jacek Chrzaszcz, Daria Walukiewicz-Chrzaszcz
   Towards Rewriting in Coq. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:113-131 [Conf]
   
7. Paul Brauner, Clément Houtmann, Claude Kirchner
   Superdeduction at Work. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:132-166 [Conf]
   
8. Mitsuhiro Okada, Ryo Takemura
   Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:167-181 [Conf]
   
9. Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie
   Linear Recursive Functions. [Citation Graph (0, 0)][DBLP]
   Rewriting, Computation and Proof, 2007, pp:182-195 [Conf]
   
10. Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
    Deducibility Constraints, Equational Theory and Electronic Money. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:196-212 [Conf]
    
11. Abdessamad Imine, Michaël Rusinowitch
    Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:213-234 [Conf]
    
12. Claude Marché
    Towards Modular Algebraic Specifications for Pointer Programs: A Case Study. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:235-258 [Conf]
    
13. Evelyne Contejean
    Modeling Permutations in Coqfor Coccinelle. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:259-269 [Conf]