Bounded Model Checking with Parametric Data Structures
Published in Electronic Notes in Theoretical Computer Science • May 1, 2007
NobleIDNI8P38W76R54S60
Authors:,,
Erika Ábrahám
Marc Herbstritt
Bernd Becker
Abstract
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like timed automata or linear hybrid automata. Counterexamples of a fixed length are described by formulas in a decidable logic,...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!