Perfect model checking via unfold/fold transformations

DOI10.1007/3-540-44957-4_41MaRDI QIDQ2767091zbMATH OpenFDO

Authors Alberto Pettorossi, Maurizio Proietti

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44957-4_41

Mathematics Subject Classification ID

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

Recommendations

• Unfold/fold transformation of stratified programs
• Equivalence-preserving first-order unfold/fold transformation systems
• Transformation rules for locally stratified constraint logic programs
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• On inductive proofs by extended unfold/fold transformation rules

Cited in

(7)

• Model checking using net unfoldings
• Asynchronous unfold/fold transformation for fixpoint logic
• On inductive proofs by extended unfold/fold transformation rules
• On Negative Unfolding in the Answer Set Semantics
• Anti-unification in constraint logic programming
• Fold/unfold transformations for fixpoint logic
• Transformation rules for locally stratified constraint logic programs

This page was built for publication: Perfect model checking via unfold/fold transformations

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