Ranking abstraction of recursive programs

I Balaban, Ayala Cohen, Amir Pnueli

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)267-281
Number of pages15
JournalVerification, Model Checking , And Abstract Interpretation, Proceedings
Volume3855
Publication statusPublished - 2006
Event7th International Conference on Verification, Model Checking, and Abstract Interpretation - Charleston, SC
Duration: 8 Jan 200610 Jan 2006

Fingerprint

Dive into the research topics of 'Ranking abstraction of recursive programs'. Together they form a unique fingerprint.

Cite this