Verification, Model Checking, and Abstract Interpretation

Volume 3855 of the series Lecture Notes in Computer Science pp 267-281

Ranking Abstraction of Recursive Programs

  • Ittai BalabanAffiliated withDept. of Computer Science, New York University
  • , Ariel CohenAffiliated withDept. of Computer Science, New York University
  • , Amir PnueliAffiliated withDept. of Computer Science, New York UniversityDept. of Computer Science, Weizmann Institute of Science

* Final gross prices may vary according to local VAT.

Get Access


We present a method for model-checking of safety and liveness properties over procedural programs, by combining state and ranking abstractions with procedure summarization. Our abstraction is an augmented finitary abstraction [KP00,BPZ05], meaning that a concrete procedural program is first augmented with a well founded ranking function, and then abstracted by a finitary state abstraction. This results in a procedural abstract program with strong fairness requirements which is then reduced to a finite-state fair discrete system (fds) using procedure summarization. This fds is then model checked for the property.