On Inductive Verification and Synthesis
We study possibilities of using symbol elimination in program verification and synthesis. We consider programs for which a property is given, which is supposed to hold for all states reachable from the initial states. If it can not be proven that such a formula is an inductive invariant, the task is to find conditions to strengthen the property in order to make it an inductive invariant. We propose a method for property-directed invariant generation and analyze its properties.
2019 ◽
Vol 1163
◽
pp. 012005
Keyword(s):
Keyword(s):