We describe here the PET (standing for path exploration tool) system, developed in Bell Labs. This new tool allows an interactive testing of sequential or concurrent programs, using techniques taken from deductive program verification. It automatically generates and displays a graphical representation of the flow graph, and links the visual representation to the code. Testing is done by selecting execution paths, or, in the case of concurrent programs, interleaved sequences of code. The Pet system calculates the exact condition to execute path being selected, in terms of the program variables. It also calculates (when possible) whether this condition is vacuous (never satisfied) or universal (always satisfied). The user can then edit the path and select variants of it by either extending it, truncating it, or switching the order of appearance of concurrent events. This testing approach is not limited to finite state systems, and hence can be used in cases where a completely automatic verification cannot be applied.
|Title of host publication||Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings|
|Editors||E. Allen Emerson, A. Prasad Sistla|
|Number of pages||5|
|State||Published - 2000|
|Event||12th International Conference on Computer Aided Verification, CAV 2000 - Chicago, United States|
Duration: 15 Jul 2000 → 19 Jul 2000
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||12th International Conference on Computer Aided Verification, CAV 2000|
|Period||15/07/00 → 19/07/00|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.