Bibliographic Details
| Title: |
Temporal property verification as a program analysis task. |
| Authors: |
Cook, Byron1 bycook@microsoft.com, Koskinen, Eric2 ejk@cims.nyu.edu, Vardi, Moshe3 vardi@cs.rice.edu |
| Source: |
Formal Methods in System Design. Aug2012, Vol. 41 Issue 1, p66-82. 17p. |
| Subjects: |
Temporal databases, Computer software, Computer systems, Internet servers, Online databases, Client/server computing |
| Abstract: |
We describe a reduction from temporal property verification to a program analysis problem. First we present a proof system that, unlike the standard formulation, is more amenable to reasoning about infinite-state systems: disjunction is treated by partitioning, rather than enumerating, the state space and temporal operators are characterized with special sets of states called frontiers. We then describe a transformation that, with the use of procedures and nondeterminism, enables off-the-shelf program analysis tools to naturally perform the reasoning necessary for proving temporal properties ( e.g. backtracking, eventuality checking, tree counterexamples for branching-time properties, abstraction refinement, etc.). Using examples drawn from the PostgreSQL database server, Apache web server, and Windows OS kernel, we demonstrate the practical viability of our work. [ABSTRACT FROM AUTHOR] |
|
Copyright of Formal Methods in System Design is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
