Probabilistic termination of CHRiSM programs

DOI10.1007/978-3-642-32211-2_15MaRDI QIDQ4909326zbMATH OpenOpenAlexFDO

Authors Jon Sneyers, 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/370411

zbMATH Keywords

constraint handling rulesprobabilistic LPtermination analysis

Mathematics Subject Classification ID

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

Recommendations

• Termination Analysis of CHR Revisited
• Automating Termination Proofs for CHR
• Improved Termination Analysis of CHR Using Self-sustainability Analysis
• CHR(PRISM)-based probabilistic logic learning
• Proving Termination by Invariance Relations

Cited in

(7)

• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
• On the hardness of analyzing probabilistic programs
• On the hardness of almost-sure termination
• scientific article; zbMATH DE number 7047281 (Why is no real title available?)
• Improved Termination Analysis of CHR Using Self-sustainability Analysis
• Termination Analysis of CHR Revisited
• The probabilistic termination tool amber

This page was built for publication: Probabilistic termination of CHRiSM programs

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