OASIcs.ICCSW.2014.27.pdf
- Filesize: 0.54 MB
- 9 pages
Document
Predicate Abstraction in Program Verification: Survey and Current Trends
Authors
-
Part of:
Volume:
2014 Imperial College Computing Student Workshop (ICCSW 2014)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-10-08
Cite AsGet BibTex
Jakub Daniel and Pavel Parízek. Predicate Abstraction in Program Verification: Survey and Current Trends. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 27-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/OASIcs.ICCSW.2014.27
https://doi.org/10.4230/OASIcs.ICCSW.2014.27
Abstract
A popular approach to verification of software system correctness is model checking. To achieve scalability needed for large systems, model checking has to be augmented with abstraction. In this paper, we provide an overview of selected techniques of program verification based on predicate abstraction. We focus on techniques that advanced the state-of-the-art in a significant way, including counterexample-guided abstraction refinement, lazy abstraction, and current trends in the form of extensions targeting, for example, data structures and multi-threading. We discuss limitations of these techniques and present our plans for addressing some of them.
Keywords
- program verification
- model checking
- predicate abstraction
- refinement
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads