Fold/Unfold Transformations for Fixpoint Logic
Abstract Fixpoint logics have recently been drawing attention as common foundations for automated program verification. We formalize fold/unfold transformations for fixpoint logic formulas and show how they can be used to enhance a recent fixpoint-logic approach to automated program verification, including automated verification of relational and temporal properties. We have implemented the transformations in a tool and confirmed its effectiveness through experiments.
2020 ◽
Vol 63
(4)
◽
pp. 1270-1281
2017 ◽
Vol 12
(2)
◽
pp. 16
Keyword(s):
2019 ◽
Vol 8
(3)
◽
pp. 5926-5929