An Iterative Powerdomain Construction
نویسندگان
چکیده
A nite domain for the abstract interpretation of lazy lists is known, but is not easily generalisable to other lazy data structures. A construction for nite abstract domains is presented which is quite general, based on the notion of a `set of elements'. The abstraction for elements is given, and a new powerdomain is developed. Finally, a means of iterative calculation of the sub-domain which contains all thèuseful' points is arrived at.
منابع مشابه
The Powerdomain of Indexed Valuations
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using the notion of powerdomain, while probability is modeled using the powerdomain of valuations. Those two functors do not combine well, as they are. We define the notion of powerdomain of indexed valuations, which can be c...
متن کاملA Powerdomain Construction
We develop a powerdomain construction, [. ], which is analogous to the powerset construction and also fits in with the usual sum, product and exponentiation constructions on domains. The desire for such a construction arises when considering programming languages with nondeter-ministic features or parallel features treated in a nondeterministic way. We hope to achieve a natural, fully abstract ...
متن کامل2-stage Fixed-point Iteration in a Modiied Plotkin Powerdomain
Powerdomains are used both when describing the semantics of non-deterministic programming languages and when doing abstract interpretation of deterministic programming languages. In the latter case, the restrictions imposed on sets in the usual powerdomain constructions can lead to less precise results than desired. We show a variant of the Plotkin (convex) powerdomain which impose fewer restri...
متن کاملThe troublesome probabilistic powerdomain
In [12] it is shown that the probabilistic powerdomain of a continuous domain is again continuous. The category of continuous domains, however, is not cartesian closed, and one has to look at subcategories such as RB, the retracts of bifinite domains. [8] offers a proof that the probabilistic powerdomain construction can be restricted to RB. In this paper, we give a counterexample to Graham’s p...
متن کاملA Note on the Smyth Powerdomain Construction
Powerdomains are the order-theoretic analogue of powersets and are used to model non-determinism and concurrency [9, 8, 3, 10]. There exist three standard kinds of order-theoretic powerdomain: the Plotkin, Smyth and Hoare powerdomain. To obtain a powerdomain from a given !-algebraic cpo D, one constructs the collection F(D) of finite, non-empty sets of finite elements from D (for necessary defi...
متن کامل