Abstract
We present an algebra that seeks to bridge the gap between programming formalisms that have a high level of abstraction and the operational interpretations these formalisms have been designed to be sound for.
In order to prove a high level formalism sound for its intended operational interpretation, one needs a mathematical handle on the latter. To this end we design the computation calculus. As an expression mechanism, it is sufficiently transparent to avoid begging the question. As an algebra, it is quite powerful and relatively simple.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Mani Chandy and Jayadev Misra. Parallel Program Design, a foundation. Addison-Wesley, 1988.
K. Mani Chandy and Beverly A. Sanders. Conjunctive predicate transformers for reasoning about concurrent computation. Science of Computer Programming, 24:129–148, 1995.
Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer Verlag New York Inc., 1990.
Rutger M. Dijkstra and Beverly A. Sanders. A predicate transformer for the progress property ‘to-always'. Formal Aspects of Computing, 9:270–282, 1997.
Rutger M. Dijkstra. Relational calculus and relational program semantics. CS-R9408, University of Groningen, 1994.
Rutger M. Dijkstra. DUALITY: a simple formalism for the analysis of UNITY. Formal Aspects of Computing, 7:353–388, 1995.
E. Allen Emerson and Jai Srinivasan. Branching time temporal logic. In: W.P. de Roever J.W. de Bakker and G. Rozenberger, editors, Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, pages 123–172. Springer-Verlag, 1989. LNCS 354.
Wim H. Hesselink. Programs, Recursion and Unbounded Choice. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
B. von Karger and C.A.R. Hoare. Sequential calculus. Information Processing Letters, 53:123–130, 1995.
E. Knapp, C.S. Jutla, and J.R. Rao. A predicate transformer approach to semantics of parallel programs. In: Proceedings of the 8th Annual ACM symposium on Principles of Distributed Computing, pages 249–263. ACM Press, 1989.
Johan J. Lukkien. Parallel Program Design and Generalized Weakest Preconditions. PhD thesis, Rijksuniversiteit Groningen, 1990.
Z. Manna and A. Pnueli. Verification of concurrent programs: a temporal proof system. In: J.W. de Bakker and J. van Leeuwen, editors, Foundations Of Computer Science. Distributed Systems: part 2, Semantics and Logic, pages 163–255. Mathematisch Centrum, Amsterdam, 1983. Mathematical Centre Tracts 159.
Mathematics of Program Construction Group. Fix-point calculus. Information Processing Letters, 53:131–136, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dijkstra, R.M. (1998). Computation calculus bridging a formalization gap. In: Jeuring, J. (eds) Mathematics of Program Construction. MPC 1998. Lecture Notes in Computer Science, vol 1422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054289
Download citation
DOI: https://doi.org/10.1007/BFb0054289
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64591-7
Online ISBN: 978-3-540-69345-1
eBook Packages: Springer Book Archive