Università di Pisa
Sistema bibliotecario di ateneo

Optimal Semantics and Domains in Logic Program Analysis

Giacobazzi, Roberto and Ranzato, Francesco and Scozzari, Francesca (2001) Optimal Semantics and Domains in Logic Program Analysis. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (186Kb)


    Completeness is important in approximated semantics design by abstract interpretation, ensuring that abstract computations are as precise as possible wrt concrete ones. The authors recently proved that any abstract domain can be systematically refined or simplified in order to provide its closest possible complete domain. The key problem here remains is to find efficient and appropriate representations for objects in complete abstract domains. In this paper we show that these domain trensformations, when applied on abstract interpretations of quantales, can all be explicitly characterized by elegant linear logic-based formulations. We apply our results to logic program analysis, where unification can be interpreted as multiplicative conjunction in a quantale of idempotent substitutions. We characterize the objects in optimal semantics for logic program analysis, viz. the most abstract concrete semantics for any static program analysis property, and the structure of condensing domains in logic program analysis.

    Item Type: Book
    Uncontrolled Keywords: Abstract interpretation, domains, completeness, linear logic,
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 26 Jan 2015 14:30
    Last Modified: 26 Jan 2015 14:30
    URI: http://eprints.adm.unipi.it/id/eprint/2055

    Repository staff only actions

    View Item