Proving Properties of Co-Logic Programs by Unfold/Fold Transformations

DOI10.1007/978-3-642-32211-2_14zbMath1377.68066OpenAlexW1517223672MaRDI QIDQ4909325

Hirohisa Seki

Publication date: 13 March 2013

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32211-2_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Asynchronous unfold/fold transformation for fixpoint logic ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ On Dual Programs in Co-Logic Programming

This page was built for publication: Proving Properties of Co-Logic Programs by Unfold/Fold Transformations