2006 | OriginalPaper | Chapter
Counterexamples with Loops for Predicate Abstraction
Authors : Daniel Kroening, Georg Weissenbacher
Published in: Computer Aided Verification
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Predicate abstraction is a major abstraction technique for the verification of software. Data is abstracted by means of Boolean variables, which keep track of predicates over the data. In many cases, the technique suffers from the fact that it requires at least one predicate for each iteration of a loop construct in the program. We propose to extract
looping counterexamples
from the abstract model, and to parameterize the simulation instance in the number of loop iterations.