Efficient weakest preconditions

@article{Leino2005EfficientWP,
  title={Efficient weakest preconditions},
  author={K. Rustan M. Leino},
  journal={Inf. Process. Lett.},
  year={2005},
  volume={93},
  pages={281-288}
}
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. The new understanding of this technique spotlights the program property that makes… CONTINUE READING
Highly Cited
This paper has 144 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

145 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 145 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Case-reduced verification condition generation system and method using weakest precondition operator expressed using strongest postcondition operators

  • James Benjamin Saxe, Charles Gregory Nelson, David Luke Detlefs
  • United States Patent #6,553,362,
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…