Unit checking: Symbolic model checking for a unit of code ESSAYS DEDICATED TO ZHOAR MANNA ON THE OCCASION OF HIS 64TH BIRTHDAY
UNSPECIFIED (2003) Unit checking: Symbolic model checking for a unit of code ESSAYS DEDICATED TO ZHOAR MANNA ON THE OCCASION OF HIS 64TH BIRTHDAY. In: International Symposium on Verification - Theory and Practice in honor of the 64th Birthday of Zohar Manna, JUN 29-JUL 04, 2003, Taormina, Italy.Full text not available from this repository.
We present a symbolic model checking approach that allows verifying a unit of code, e.g., a single procedure or a collection of procedures that interact with each other. We allow temporal specification that make assertions about both the program counters and the program variables. We decompose the verification into two parts: (1) a search that is based on the temporal behavior of the program counters, and (2) the formulation and refutation of a path condition, which. inherits conditions on the program variables from the temporal specification. This verification approach is modular, as there is no requirement that all the involved procedures are provided. Furthermore, we do not require that the code is based on a finite domain. The presented approach can also be used for automating the generation of test cases for unit testing.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||VERIFICATION: THEORY AND PRACTICE|
|Number of Pages:||20|
|Page Range:||pp. 548-567|
|Title of Event:||International Symposium on Verification - Theory and Practice in honor of the 64th Birthday of Zohar Manna|
|Location of Event:||Taormina, Italy|
|Date(s) of Event:||JUN 29-JUL 04, 2003|
Actions (login required)