Modular Model Checking of Software (1997)
| Venue: | In Conference on Tools and Algorithms for the Construction and Analysis of Systems |
| Citations: | 18 - 0 self |
BibTeX
@INPROCEEDINGS{Laster97modularmodel,
author = {Karen Laster and Orna Grumberg},
title = {Modular Model Checking of Software},
booktitle = {In Conference on Tools and Algorithms for the Construction and Analysis of Systems},
year = {1997},
pages = {pages}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This work presents a modular approach to temporal logic model checking of software. Model checking is a method that automatically determines whether a finite state system satisfies a temporal logic specification. Model checking algorithms have been successfully used to verify complex systems. However, their use is limited by the high space requirements needed to represent the verified system. When hardware designs are considered, a typical solution is to partition the design into units running in parallel, and handle each unit separately. For software systems such a solution is not always feasible. This is because a software system might be too large to fit into memory even when it consists of a single sequential unit. To avoid the high space requirements for software we suggest to partition the program text into sequentially composed subprograms. Based on this partition, we present a model checking algorithm for software that arrives at its conclusion by examining each subprogram in s...
