default search action
60. Birthday: Jean-Pierre Jouannaud , 2007
- Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner:
Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 4600, Springer 2007, ISBN 978-3-540-73146-7
Rewriting Foundations
- Nachum Dershowitz, Georg Moser:
The Hydra Battle Revisited. 1-27 - Cristina Borralleras, Albert Rubio:
Orderings and Constraints: Theory and Practice of Proving Termination. 28-43 - Isabelle Gnaedig, Hélène Kirchner:
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. 44-67 - Frédéric Blanqui:
Computability Closure: Ten Years Later. 68-88 - Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk:
Reduction Strategies and Acyclicity. 89-112
Proof and Computation
- Jacek Chrzaszcz, Daria Walukiewicz-Chrzaszcz:
Towards Rewriting in Coq. 113-131 - Paul Brauner, Clément Houtmann, Claude Kirchner:
Superdeduction at Work. 132-166 - Mitsuhiro Okada, Ryo Takemura:
Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. 167-181 - Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Linear Recursive Functions. 182-195
Towards Safety and Security
- Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility Constraints, Equational Theory and Electronic Money. 196-212 - Abdessamad Imine, Michaël Rusinowitch:
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms. 213-234 - Claude Marché:
Towards Modular Algebraic Specifications for Pointer Programs: A Case Study. 235-258 - Evelyne Contejean:
Modeling Permutations in Coqfor Coccinelle. 259-269
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.