Local abstraction-refinement for the mu-calculus

Harald Fecher*, Sharon Shoham

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations


Counterexample-guided abstraction refinement (CEGAR) is a key technique for the verification of computer programs. Grumberg et al. developed a CEGAR-based algorithm for the modal μ-calculus. There, every abstract state is split in a refinement step. In this paper, the work of Grumberg et al. is generalized by presenting a new CEGAR-based algorithm for the μ-calculus. It is based on a more expressive abstract model and applies refinement only locally (at a single abstract state), i.e., the lazy abstraction technique for safety properties is adapted to the μ-calculus. Furthermore, it separates refinement determination from the (3-valued based) model checking. Three different heuristics for refinement determination are presented and illustrated.

Original languageEnglish
Pages (from-to)4-23
Number of pages20
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4595 LNCS
StatePublished - 2007
Externally publishedYes
Event14th International SPIN Workshop: Model Checking Software, 2007 - Berlin, Germany
Duration: 1 Jul 20073 Jul 2007


Dive into the research topics of 'Local abstraction-refinement for the mu-calculus'. Together they form a unique fingerprint.

Cite this