Abstract
Properties of programs are often not expressible with the standard denotational semantics approach. Annotated semantic domains and corresponding semantic functions capacitate us to express the properties, but the resulting structures are no longer partial ordered sets. Instead we obtain quasi ordered sets, which lack the anti-symmetry which is present in partially ordered sets. In order to cater with these structures, we develop a new fixpoint theory for quasi ordered sets.
This theory is also useful to denotationally model semantics for situations where non-monotonic operations occur.
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
C. Baier and M. E. Majster—Cederbaum. Denotational semantics in the cpo and metric approach. Theoretical Computer Science, 135(2):171–220, December 1994. Fundamental Study.
J. W. de Bakker and J. I. Zucker. Processes and the Denotational Semantics of Concurrency. Information and Control, 54 (1/2): 70 – 120, July 1982.
F. Henglein and D. Sands. A Semantic Model of Binding Times for Safe Partial Evaluation. In Hermenegildo and Swierstra [4].
M. Hermenegildo and S. Doaitse Swierstra, editors. Proccedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP), number 982 in Lecture Notes in Computer Science. SpringerVerlag, 1995.
M. E. Majster-Cederbaum and C. Baier. Metric completion versus ideal completion. Theoretical Computer Science, 170 (1-2): 145 – 171, December 1996.
M. Mohnen. Higher-Order Escape Analysis of Functional Programs: Correctness and Applications to be published.
M. Mohnen. Efficient Closure Utilisation by Higher—Order Inheritance Analysis. In A. Mycroft, editor, Proccedings of the 2nd International Symposium on Static Analysis (SAS), number 983 in Lecture Notes in Computer Science, pages 261–278. Springer-Verlag, 1995.
M. Mohnen. Efficient Compile-Time Garbage Collection for Arbitrary Data Structures. In Hermenegildo and Swierstra [4], pages 241–258.
P.D. Mosses. Denotational Semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 11. Elsevier, 1990.
A. Mycroft. The Theory and Practice of Transforming Call-by-Need into Call-byValue. In B. Robinet, editor, International Symposium on Programming’80, Paris, Prance, number 83 in LNCS, pages 269–281. Springer-Verlag, 1980.
H.R. Nielson and F. Nielson. Semantics with Applications: A Formal Introduction. Wiley, 1992.
Y. G. Park and B. Goldberg. Escape Analysis on Lists. In Proccedings of the ACM SIGPLAN ’92 Conference on Programming Language Design and Implementation (PLDI), SIGPLAN Notices 27(7), pages 116 – 127. ACM, June 1992.
V. Stoltenberg—Hansen, I. Lindstram, and E. R. Griffor. Mathematical Theory of Domains. Number 21 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1994.
G. Winskel. The Formal Semantics of Programming Languages: An Introduction. Foundations of Computing. The MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohnen, M. (1997). Using Quasi Ordered Sets to Model Program Properties Denotationally. In: Jarke, M., Pasedach, K., Pohl, K. (eds) Informatik ’97 Informatik als Innovationsmotor. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-60831-5_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63066-1
Online ISBN: 978-3-642-60831-5
eBook Packages: Springer Book Archive