2014 | OriginalPaper | Buchkapitel
CPAchecker with Sequential Combination of Explicit-Value Analyses and Predicate Analyses
(Competition Contribution)
verfasst von : Stefan Löwe, Mikhail Mandrykin, Philipp Wendler
Erschienen in: Tools and Algorithms for the Construction and Analysis of Systems
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
CPAchecker
is a framework for software verification, built on the foundations of
Configurable Program Analysis
(CPA). For the SV-COMP’14, we file a
CPAchecker
configuration that runs up to five analyses in sequence. The first two analyses of our approach utilize the explicit-value domain for modeling the state space, while the remaining analyses are based on predicate abstraction. In addition to that, a bit-precise counterexample checker comes into action whenever an analysis finds a counterexample. The combination of conceptually different analyses is key to the success of our verification approach, as the diversity of verification tasks is taken into account.