Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Path Invariants

Beyer, D., Henzinger, T., Majumdar, R., & Rybalchenko, A. (2007). Path Invariants. In J. Ferrante, & K. S. McKinley (Eds.), PLDI'07: Proceedings of the 2007 Conference on Programming Language Design and Implementation (pp. 300-309). New York, NY, USA: ACM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2047-0 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2048-E
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
Rybalchenko2007PLDI-Paths.pdf (beliebiger Volltext), 5KB
 
Datei-Permalink:
-
Name:
Rybalchenko2007PLDI-Paths.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Beyer, Dirk, Autor
Henzinger, Thomas, Autor
Majumdar, Rupak, Autor
Rybalchenko, Andrey1, Autor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2008-03-072007
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, NY, USA : ACM
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 356629
DOI: 10.1145/1250734.1250769
Anderer: Local-ID: C12573CC004A8E26-48258C5145573B41C12572A2007E9680-Rybalchenko2007PLDI-Paths
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: San Diego, CA, USA
Start-/Enddatum: 2007-06-10 - 2007-06-13

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: PLDI'07 : Proceedings of the 2007 Conference on Programming Language Design and Implementation
Genre der Quelle: Konferenzband
 Urheber:
Ferrante, Jeanne, Herausgeber
McKinley, Kathryn S., Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: New York, NY, USA : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 300 - 309 Identifikator: ISBN: 978-1-59593-633-2