![]() |
![]() |
Your cart is empty |
||
Showing 1 - 5 of 5 matches in All Departments
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.
This book constitutes the refereed proceedings of the 13th International Conference on Computer Aided Verification, CAV 2001, held in Paris, France in July 2001.The 33 revised full papers presented were carefully reviewed and selected from 106 regular paper submissions; also included are 13 reviewed tool presentations selected from 27 submissions. The book offers topical sections on model checking and theorem proving, automata techniques, verification core technology, BDD and decision trees, abstraction and refinement, combinations, infinite state systems, temporal logics and verification, microprocessor verification and cache coherence, SAT and applications, and timed automata.
Constraints provide a declarative way of representing infinite sets
of data. They are well suited for combining different logical or
programming paradigms as has been known for constraint logic
programming since the 1980s and more recently for functional
programming. The use of constraints in automated deduction is more
recent and has proved to be very successful, moving the control
from the meta-level to the constraints, which are now first-class
objects.
This book constitutes the refereed proceedings of the 8th
International Conference on Rewriting Techniques and Applications,
RTA-97, held in Sitges, Spain, in June 1997.
This volume contains thoroughly revised versions of the
contributions presented at the French Spring School of Theoretical
Computer Science, held in Font Romeu, France in May 1993.
|
![]() ![]() You may like...
Proceedings of IncoME-V & CEPE Net-2020…
Dong Zhen, Dong Wang, …
Paperback
R8,906
Discovery Miles 89 060
Cable-Driven Parallel Robots…
Marc Gouttefarde, Tobias Bruckmann, …
Paperback
R7,450
Discovery Miles 74 500
|