Local abstraction-refinement for the mu-calculus

Harald Fecher; Sharon Shoham

doi:10.1007/978-3-540-73370-6_3

Local abstraction-refinement for the mu-calculus

Harald Fecher^*, Sharon Shoham

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

5 Scopus citations

Abstract

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 language	English
Pages (from-to)	4-23
Number of pages	20
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4595 LNCS
DOIs	https://doi.org/10.1007/978-3-540-73370-6_3
State	Published - 2007
Externally published	Yes
Event	14th International SPIN Workshop: Model Checking Software, 2007 - Berlin, Germany Duration: 1 Jul 2007 → 3 Jul 2007

Access to Document

10.1007/978-3-540-73370-6_3

Cite this

@article{08e15e7f33aa4ef5abfd2482314062a4,

title = "Local abstraction-refinement for the mu-calculus",

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

author = "Harald Fecher and Sharon Shoham",

year = "2007",

doi = "10.1007/978-3-540-73370-6_3",

language = "אנגלית",

volume = "4595 LNCS",

pages = "4--23",

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

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "14th International SPIN Workshop: Model Checking Software, 2007 ; Conference date: 01-07-2007 Through 03-07-2007",

}

TY - JOUR

T1 - Local abstraction-refinement for the mu-calculus

AU - Fecher, Harald

AU - Shoham, Sharon

PY - 2007

Y1 - 2007

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

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

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

U2 - 10.1007/978-3-540-73370-6_3

DO - 10.1007/978-3-540-73370-6_3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:38149048145

SN - 0302-9743

VL - 4595 LNCS

SP - 4

EP - 23

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

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

T2 - 14th International SPIN Workshop: Model Checking Software, 2007

Y2 - 1 July 2007 through 3 July 2007

ER -

Local abstraction-refinement for the mu-calculus

Abstract

Access to Document

Other files and links

Fingerprint

Cite this