Abstract
The purpose of this paper is to present some set-theoretic models of computation. This topic and its usefulness are clearly related to those presented in the book by Hoare and He: “Unifying Theories of Programming” [12]. However, we prefer to use here the term “computation” to that of “programming” as our purpose is not so much to unify various ways of programming (using different programming languages) but rather to see how various mechanical computation paradigms (be they sequential, distributed, parallel, and so on) can be given a unified mathematical theory. Our purpose is also to study how these computations can be specified and then developed by means of refinements and proofs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrial, J.-R.: The B-book: Assigning Programs to Meanings. Cambridge University Press (1996)
Abrial, J.-R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press (2010)
Back, R.: On the Correctness of Refinement Steps in Program Development. Technical Report University of Helsinki (1978)
Back, R., Kurki-Suonio, R.: Distributed Cooperation with Action Systems. ACM Transaction on Programming Languages and Systems 10(4), 513–554 (1988)
Dijkstra, E.: Guarded Commands, Nondeterminacy and Formal Derivation of Programs. CACM (1975)
Dijkstra, E.: A Discipline of Programming. Prentice-Hall (1976)
Gardiner, P., Morgan, C.: Data Refinement of Predicate Transformer. Theoretical Computer Science (1991)
He, J., Hoare, T., Sanders, J.: Data Refinement Refined. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187–196. Springer, Heidelberg (1986)
Hehner, E.: A Practical Theory of Programming. Springer (1993)
Hesselink, W.: Programs, Recursion, and Unbounded Choice. Cambridge University Press (1992)
Hoare, T.: Programs are Predicates. Mathematical Logic and Programming Languages. Prentice-Hall (1985)
Hoare, T., He, J.: Unifying Theories of Programming. Prentice-Hall (1998)
Hoare, T.: An Axiomatic Basis for Computer Programming. CACM (1969)
Jones, C.: Program Specification and Validation in VDM. Logic of Programming and Calculi of Discrete Design. Springer (1987)
Morgan, C.: The Specification Statement. ACM Transactions on Programming Languages and Systems (1988)
Morgan, C.: Programming from Specification. Prentice-Hall (1990)
Morgan, C.: Of wp and CSP. In: Beauty is our Business. Springer (1990)
Morris, J.: A Theoretical Basis for Stepwise Refinement and the Programming Calculus. Science of Computer Programming (1987)
Nelson, G.: A Generalization of Dijkstra’s Calculus. ACM TOPLAS (1989)
Rodin: Event-B and the Rodin Platform, http://event-b.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Abrial, JR. (2013). Set-Theoretic Models of Computations. In: Liu, Z., Woodcock, J., Zhu, H. (eds) Theories of Programming and Formal Methods. Lecture Notes in Computer Science, vol 8051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39698-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-39698-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39697-7
Online ISBN: 978-3-642-39698-4
eBook Packages: Computer ScienceComputer Science (R0)