An abstract interpretation framework for termination

DOI10.1145/2103656.2103687zbMath1321.68190OpenAlexW4240185672MaRDI QIDQ2942877

Patrick Cousot, Radhia Cousot

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2103656.2103687

zbMATH Keywords

verificationsafetystatic analysisinductionterminationabstract interpretationvariant function

Mathematics Subject Classification ID

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

Related Items (6)

Reflections on termination of linear loops ⋮ Predicate Abstraction for Program Verification ⋮ Inference of ranking functions for proving temporal properties by abstract interpretation ⋮ Proving Termination by Policy Iteration ⋮ Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations ⋮ Temporal prophecy for proving temporal properties of infinite-state systems

This page was built for publication: An abstract interpretation framework for termination