Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Counterexamples with Loops for Predicate Abstraction
verfasst von : Daniel Kroening, Georg Weissenbacher
Erschienen in: Computer Aided Verification
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.