Cargando…
Fold/Unfold Transformations for Fixpoint Logic
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 a...
Autores principales: | Kobayashi, Naoki, Fedyukovich, Grigory, Gupta, Aarti |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7480701/ http://dx.doi.org/10.1007/978-3-030-45237-7_12 |
Ejemplares similares
-
Fixpoint Theory – Upside Down
por: Baldan, Paolo, et al.
Publicado: (2021) -
Quasipolynomial Computation of Nested Fixpoints
por: Hausmann, Daniel, et al.
Publicado: (2021) -
To fold, first unfold
por: Robinson, Richard
Publicado: (2008) -
Bridging Arrays and ADTs in Recursive Proofs
por: Fedyukovich, Grigory, et al.
Publicado: (2021) -
Folding and unfolding phylogenetic trees and networks
por: Huber, Katharina T., et al.
Publicado: (2016)