Rewriting, Computation and Proof

Jean-Pierre Jouannaud has deeply influenced, and is still influencing, research in Informatics, through the many important results he has produced in various research fields and through the generations of scholars he has educated. He has played a leading role in field of rewriting and its technology, advancing the research areas of unification, rewriting and completion modulo, conditional rewriting, termination proofs, modular properties, and automated proofs by induction in rewrite theories. Following his strong interest for algebraic specification languages and their efficient implementation, Jean-Pierre Jouannaud has contributed to the design, semantics and implementation of OBJ2 and has recently augmented the Maude rewriting logic system with an essential feature: membership equational logic. He was a member of the CNU (National University Council) and a member of the CNRS national committee. He is now heading with great success the computer science laboratory at the Ecole Polytechnique thus showing his exceptional qualities as a research team manager and supervisor of students.

This Festschrift volume, published to honor Jean-Pierre Jouannaud on his 60th Birthday on May 12, 2007, includes 13 refereed papers by leading researchers, current and former colleagues, who congregated at a celebratory symposium held in Cachan near Paris, France, on June 21-22, 2007. The papers are grouped in thematic sections on Rewriting Foundations, Proof and Computation, and a final section entitled Towards Safety and Security.

From the reviews:

"The book gives an overview of Jouannaud's distinguished career and contributions, and provides an impressive list of doctoral descendants. will be very useful not only as a reference tool for specialists, but also as an inspiration and source of ideas for budding researchers." (G. Sivakumar, ACM Computing Reviews, Vol. 49 (12), December, 2008)

Inhalt
Rewriting Foundations.- The Hydra Battle Revisited.- Orderings and Constraints: Theory and Practice of Proving Termination.- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.- Computability Closure: Ten Years Later.- Reduction Strategies and Acyclicity.- Proof and Computation.- Towards Rewriting in Coq.- Superdeduction at Work.- Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic ?-Calculus.- Linear Recursive Functions.- Towards Safety and Security.- Deducibility Constraints, Equational Theory and Electronic Money.- Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms.- Towards Modular Algebraic Specifications for Pointer Programs: A Case Study.- Modeling Permutations in Coq for Coccinelle.