Rewriting, Computation and Proof: Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / Edition 1

Rewriting, Computation and Proof: Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / Edition 1

by Hubert Comon-Lundh
     
 

ISBN-10: 3540731466

ISBN-13: 9783540731467

Pub. Date: 06/28/2007

Publisher: Springer Berlin Heidelberg

Jean-Pierre Jouannaud has played a leading role in the field of rewriting and its technology. This Festschrift volume, published to honor him on his 60th Birthday, includes 13 refereed papers by leading researchers, current and former colleagues. The papers are grouped in thematic sections on Rewriting Foundations, Proof and Computation, and a final section

Overview

Jean-Pierre Jouannaud has played a leading role in the field of rewriting and its technology. This Festschrift volume, published to honor him on his 60th Birthday, includes 13 refereed papers by leading researchers, current and former colleagues. The papers are grouped in thematic sections on Rewriting Foundations, Proof and Computation, and a final section entitled Towards Safety and Security.

Product Details

ISBN-13:
9783540731467
Publisher:
Springer Berlin Heidelberg
Publication date:
06/28/2007
Series:
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series, #4600
Edition description:
2007
Pages:
276
Product dimensions:
5.90(w) x 9.30(h) x 0.70(d)

Table of Contents

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >