Cited By
View all- Hesselink W(1995)Safety and progress of recursive proceduresFormal Aspects of Computing10.1007/BF012112157:4(389-411)Online publication date: 1-Jul-1995
Weakest preconditions for progress
Abstract
Predicate transformers that map the postcondition and all intermediate conditions of a command to a precondition are introduced. They can be used to specify certain progress properties of sequential programs.
References
References
[1]
Back, R. J. R.: On the Correctness of Refinement in Program Development, PhD thesis, University of Helsinki, 1978.
[2]
Back, R. J. R. and Kurki-Suonio, R.: Decentralization of Process Nets with Centralized Control,2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, Montreal, Canada, pp. 131–142, August 1983.
[3]
Chandy, K. M. and Misra, J.:Parallel Program Design: A Foundation, Addison Wesley, 1988.
[4]
Dijkstra, W.:A Discipline of Programming, Prentice-Hall, 1976.
[5]
Dijkstra, E. W. and Scholten, C. S.:Predicate Calculus and Program Semantics, Springer-Verlag, 1990.
[6]
Gries, D.:The Science of Programming, Springer-Verlag, 1981.
[7]
Jutla, C. S., Knapp, E. and Rao, J. R.: A Predicate Transformer Approach to Semantics of Parallel Programs,Proc. 8th Annual ACM Symp. on Principles of Distributed Computing pp. 249–263, 1989.
[8]
Morris J. M. Temporal Predicate Transformers and Fair Termination Acta Informatica 1990 27 287-313
[9]
Owicki S. and Lamport L. Proving Liveness Properties of Concurrent Programs ACM TOPLAS 1982 4 3 455-495
[10]
Tarski A. A Lattice-Theoretical Fixpoint Theorem and Its Applications Pacific Journal of Mathematics 1955 5 285-309
Index Terms
- Weakest preconditions for progress
Index terms have been assigned to the content through auto-classification.
Recommendations
Efficient weakest preconditions
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 ...
Sufficient preconditions for modular assertion checking
VMCAI'08: Proceedings of the 9th international conference on Verification, model checking, and abstract interpretationAssertion checking is the restriction of program verification to validity of program assertions. It encompasses safety checking, which is program verification of safety properties, like memory safety or absence of overflows. In this paper, we consider ...
Comments
Information & Contributors
Information
Published In
© BCS 1992.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 March 1992
Published in FAC Volume 4, Issue 2
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 28Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)6
Reflects downloads up to 18 Aug 2024
Other Metrics
Citations
Cited By
View all- Hesselink W(1995)Safety and progress of recursive proceduresFormal Aspects of Computing10.1007/BF012112157:4(389-411)Online publication date: 1-Jul-1995
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in