State focusing: Lazy abstraction for the mu-calculus

Harald Fecher*, Sharon Shoham

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


A key technique for the verification of programs is counterexample-guided abstraction refinement (CEGAR). In a previous approach, we developed a CEGAR-based algorithm for the modal μ-calculus, where refinement applies only locally, i.e. lazy abstraction techniques are used. Unfortunately, our previous algorithm was not completely lazy and had some further drawbacks, like a possible local state explosion. In this paper, we present an improved algorithm that maintains all advantages of our previous algorithm but eliminates all its drawbacks. The improvements were only possible by changing the philosophy of refinement from state splitting into the new philosophy of state focusing, where the states that are about to be split are not removed.

Original languageEnglish
Title of host publicationModel Checking Software - 15th International SPIN Workshop, Proceedings
Number of pages19
StatePublished - 2008
Externally publishedYes
Event15th International SPIN Workshop on Model Checking of Software, SPIN 2008 - Los Angeles, CA, United States
Duration: 10 Aug 200812 Aug 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5156 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International SPIN Workshop on Model Checking of Software, SPIN 2008
Country/TerritoryUnited States
CityLos Angeles, CA


FundersFunder number
Deutsche ForschungsgemeinschaftSFB/TR 14 AVACS, FE 942/2-1


    Dive into the research topics of 'State focusing: Lazy abstraction for the mu-calculus'. Together they form a unique fingerprint.

    Cite this