TY - GEN
T1 - Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems
AU - Padon, Oded
AU - Hoenicke, Jochen
AU - McMillan, Kenneth L.
AU - Podelski, Andreas
AU - Sagiv, Mooly
AU - Shoham, Sharon
N1 - Publisher Copyright:
© 2018 FMCAD Inc.
PY - 2019/1/4
Y1 - 2019/1/4
N2 - Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imprecise. That is, for some instances, the temporal property holds, but the resulting safety property does not. This paper introduces a mechanism for tackling this imprecision. This mechanism, which we call temporal prophecy, is inspired by prophecy variables. Temporal prophecy refines an infinite-state system using first-order linear temporal logic formulas, via a suitable tableau construction. For a specific liveness-to-safety transformation based on first-order logic, we show that using temporal prophecy strictly increases the precision. Furthermore, temporal prophecy leads to robustness of the proof method, which is manifested by a cut elimination theorem. We integrate our approach into the Ivy deductive verification system, and show that it can handle challenging temporal verification examples.
AB - Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imprecise. That is, for some instances, the temporal property holds, but the resulting safety property does not. This paper introduces a mechanism for tackling this imprecision. This mechanism, which we call temporal prophecy, is inspired by prophecy variables. Temporal prophecy refines an infinite-state system using first-order linear temporal logic formulas, via a suitable tableau construction. For a specific liveness-to-safety transformation based on first-order logic, we show that using temporal prophecy strictly increases the precision. Furthermore, temporal prophecy leads to robustness of the proof method, which is manifested by a cut elimination theorem. We integrate our approach into the Ivy deductive verification system, and show that it can handle challenging temporal verification examples.
UR - http://www.scopus.com/inward/record.url?scp=85061622895&partnerID=8YFLogxK
U2 - 10.23919/FMCAD.2018.8603008
DO - 10.23919/FMCAD.2018.8603008
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85061622895
T3 - Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design, FMCAD 2018
SP - 74
EP - 84
BT - Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design, FMCAD 2018
A2 - Bjorner, Nikolaj
A2 - Gurfinkel, Arie
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th Conference on Formal Methods in Computer-Aided Design, FMCAD 2018
Y2 - 30 October 2018 through 2 November 2018
ER -