Abstract
A theory of programming is intended to help in the construction of programs that provably meet their specifications. It starts with a complete lattice of specifications, used as a domain for the semantics of the programming language. The operators of the language are defined as monotonie functions over this domain. This paper presents a method which enables us to derive an enriched semantics for the imperative languages. We show that the new definition of the primitive commands can be recast as the weakest solution of the embedding equation, and demonstrate how the operators of the programming language are redefined from the homomorphic property of the embedding and the healthiness conditions imposed on "real" programs. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Jifeng, H. (2007). Linking semantic models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4711 LNCS, pp. 18–33). Springer Verlag. https://doi.org/10.1007/978-3-540-75292-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
