.png){kind=icon}
.png){kind=icon}
Return
IC3 for Loop Invariant Generation in Deductive Analysis
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-00942-5_5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce a framework for programmable logic controller programs that combines a deductive verification approach on control flow automata with an inductive verification technique used to automatically derive loop invariants. The deductive verification is based on Hoare triples that are propagated through loop-free sections of the program using strongest postcondition and weakest precondition. Loop invariants are derived from loop pre- and postconditions with a modified version of the IC3 algorithm with predicate abstraction. While this approach is straightforward for programs with a single loop, programs with multiple loops require iterating potential loop invariants between the loops until an overall proof can be found. We demonstrate the efficacy of our approach by evaluating example programs, showing both improved performance compared to inductive verification of the complete program, and a push-button approach to deductive verification requiring - ideally - no user-supplied loop invariants.
Keywords:
Deductive Verification
Program Analysis
Safety
Programmable Logic Controllers
Journal
F
IF:
0
Papers:
15
Citations:
0