.png){kind=icon}
.png){kind=icon}
Return
Input-Based Three-Valued Abstraction Refinement
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-15700-3_12.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Unlike Counterexample-Guided Abstraction Refinement (CEGAR), Three-Valued Abstraction Refinement (TVAR) is able to verify all properties of the -calculus. We present a novel algorithmic framework for TVAR that employs a simulator-like approach to build and refine the abstract state space with input-based splitting. This leads to a state space formalism that is much simpler than in previous TVAR frameworks, which use modal transitions. We implemented the framework in our open-source tool machine-check and verified properties of machine-code systems for the AVR architecture, showing the ability to verify systems and mu-calculus properties not verifiable by naive model checking or CEGAR, respectively. This is the first practical use of TVAR for machine-code verification.
Keywords:
Model checking
Abstraction
Partial Kripke Structure
mu-calculus
Journal
V
IF:
0
Papers:
18
Citations:
0