Temporal property verification as a program analysis task

Byron Cook, Eric Koskinen, Moshe Vardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

27 Scopus citations

Abstract

We describe a reduction from temporal property verification to a program analysis problem. We produce an encoding which, with the use of recursion 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.

Original languageEnglish
Title of host publicationComputer Aided Verification - 23rd International Conference, CAV 2011, Proceedings
Pages333-348
Number of pages16
DOIs
StatePublished - 2011
Event23rd International Conference on Computer Aided Verification, CAV 2011 - Snowbird, UT, United States
Duration: 14 Jul 201120 Jul 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6806 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Conference on Computer Aided Verification, CAV 2011
Country/TerritoryUnited States
CitySnowbird, UT
Period14/07/1120/07/11

Fingerprint

Dive into the research topics of 'Temporal property verification as a program analysis task'. Together they form a unique fingerprint.

Cite this