Proving that programs eventually do something good

Authors:
Byron Cook;Alexey Gotsman;Andreas Podelski;Andrey Rybalchenko;Moshe Y. Vardi
Affiliations:
Microsoft Research;University of Cambridge;University of Freiburg;EPFL and MPI-Saarbrücken;Rice University
Venue:
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
2007

Citing 23
Cited 27

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Reasoning about infinite computations

Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Patterns in property specifications for finite-state verification

Proceedings of the 21st international conference on Software engineering
Bandera: extracting finite-state models from Java source code

Proceedings of the 22nd international conference on Software engineering
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model Checking Programs

Automated Software Engineering
The ForSpec Temporal Logic: A New Temporal Property-Specification Language

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Algorithmic Verification of Linear Temporal Logic Specifications

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
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
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Automatic termination proofs for programs with shape-shifting heaps

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
TERMINATOR: beyond safety

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Separating fairness and well-foundedness for the analysis of fair discrete systems

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Linear ranking with reachability

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Abstraction refinement for termination

SAS'05 Proceedings of the 12th international conference on Static Analysis

Variance analyses from invariance analyses

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
A Hybrid Type System for Lock-Freedom of Mobile Processes

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Proving Conditional Termination

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Proving that non-blocking algorithms don't block

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types and higher-order recursion schemes for verification of higher-order programs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving the Correctness of the Implementation of a Control-Command Algorithm

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
seL4: formal verification of an OS kernel

Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
A hybrid type system for lock-freedom of mobile processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
A sound and complete proof rule for region stability of hybrid systems

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Reasoning about the unknown in static analysis

Communications of the ACM
All you need is compassion

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Making prophecies with decision predicates

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hard-to-answer questions about code

Evaluation and Usability of Programming Languages and Tools
Proving program termination

Communications of the ACM
Proving stabilization of biological systems

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Metric spaces and termination analyses

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Annotation inference for separation logic based verifiers

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Liveness-preserving atomicity abstraction

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Temporal property verification as a program analysis task

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
An abstract interpretation framework for termination

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal property verification as a program analysis task

Formal Methods in System Design
Termination proofs for linear simple loops

SAS'12 Proceedings of the 19th international conference on Static Analysis
Model Checking Higher-Order Programs

Journal of the ACM (JACM)
Reasoning about nondeterminism in programs

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Comprehensive formal verification of an OS microkernel

ACM Transactions on Computer Systems (TOCS)
Software verification with VeriFast: Industrial case studies

Science of Computer Programming

Quantified Score

Hi-index	0.03

Visualization

Abstract

In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited to properties that guarantee the absence of bad events (safety properties). Until now no formal software analysis tool has provided fully automatic support for proving properties that ensure that good events eventually happen (liveness properties). In this paper we present such a tool, which handles liveness properties of large systems written in C. Liveness properties are described in an extension of the specification language used in the SDV system. We have used the tool to automatically prove critical liveness properties of Windows device drivers and found several previously unknown liveness bugs.