Transcription of LNCS 2772 - Counterexamples Revisited: Principles ...
{{id}} {{{paragraph}}}
Example: barber
LNCS 2772 - Counterexamples Revisited: Principles ...
Counterexamples Revisited: Principles , Algorithms, Applications Edmund Clarke1and Helmut Veith21 School of Computer Science, Carnegie Mellon University, f ur Informationsysteme, Technische Universit at Wien, counterexample generation is a central featureof model checking which sets the method apart from other approachessuch as theorem proving. The practical value of Counterexamples tothe verification engineer is evident, and for many years, counterexam-ple generation algorithms have been employed in model checking sys-tems, even though they had not been subject to an adequate fundamen-tal investigation. Recent advances in model checking technology suchas counterexample-guided abstraction refinement have put strong em-phasis on Counterexamples , and have lead to renewed interest both infundamental and pragmatic aspects of counterexample generation.
Model checking [20,15,52] is an algorithmic framework tailored to perform this verification task; on a high level, model checking can be viewed as an ex- haustive search algorithm which exploits various optimization strategies to find
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Principles of Model Checking, Model checking, Chapter 4: Regular Properties Principles of Model Checking, Model, Checking, Model Checking: Principles and Applications, Model Checking: Principles and Applications to, Model Checking: A Tutorial Overview, Of model checking, Principles, Model check-ing, Statistical Methods Principles, Statistical Methods Principles Model Checking, Of model, Answers to Selected Exercises