Skip to main content

Fold/Unfold Transformations for Fixpoint Logic

Author(s): Kobayashi, Naoki; Fedyukovich, Grigory; Gupta, Aarti

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1d263
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKobayashi, Naoki-
dc.contributor.authorFedyukovich, Grigory-
dc.contributor.authorGupta, Aarti-
dc.date.accessioned2021-10-08T19:46:38Z-
dc.date.available2021-10-08T19:46:38Z-
dc.date.issued2020en_US
dc.identifier.citationKobayashi, Naoki, Grigory Fedyukovich, and Aarti Gupta. "Fold/Unfold Transformations for Fixpoint Logic." In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (2020): pp. 195-214. doi:10.1007/978-3-030-45237-7_12en_US
dc.identifier.issn0302-9743-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1d263-
dc.description.abstractFixpoint 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.en_US
dc.format.extent195 - 214en_US
dc.language.isoen_USen_US
dc.relation.ispartofInternational Conference on Tools and Algorithms for the Construction and Analysis of Systemsen_US
dc.rightsFinal published version. This is an open access article.en_US
dc.titleFold/Unfold Transformations for Fixpoint Logicen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1007/978-3-030-45237-7_12-
dc.identifier.eissn1611-3349-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
FoldUnfoldTransformationsFixpointLogic.pdf413.68 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.