State focusing: Lazy abstraction for the mu-calculus

Harald Fecher; Sharon Shoham

doi:10.1007/978-3-540-85114-1_9

State focusing: Lazy abstraction for the mu-calculus

Harald Fecher^*, Sharon Shoham

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English
Title of host publication	Model Checking Software - 15th International SPIN Workshop, Proceedings
Pages	95-113
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-540-85114-1_9
State	Published - 2008
Externally published	Yes
Event	15th International SPIN Workshop on Model Checking of Software, SPIN 2008 - Los Angeles, CA, United States Duration: 10 Aug 2008 → 12 Aug 2008

Publication series

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

Conference

Conference	15th International SPIN Workshop on Model Checking of Software, SPIN 2008
Country/Territory	United States
City	Los Angeles, CA
Period	10/08/08 → 12/08/08

Access to Document

10.1007/978-3-540-85114-1_9

Cite this

Fecher, H., & Shoham, S. (2008). State focusing: Lazy abstraction for the mu-calculus. In Model Checking Software - 15th International SPIN Workshop, Proceedings (pp. 95-113). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5156 LNCS). https://doi.org/10.1007/978-3-540-85114-1_9

@inproceedings{f4c925c5532a4efc83d7cf11d0db4c68,

title = "State focusing: Lazy abstraction for the mu-calculus",

abstract = "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.",

author = "Harald Fecher and Sharon Shoham",

note = "Funding Information: This work is financially supported by the DFG projects (FE 942/2-1) and (SFB/TR 14 AVACS).; 15th International SPIN Workshop on Model Checking of Software, SPIN 2008 ; Conference date: 10-08-2008 Through 12-08-2008",

year = "2008",

doi = "10.1007/978-3-540-85114-1_9",

language = "אנגלית",

isbn = "3540851135",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "95--113",

booktitle = "Model Checking Software - 15th International SPIN Workshop, Proceedings",

}

Fecher, H & Shoham, S 2008, State focusing: Lazy abstraction for the mu-calculus. in Model Checking Software - 15th International SPIN Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5156 LNCS, pp. 95-113, 15th International SPIN Workshop on Model Checking of Software, SPIN 2008, Los Angeles, CA, United States, 10/08/08. https://doi.org/10.1007/978-3-540-85114-1_9

State focusing: Lazy abstraction for the mu-calculus. / Fecher, Harald; Shoham, Sharon.
Model Checking Software - 15th International SPIN Workshop, Proceedings. 2008. p. 95-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5156 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - State focusing

T2 - 15th International SPIN Workshop on Model Checking of Software, SPIN 2008

AU - Fecher, Harald

AU - Shoham, Sharon

N1 - Funding Information: This work is financially supported by the DFG projects (FE 942/2-1) and (SFB/TR 14 AVACS).

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=54249133984&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85114-1_9

DO - 10.1007/978-3-540-85114-1_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:54249133984

SN - 3540851135

SN - 9783540851134

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 95

EP - 113

BT - Model Checking Software - 15th International SPIN Workshop, Proceedings

Y2 - 10 August 2008 through 12 August 2008

ER -

State focusing: Lazy abstraction for the mu-calculus

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this