A Transformational Approach for Proving Properties of the CHR Constraint Store

DOI10.1007/978-3-642-12592-8_3MaRDI QIDQ3558283zbMATH OpenOpenAlexFDO

Authors Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe

Publication date 4 May 2010

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

Full work available at URL https://lirias.kuleuven.be/handle/123456789/267708

zbMATH Keywords

Constraint Handling Rulesprogram transformation

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Constraint-based correctness proofs for logic program transformations
• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 1337861
• Transforming constraint logic programs
• A proof system with bounded non-determinism in database transformations
• Verification of imperative programs by constraint logic program transformation
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• scientific article; zbMATH DE number 1487975
• Program Development in Computational Logic

Cited in

(3)

• Analysing graph transformation systems through constraint handling rules
• Automating Termination Proofs for CHR
• Termination Analysis of CHR Revisited

This page was built for publication: A Transformational Approach for Proving Properties of the CHR Constraint Store

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