Temporal property verification as a program analysis task

Authors:
Byron Cook;Eric Koskinen;Moshe Vardi
Affiliations:
Microsoft Research and University College London, London, UK;New York University, New York, USA;Rice University, Houston, USA
Venue:
Formal Methods in System Design
Year:
2012

Citing 33
Cited 1

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Precise interprocedural dataflow analysis via graph reachability

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Model checking

Model checking
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Tree-Like Counterexamples in Model Checking

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Games and Modal Mu-Calculus

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking CTL Properties of Pushdown Systems

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Fast LTL to Büchi Automata Translation

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract)

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Variance analyses from invariance analyses

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving that programs eventually do something good

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
The software model checker Blast: Applications to software engineering

International Journal on Software Tools for Technology Transfer (STTT)
Compositional shape analysis by means of bi-abduction

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Making prophecies with decision predicates

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program specialization for verifying infinite state systems: an experimental evaluation

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Temporal property verification as a program analysis task

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The polyranking principle

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
YASM: a software model-checker for verification and refutation

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
State/Event software verification for branching-time specifications

IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Arithmetic strengthening for shape analysis

SAS'07 Proceedings of the 14th international conference on Static Analysis

Reasoning about nondeterminism in programs

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

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.