Probabilistic termination of CHRiSM programs

DOI10.1007/978-3-642-32211-2_15zbMATH Open1377.68067OpenAlexW1522121558MaRDI QIDQ4909326FDOQ4909326

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

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

zbMATH Keywords

termination analysisconstraint handling rulesprobabilistic LP

Mathematics Subject Classification ID

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

Cited In (7)

• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
• The probabilistic termination tool amber
• On the hardness of almost-sure termination
• On the hardness of analyzing probabilistic programs
• Termination Analysis of CHR Revisited
• Improved Termination Analysis of CHR Using Self-sustainability Analysis
• Title not available (Why is that?)

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)