Proving Termination by Invariance Relations

DOI10.1007/978-3-642-02846-5_42zbMath1251.68066OpenAlexW1845749915MaRDI QIDQ5325774

Paolo Pilozzi, Danny De Schreye

Publication date: 24 July 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_42

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Deriving descriptions of possible values of program variables by means of abstract interpretation
• Theory and practice of constraint handling rules
• Termination of logic programs: the never-ending story
• Logic Programming
• Logic Programming
• Termination Analysis of CHR Revisited

This page was built for publication: Proving Termination by Invariance Relations