Improved Termination Analysis of CHR Using Self-sustainability Analysis

DOI10.1007/978-3-642-32211-2_13MaRDI QIDQ4909324zbMATH OpenOpenAlexFDO

Authors Paolo Pilozzi, Danny De Schreye

Publication date 13 March 2013

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

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

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Termination Analysis of CHR Revisited
• Automating Termination Proofs for CHR
• Logic Programming
• Probabilistic termination of CHRiSM programs
• Reachability Analysis of Self Modifying Code
• Improvement of a reachability analysis algorithm for real-time systems
• scientific article; zbMATH DE number 756052
• scientific article; zbMATH DE number 2104641
• Tighter reachability criteria for deadlock-freedom analysis

Cited in

(6)

• Models and emerging trends of concurrent constraint programming
• scientific article; zbMATH DE number 7047281 (Why is no real title available?)
• Probabilistic termination of CHRiSM programs
• Proving Termination by Invariance Relations
• Automating Termination Proofs for CHR
• Termination Analysis of CHR Revisited

This page was built for publication: Improved Termination Analysis of CHR Using Self-sustainability Analysis

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