MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Beyer, Dirk
Henzinger, Thomas
Majumdar, Rupak
Rybalchenko, Andrey		dblp
dblp
dblp
dblp
Not MPG Author(s):
Beyer, Dirk
Henzinger, Thomas
Majumdar, Rupak
Editor(s):
Ferrante, Jeanne
McKinley, Kathryn S.		dblp
dblp
Not MPII Editor(s):
Ferrante, Jeanne
McKinley, Kathryn S.
BibTeX cite key*:
Rybalchenko2007PLDI-Paths
Title, Booktitle
Title*:
Path Invariants
Booktitle*:
PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation
Event, URLs
Conference URL::
Downloading URL:
http://delivery.acm.org/10.1145/1260000/1250769/p300-beyer.pdf?key1=1250769&key2=7012403811&coll=GUIDE&dl=GUIDE&CFID=26911364&CFTOKEN=44216692
Event Address*:
San Diego, CA, USA
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
19 March 2007
Event End Date:
19 March 2007
Publisher
Name*:
ACM
URL:
Address*:
New York, NY, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
Pages:
300-309
Year*:
2007
VG Wort Pages:
20
ISBN/ISSN:
978-1-59593-633-2
Sequence Number:
DOI:
10.1145/1250734.1250769
Note, Abstract, ©
(LaTeX) Abstract:
The success of software verification depends on the ability to find a suitable abstraction of a program automatically. We propose a method for automated abstraction refinement which overcomes some limitations of current predicate discovery schemes. In current schemes, the cause of a false alarm is identified as an infeasible error path, and the abstraction is refined in order to remove that path. By contrast, we view the cause of a false alarm -the spurious counterexample- as a full-fledged program, namely, a fragment of the original program whose control-flow graph may contain loops and represent unbounded computations. There are two advantages to using such path programs as counterexamples for abstraction refinement. First, we can bring the whole machinery of program analysis to bear on path programs, which are typically small compared to the original program. Specifically, we use constraint-based invariant generation to automatically infer invariants of path programs-so-called path invariants. Second, we use path invariants for abstraction refinement in order to remove not one infeasibility at a time, but at once all (possibly infinitely many) infeasible error computations that are represented by a path program. Unlike previous predicate discovery schemes, our method handles loops without unrolling them; it infers abstractions that involve universal quantification and naturally incorporates disjunctive reasoning.
URL for the Abstract:
http://doi.acm.org/10.1145/1250734.1250769
Download
Access Level:
Internal

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:
@INPROCEEDINGS{Rybalchenko2007PLDI-Paths,
AUTHOR = {Beyer, Dirk and Henzinger, Thomas and Majumdar, Rupak and Rybalchenko, Andrey},
 EDITOR = {Ferrante, Jeanne and McKinley, Kathryn S.},
 TITLE = {Path Invariants},
 BOOKTITLE = {PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation},
 PUBLISHER = {ACM},
 YEAR = {2007},
 PAGES = {300--309},
 ADDRESS = {San Diego, CA, USA},
 ISBN = {978-1-59593-633-2},
 DOI = {10.1145/1250734.1250769},
}

Entry last modified by Uwe Brahm, 01/28/2008
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Andrey Rybalchenko		Created
03/19/2007 12:02:40 AM
Revisions
8.
7.
6.
5.
4.		Editor(s)
Uwe Brahm
Uwe Brahm
Christine Kiesel
Christine Kiesel
Christine Kiesel		Edit Dates
2007-07-18 16:06:59
07/06/2007 23:58:08
29.06.2007 15:15:57
28.06.2007 17:39:54
28.06.2007 17:28:44