Home |
Personal Info |
Research |
Papers |
Teaching |
About |
Domain Independent Ask Approximation in CCP (GULP-PRODE'95)
[Page last updated on "gennaio 13, 2005, 15:31:42".]Enea Zaffanella
Abstract
The main difficulty in the definition of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constraints. This approximation is needed for the abstract evaluation of the ask guards and directly influences the overall precision of the analysis. In this paper we provide a solution to this problem by stating reasonable correctness conditions relating the abstract and the concrete domains of computation. The solution is domain independent in the sense that it can be applied to the class of downward closed observations. Properties falling in this class (e.g. freeness) have already been studied in the context of the analysis of sequential logic programs. We believe that the same abstract domains can be usefully applied to the CC context to provide meaningful ask approximations.
Available: PDF, 300 DPI, 600 DPI, and 1200 DPI PostScript, DVI, and BibTeX entry.
enea.zaffanella@unipr.it
| Home | Personal Info | Research | Papers | Teaching | About