Generic Models of the Laws of Programming
The laws of programming are a collection of judgments about the equality and ordering of computer programs. A model of the laws is a mathematical description of the execution of programs, where the model has been proved to satisfy the laws. A generic model is one that has parameters that can be adjusted to the properties of a range of different programming languages and their differing implementations and differing applications. In this way, a generic model serves as the basis of a unifying theory of programming.
KeywordsOperational Semantic Sequential Composition Concurrent Programming Test Case Generator Communicate Sequential Process
Unable to display preview. Download preview PDF.
- 1.Roscoe, A.W.: Laws of occam programming, Tech Mon PRG-53. Oxford University (1986)Google Scholar
- 3.Hoare, T.: Unifying Semantics for Concurrent Programming (to appear, 2013)Google Scholar
- 6.Pratt, V.: The Pomset Model of Parallel Processses: Unifying the Temporal and the Spatial. Stanford University, STAN-CS-85-1049 (January 1985)Google Scholar
- 9.Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall (1998)Google Scholar
- 11.Plotkin, G.D.: A Structural Approach to Operational Semantics. DAIMI FN-16 Computer Science Department Aarhus University (1981)Google Scholar
- 13.Hennessy, M.: Algebraic Theory of Processes. MIT Press (1988)Google Scholar
- 14.Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press (2010)Google Scholar
- 16.Hoare, T., Wickerson, J.: Unifying Models of Data Flow. Software and Systems Safety, pp. 211–230. IOS Press (2011)Google Scholar
- 21.Back, R.-J., von Wright, J.: Refinement Calculus. Springer Graduate Texts in Computer Science (1998)Google Scholar
- 22.Morgan, C.: Programming from Specifications. Prentice Hall International (1990)Google Scholar