Giorgio Levi, Fausto Spoto  Home/Search
Context Related
| strudel.di.unipi.it/pap...plilp98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/~spoto/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We apply the methodology of domain re nement to systematically derive domains for type analysis. Domains are built by iterative application of the Heyting completion operator to a given set of basic types. We give a condition on the type system which assures that two steps of iteration are sucient to reach the xpoint. Moreover, we provide a general representation for type domains through trans nite formulas. Finally, we show a subset of nite formulas which can be used as a... (Update)
Context of citations to this paper: More
...in [4] is not made of logical formulas and cannot be obtained by linear refinement of a basic domain for the type properties. In [12] it is shown that a hierarchy of domains for type analysis can be defined in the same way as it has been done in the case of groundness...
...about the positions where a variable can occur. This is the case in: 26, 27] the binding time analysis of [30] and also in [21] which uses types and applies linear refinement to enrich the type domain with P os like dependencies. Most close to our approach is the...
Cited by: More
Logic Programs as Compact Denotations - Hill, Spoto (2003) (Correct)
Pos(T): Analyzing Dependencies in Typed Logic Programs - Bruynooghe, Vanhoof, Codish (2001) (Correct)
Analysis of Downward Closed Properties of Logic Programs - Hill, Spoto (2000) (Correct)
Active bibliography (related documents): More All
1.5: Generalising Def and Pos to Type Analysis - Hill, Spoto (2002) (Correct)
0.5: Type Dependencies for Logic Programs Using ACI-Unification - Codish, Lagoon (1998) (Correct)
0.2: A Theory of Observables for Logic Programs - Comini, Levi, Meo (1996) (Correct)
Similar documents based on text: More All
0.2: Non Pair-Sharing and Freeness Analysis through Linear Refinement - Levi, Spoto (2000) (Correct)
0.2: Class Analysis of Object-Oriented Programs through Abstract.. - Jensen, al. (2001) (Correct)
0.2: Freeness Analysis Through Linear Refinement - Hill, Spoto (1999) (Correct)
Related documents from co-citation: More All
4: Deriving polymorphic type dependencies for logic programs using multiple incarna.. - Codish, Demoen - 1994
3: Precise and efficient groundness analysis for logic programs - Marriott, Sondergaard - 1993
3: Practical Model-Based Static Analysis for Definite Logic Programs - Gallagher, Boulanger et al. - 1995
BibTeX entry: (Update)
Giorgio Levi and Fausto Spoto. An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. In Catuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors, Principles of Declarative Programming, volume 1490 of Lecture Notes in Computer Science, pages 152--169, Pisa, Italy, September 1998. c flSpringer-Verlag. http://citeseer.ist.psu.edu/levi98experiment.html More
@article{ levi98experiment,
author = "Giorgio Levi and Fausto Spoto",
title = "An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs",
journal = "Lecture Notes in Computer Science",
volume = "1490",
pages = "152--??",
year = "1998",
url = "citeseer.ist.psu.edu/levi98experiment.html" }
Citations (may not include all citations):218 Abstract Interpretation and Applications to Logic Programs (context) - Cousot, Cousot - 1992
89 Deriving Descriptions of Possible Values of Program Variable.. (context) - Janssens, Bruynooghe - 1992
80 Fast and Precise Regular Approximation of Logic Programs - Gallagher, de Waal - 1994
67 Reasoning about Prolog Programs: from Modes through Types to.. - Apt, Marchiori - 1994
49 A Type System for Logic Programs (context) - Yardeni, Shapiro - 1991
36 Deriving Polymorphic Type Dependencies for Logic Programs Us.. - Codish, Demoen - 1994
33 Boolean functions for dependency analysis: Algebraic propert.. (context) - Armstrong, Marriott et al. - 1994
30 Optimal Groundness Analysis Using Propositional Logic (context) - Cortesi, Fil et al. - 1996
23 A Type Inference System for Prolog (context) - Xu, Warren - 1988
21 Logic Programs as Types for Logic Programs (context) - Fr, Shapiro et al. - 1991
19 A Unifying View on Abstract Domain Design (context) - Fil, Giacobazzi et al. - 1996
17 A Bottom-up Polymorphic Type Inference in Logic Programming (context) - Barbuti, Giacobazzi - 1992
12 Polymorphic Type Inference in Prolog by Abstract Interpretat.. (context) - Kanomori, Horiuchi - 1988
11 Type Dependencies for Logic Programs Using ACI{ Unication (context) - Codish, Lagoon - 1996
10 Logical Optimality of Groundness Analysis - Scozzari - 1997
9 Directional Types in Logic Programming (context) - Boye - 1996
9 Intuitionistic implication in abstract interpretation (context) - Giacobazzi, Scozzari - 1997
3 Inference of Polymorphic Types for Logic Programming (context) - Pyo, Reddy - 1989
2 Order Theory of Types and Polymorphism in Logic Programming (context) - Kifer, Wu et al. - 1991
Documents on the same site (http://www.di.unipi.it/~spoto/papers.html): More
Freeness Analysis Through Linear Refinement - Hill, Spoto (1999) (Correct)
Operational and Goal-Independent Denotational Semantics for Prolog .. - Spoto (Correct)
Non Pair-Sharing and Freeness Analysis through Linear Refinement - Levi, Spoto (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC