If the meaning of a deterministic program may be considered to be a function from D to D, where D is some domain of "states", then it would seem that the meaning of a non-deterministic program is a function from D to 2D, or perhaps from 2D to 2D. To apply the methods of fixpoint semantics, then we should find some way to construe the power-set of a domain as itself a domain, with a suitable ordering
AbstractThe variety of power domain constructions proposed in the literature is put into a general a...
In this paper we design abstract domains for power analysis. These domains are conceived to discover...
Classical recursion theory asserts that all conventional programming languages are equally expressiv...
AbstractThis note shows a simple connection between powerdomains and modal assertions that can be ma...
A definition of the notion of an effectively given continuous cpo is provided. The importance of the...
AbstractTraditionally, powerdomains have been used to provide models for various forms of nondetermi...
AbstractIn the theory of denotational semantics of programming languages Dedekind-complete, algebrai...
Traditionally, powerdomains have been used to provide models for various forms of nondeterminism in ...
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts I...
AbstractIn this paper we investigate the Plotkin powerdomain under order-theoretical aspects. We ans...
This paper characterizes the powerdomain constructions which have been used in the semantics of prog...
A program construct is proposed, for which the assumption of bounded nondeterminism is not natural. ...
Set domains are intended to give semantics to a data type of sets together with a wide range of usef...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a doma...
AbstractThe variety of power domain constructions proposed in the literature is put into a general a...
In this paper we design abstract domains for power analysis. These domains are conceived to discover...
Classical recursion theory asserts that all conventional programming languages are equally expressiv...
AbstractThis note shows a simple connection between powerdomains and modal assertions that can be ma...
A definition of the notion of an effectively given continuous cpo is provided. The importance of the...
AbstractTraditionally, powerdomains have been used to provide models for various forms of nondetermi...
AbstractIn the theory of denotational semantics of programming languages Dedekind-complete, algebrai...
Traditionally, powerdomains have been used to provide models for various forms of nondeterminism in ...
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts I...
AbstractIn this paper we investigate the Plotkin powerdomain under order-theoretical aspects. We ans...
This paper characterizes the powerdomain constructions which have been used in the semantics of prog...
A program construct is proposed, for which the assumption of bounded nondeterminism is not natural. ...
Set domains are intended to give semantics to a data type of sets together with a wide range of usef...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a doma...
AbstractThe variety of power domain constructions proposed in the literature is put into a general a...
In this paper we design abstract domains for power analysis. These domains are conceived to discover...
Classical recursion theory asserts that all conventional programming languages are equally expressiv...