Proving properties of co-logic programs by unfold/fold transformations

DOI10.1007/978-3-642-32211-2_14MaRDI QIDQ4909325zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Proving properties of co-logic programs with negation by program transformations
• On Inductive and Coinductive Proofs via Unfold/Fold Transformations
• Transformations of logic programs on infinite lists
• Proving theorems by program transformation
• On inductive proofs by extended unfold/fold transformation rules

Cited in

(8)

• Asynchronous unfold/fold transformation for fixpoint logic
• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
• Proving properties of co-logic programs with negation by program transformations
• On Inductive and Coinductive Proofs via Unfold/Fold Transformations
• Transformations of logic programs on infinite lists
• Fold/unfold transformations for fixpoint logic
• On dual programs in co-logic programming
• Analysis and Transformation of Constrained Horn Clauses for Program Verification

This page was built for publication: Proving properties of co-logic programs by unfold/fold transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909325)