Ranking Abstraction as Companion to Predicate Abstraction
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
Predicate abstraction has become one of the most successful methodologies for proving safety properties of programs. Recently, several abstraction methodologies have been proposed for proving liveness properties. This paper studies “ranking abstraction” where a program is augmented by a nonconstraining progress monitor, and further abstracted by predicate-abstraction, to allow for automatic verification of progress properties. Unlike most liveness methodologies, the augmentation does not require a complete ranking function that is expected to decrease with each step. Rather, the inputs are component rankings from which a complete ranking function may be formed.
The premise of the paper is an analogy between the methods of ranking abstraction and predicate abstraction, one ingredient of which is refinement: When predicate abstraction fails, one can refine it. When ranking abstraction fails, one must determine whether the predicate abstraction, or the ranking abstraction, need be refined. The paper presents strategies for determining which case is at hand.
The other part of the analogy is that of automatically deriving deductive proof constructs: Predicate abstraction is often used to derive program invariants for proving safety properties as a boolean combination of the given predicates. Deductive proof of progress properties requires well-founded ranking functions instead of invariants. We show how to obtain concrete global ranking functions from abstract programs.
We demonstrate the various methods on examples with nested loops, including a bubble sort algorithm on linked lists.
- Pnueli, A., Shahar, E.: A platform combining deductive with algorithmic verification. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, p. 184. Springer, Heidelberg (1996)
- Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis by predicate abstraction. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 164–180. Springer, Heidelberg (2005) CrossRef
- Ball, T., Podelski, A., Rajamani, S.K.: Relative completeness of abstraction refinement for software model checking. Tools and Algorithms for Construction and Analysis of Systems, 158–172 (2002)
- Ball, T., Rajamani, S.K.: Automatically validating temporal safety properties of interfaces. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, p. 103. Springer, Heidelberg (2001) CrossRef
- Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. Computer Aided Verification, 154–169 (2000)
- Dams, D., Gerth, R., Grumberg, O.: A heuristic for the automatic generation of ranking functions. In: Gopalakrishnan, G. (ed.) Workshop on Advances in Verification, pp. 1–8 (2000)
- Kesten, Y., Pnueli, A.: Verification by augmented finitary abstraction. Information and Computation 163(1), 203–243 (2000) CrossRef
- Lichtenstein, O., Pnueli, A.: Checking that finite-state concurrent programs satisfy their linear specification. In: Proc. 12th ACM Symp. Princ. of Prog. Lang., pp. 97–107 (1985)
- Podelski, A., Rybalchenko, A.: Software model checking of liveness properties via transition invariants. Research Report MPI-I-2003-2-004, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany (December 2003)
- Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. Verification, Model Checking, and Abstract Interpretation, 239–251 (2004)
- Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)
- Ranking Abstraction as Companion to Predicate Abstraction
- Book Title
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Book Subtitle
- 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005. Proceedings
- pp 1-12
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Farn Wang (16)
- Editor Affiliations
- 16. Grad. Inst. of Electronic Engineering, National Taiwan University
- Author Affiliations
- 17. New York University, New York
- 18. Weizmann Institute of Science,
- 19. University of Illinois at Chicago,
To view the rest of this content please follow the download PDF link above.