Transition invariants and transition predicate abstraction for program termination

Authors:
Andreas Podelski;Andrey Rybalchenko
Affiliations:
University of Freiburg;Technische Universität München
Venue:
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 3
Cited 3

Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Checking models, proving programs, and testing systems

TAP'11 Proceedings of the 5th international conference on Tests and proofs
Proving termination of probabilistic programs using patterns

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Verifying while loops with invariant relations

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Originally, the concepts of transition invariants and transition predicate abstraction were used to formulate a proof rule and an abstraction-based algorithm for the verification of liveness properties of concurrent programs under fairness assumptions. This note applies the two concepts for proving termination of sequential programs. We believe that the specialized setting exhibits the underlying principles in a more direct way.