Efficient weakest preconditions

Authors:
K. Rustan M. Leino
Affiliations:
Microsoft Research, Redmond, WA, USA
Venue:
Information Processing Letters
Year:
2005

Citing 10
Cited 21

A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Detecting equality of variables in programs

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficient method of computing static single assignment form

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predicate calculus and program semantics

Predicate calculus and program semantics
Combining angels, demons and miracles in program specifications

Theoretical Computer Science
Avoiding exponential explosion: generating compact verification conditions

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
A Discipline of Programming

A Discipline of Programming
Extended Static Checking: A Ten-Year Perspective

Informatics - 10 Years Back. 10 Years Ahead.
Correct and Robust Programs

IEEE Transactions on Software Engineering

Proving Conditional Termination

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Inferring Dataflow Properties of User Defined Table Processors

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Weakest Invariant Generation for Automated Addition of Fault-Tolerance

Electronic Notes in Theoretical Computer Science (ENTCS)
It's Doomed; We Can Prove It

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Structural abstraction of software verification conditions

CAV'07 Proceedings of the 19th international conference on Computer aided verification
A machine-checked soundness proof for an efficient verification condition generator

Proceedings of the 2010 ACM Symposium on Applied Computing
Exploiting shared structure in software verification conditions

HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Doomed program points

Formal Methods in System Design
A weakest precondition approach to robustness

Transactions on computational science X
Computing preconditions and postconditions of while loops

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Program compatibility approaches

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Verification condition generation via theorem proving

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Loop invariants on demand

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Function extraction

Science of Computer Programming
Exploiting traces in program analysis

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Infeasible code detection

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Verification conditions for single-assignment programs

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Verification conditions for source-level imperative programs

Computer Science Review

Quantified Score

Hi-index	0.89

Visualization

Abstract

Desired computer-program properties can be described by logical formulas called verification conditions. Different mathematically-equivalent forms of these verification conditions can have a great impact on the performance of an automatic theorem prover that tries to discharge them. This paper presents a simple weakest-precondition understanding of the ESC/Java technique for generating verification conditions. This new understanding of the technique spotlights the program property that makes the technique work.