Ranking Abstraction of Recursive Programs

  • Ittai Balaban
  • Ariel Cohen
  • Amir Pnueli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3855)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ittai Balaban
    • 1
  • Ariel Cohen
    • 1
  • Amir Pnueli
    • 1
    • 2
  1. 1.Dept. of Computer ScienceNew York University 
  2. 2.Dept. of Computer ScienceWeizmann Institute of ScienceRehovotIsrael

Personalised recommendations