Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Variance Analyses from Invariance Analyses

Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, and Peter O'Hearn

Abstract

An invariance assertion for a program location l is a statement that always holds at l during execution of the program. Program invariance analyses infer invariance assertions that can be useful when trying to prove safety properties. We use the term variance assertion to mean a statement that holds between any state at l and any previous state that was also at l. This paper is concerned with the development of analyses for variance assertions and their application to proving termination and liveness properties. We describe a method of constructing program variance analyses from invariance analyses. If we change the underlying invariance analysis, we get a different variance analysis. We describe several applications of the method, including variance analyses using linear arithmetic and shape analysis. Using experimental results we demonstrate that these variance analyses give rise to a new breed of termination provers which are competitive with and sometimes better than today's state-of-the-art termination provers.

Details

Publication typeInproceedings
Published inProceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007
Pages211-224
ISBN1-59593-575-4
PublisherACM
> Publications > Variance Analyses from Invariance Analyses