Steinhöfel, Dominic ; Wasser, Nathan (2017)
A New Invariant Rule for the Analysis of Loops with Non-standard Control Flows.
Report, Bibliographie
Kurzbeschreibung (Abstract)
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the late 1960s. For real-world languages like Java, loop invariant rules tend to become extremely complex. The main reason is non-standard control flow induced by return, throw, break, and continue statements, possibly combined and nested inside inner loops and try blocks. We propose the concept of a loop scope which gives rise to a new approach for the design of invariant rules. This permits “sandboxed” deduction-based symbolic execution of loop bodies which in turn allows a modular analysis even of complex loops. Based on the new concept we designed a loop invariant rule for Java that has full language coverage and implemented it in the program verification system KeY. Its main advantages are (1) much increased comprehensibility, which made it considerably easier to argue for its soundness, (2) simpler and easier to understand proof obligations, (3) a substantially decreased number of symbolic execution steps and sizes of resulting proofs in a representative set of experiments. We also show that the new rule, in combination with fully automatic symbolic state merging, realizes even greater proof size reduction and helps to address the state explosion problem of symbolic execution.
| Typ des Eintrags: | Report |
|---|---|
| Erschienen: | 2017 |
| Autor(en): | Steinhöfel, Dominic ; Wasser, Nathan |
| Art des Eintrags: | Bibliographie |
| Titel: | A New Invariant Rule for the Analysis of Loops with Non-standard Control Flows |
| Sprache: | Englisch |
| Publikationsjahr: | April 2017 |
| Ort: | Darmstadt |
| Verlag: | Technische Universität |
| Reihe: | Technical Report |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the late 1960s. For real-world languages like Java, loop invariant rules tend to become extremely complex. The main reason is non-standard control flow induced by return, throw, break, and continue statements, possibly combined and nested inside inner loops and try blocks. We propose the concept of a loop scope which gives rise to a new approach for the design of invariant rules. This permits “sandboxed” deduction-based symbolic execution of loop bodies which in turn allows a modular analysis even of complex loops. Based on the new concept we designed a loop invariant rule for Java that has full language coverage and implemented it in the program verification system KeY. Its main advantages are (1) much increased comprehensibility, which made it considerably easier to argue for its soundness, (2) simpler and easier to understand proof obligations, (3) a substantially decreased number of symbolic execution steps and sizes of resulting proofs in a representative set of experiments. We also show that the new rule, in combination with fully automatic symbolic state merging, realizes even greater proof size reduction and helps to address the state explosion problem of symbolic execution. |
| Freie Schlagworte: | Program Verification, Loop Invariants, Abnormal Termination, Non-Standard Control Flow, Symbolic Execution, Proof Size Reduction |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Software Engineering |
| Hinterlegungsdatum: | 07 Mär 2017 15:18 |
| Letzte Änderung: | 15 Aug 2023 11:10 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum