LEADER 05116nam  22007935  450 
001 996466253303316
005 20230222010759.0
010   $a3-540-73147-4
024 7 $a10.1007/978-3-540-73147-4
035   $a(CKB)1000000000478483
035   $a(SSID)ssj0000237875
035   $a(PQKBManifestationID)11209615
035   $a(PQKBTitleCode)TC0000237875
035   $a(PQKBWorkID)10222420
035   $a(PQKB)10075696
035   $a(DE-He213)978-3-540-73147-4
035   $a(MiAaPQ)EBC3063155
035   $a(MiAaPQ)EBC6691713
035   $a(Au-PeEL)EBL6691713
035   $a(PPN)123163080
035   $a(EXLCZ)991000000000478483
100   $a20100301d2007      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aRewriting, Computation and Proof$b[electronic resource] $eEssays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday /$fedited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (XVI, 276 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4600
300   $aPapers presented at a symposium held in Cachan near Paris, on June 21-22, 2007.
311   $a3-540-73146-6 
320   $aIncludes bibliographical references and indexes.
327   $aRewriting 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.
330   $aJean-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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4600
606   $aMachine theory
606   $aComputer science
606   $aCompilers (Computer programs)
606   $aComputer programming
606   $aSoftware engineering
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
606   $aCompilers and Interpreters
606   $aProgramming Techniques
606   $aSoftware Engineering
615  0$aMachine theory.
615  0$aComputer science.
615  0$aCompilers (Computer programs).
615  0$aComputer programming.
615  0$aSoftware engineering.
615 14$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aCompilers and Interpreters.
615 24$aProgramming Techniques.
615 24$aSoftware Engineering.
676   $a511.3
700   $aComon$b Hubert$01222038
702   $aKirchner$b Claude
702   $aKirchner$b H$g(He?le?ne),
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466253303316
996   $aRewriting, computation and proof$92834087
997   $aUNISA