By Edmund M. Clarke (auth.), Orna Grumberg, Helmut Veith (eds.)
Model checking expertise is one of the prime functions of good judgment to desktop technology and desktop engineering. The version checking group has completed many breakthroughs, bridging the space among theoretical laptop technological know-how and and software program engineering, and it really is achieving out to new hard parts similar to method biology and hybrid platforms. version checking is broadly utilized in the and has additionally been utilized to the verification of many sorts of software program. version checking has been brought into machine technological know-how and electric engineering curricula at universities world wide and has develop into a common device for the research of systems.
This Festschrift quantity, released in occasion of the twenty fifth Anniversary of version Checking, features a choice of eleven invited papers in response to talks on the symposium "25 Years of version Checking", 25MC, which was once a part of the 18th overseas convention on desktop Aided Verification (CAV 2006), which in flip was once a part of the Federated good judgment convention (FLoC 2006) held in Seattle, WA, united states, in August 2006.
Model checking is at present attracting substantial awareness past the center technical neighborhood, and the ACM Turing Award 2007 used to be given in reputation of the paradigm-shifting paintings in this subject initiated 1 / 4 century in the past. the following we honor that success with the inclusion of facsimile reprints of the visionary papers on version checking by way of Edmund Clarke and Allen Emerson, and via Jean-Pierre Queille and Joseph Sifakis.
Read or Download 25 Years of Model Checking: History, Achievements, Perspectives PDF
Best computers books
The learn awarded in Telecommunications making plans: techniques in Pricing, community layout and administration specializes in the newest methodological advancements in 3 key components – pricing of telecommunications companies, community layout, and source allocation. those 3 parts are such a lot appropriate to present telecommunications making plans.
- Career Opportunities in Computers and Cyberspace, 2nd Edition
- UML 2 par la pratique : Etudes de cas et exercices corriges, Sixieme edition
- Advances in Brain, Vision, and Artificial Intelligence: Second International Symposium, BVAI 2007, Naples, Italy, October 10-12, 2007. Proceedings
- Computer Vision - ECCV 2004: 8th European Conference on Computer Vision, Prague, Czech Republic, May 11-14, 2004. Proceedings, Part IV
- Beyond AI: Interdisciplinary Aspects of Artificial Intelligence
- The Visibooks Guide to Photoshop Elements 3.0
Extra resources for 25 Years of Model Checking: History, Achievements, Perspectives
Daniel Jackson has remarked that model checking has “saved the reputation” of formal methods [Ja97]. In summary, model checking today provides automatic veriﬁcation that is applicable to a broad range of sizable systems including many that are industrial strength. At the same time the veriﬁcation problem is not solved. We still have quite a way to go. Grand Challenge for Hardware. A. Emerson microprocessor. It would be a Grand Challenge to verify an entire microprocessor with one hundred thousand state variables.
Model checking would beneﬁt from future theoretical advances. This is especially important in view of the fact that many model checking methods are in principle algorithmic but of high theoretical, worst case complexity. Their good performance in practice has a heuristic character and is not well-understood on a mathematical basis. Many eﬃciency enhancement techniques produce an unpredictable gain in eﬃciency. To gain a better theoretical understanding of when good eﬃciency obtains would be a very desirable goal for the future.
Mini-tutorial on Model Checking. In: Third IEEE Intl. Symp. : A Deterministic Subexponential Algorithm for Parity Games. In: ACM-SIAM Symp. on Algorthms for Discrete Systems, pp. : Results on the Propositional Mu-Calculus. Theor. Comput. Sci. : Representation of Events in Nerve Nets and Finite Automata. , Shannon, C. ) Automata Studies, pp. 3–42. Princeton Univ. : Un th´eor`eme sur les fonctions d’ensembles. Ann. Soc. Polon. Math. : Planning as Satisﬁability. In: Proceedings European Conference on Artiﬁcial Intelligence.