DMCA
Composite Model Checking: Verification with Type-Specific Symbolic Representations (2000)
| Venue: | ACM Transactions on Software Engineering and Methodology |
| Citations: | 30 - 7 self |
BibTeX
@ARTICLE{Bultan00compositemodel,
author = {Tevfik Bultan and Richard Gerber and Christopher League},
title = {Composite Model Checking: Verification with Type-Specific Symbolic Representations},
journal = {ACM Transactions on Software Engineering and Methodology},
year = {2000},
volume = {9}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In recent years, there has been a surge of progress in automated verification methods based on state exploration. In areas like hardware design, these technologies are rapidly augmenting key phases of testing and validation. To date, one of the most successful of these methods has been symbolic model checking, in which large finite-state machines are encoded into compact data structures such as binary decision diagrams (BDDs) -- and are then checked for safety and liveness properties. However, these techniques have not realized the same success on software systems. One limitation is their inability to deal with infinite-state programs -- even those with a single unbounded integer. A second problem is that of finding efficient representations for various variable types. We recently proposed a model checker for integer-based systems that uses arithmetic constraints as the underlying state representation. While this approach easily verified some subtle, infinite-state concurrency problems...
Keyphrases
type-specific symbolic representation composite model checking state representation key phase compact data structure hardware design symbolic model checking various variable type infinite-state concurrency problem second problem binary decision diagram large finite-state machine state exploration infinite-state program model checker integer-based system software system liveness property single unbounded integer efficient representation recent year arithmetic constraint automated verification method
