Three Non-determinism Analyses in a Parallel-Functional Language

Three Non-determinism Analyses in a Parallel-Functional Language (2001)

Cached

Download Links

[dalila.sip.ucm.es]

by Ricardo Peña , Clara Segura

Citations:

5 - 4 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Three Non-determinism Analyses in a Parallel-Functional Language	user correction - Legacy Corrections
AUTHOR NAME	Ricardo Peña	user correction - Legacy Corrections
AUTHOR NAME	Clara Segura	user correction - Legacy Corrections
AUTHOR AFFIL	o	user correction - Legacy Corrections
AUTHOR ADDR	117-01	user correction - Legacy Corrections
ABSTRACT	This paper is an extension of a previous work where two non-determinism analyses were presented. The first of them was efficient (linear) but not very powerful and the second one was more powerful but very expensive (exponential). Here, we develop an intermediate analysis in both aspects, efficiency and power. The improvement in efficiency is obtained by speeding up the fixpoint calculation by means of a widening operator, and the representation of functions through easily comparable signatures. Also details about the implementation and its cost are given. Additionally: (1) the second and third analyses are completed with polymorphism, (2) we prove that the domains in the second and third analyses form a category in which the morphisms are embedding-closure pairs of functions; respectively called abstraction and concretisation functions; and (3) we formally relate the analyses and prove that the first analysis is a safe approximation to the third one and that the third one is a safe approximation to the second one. In this way the three analyses become totally ordered by increasing cost and precision. 1	user correction - Legacy Corrections
YEAR	2001	user correction - Legacy Corrections
CITATIONS	23 found	ParsCit 1.0