Weakest-precondition of unstructured programs
- 5 September 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 31 (1) , 82-87
- https://doi.org/10.1145/1108792.1108813
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Efficient weakest preconditionsInformation Processing Letters, 2005
- The Spec# Programming System: An OverviewPublished by Springer Nature ,2005
- Java Applet Correctness: A Developer-Oriented ApproachPublished by Springer Nature ,2003
- A SAT Characterization of Boolean-Program CorrectnessPublished by Springer Nature ,2003
- Extended static checking for JavaPublished by Association for Computing Machinery (ACM) ,2002
- Avoiding exponential explosionPublished by Association for Computing Machinery (ACM) ,2001
- A common intermediate language and its use in partitioning concurrent declarative programsNew Generation Computing, 1996
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955