R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Science of Computer Programming, 32(1-3):177--210, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Functional Compositions of Abstract Interpretations - Giacobazzi, al. (Correct)
....abstract domain refinements existing in the literature, Cousot and Cousot s reduced power is probably the less known one. In fact, while for the well known reduced product and disjunctive completion a comprehensive literature is available, ranging from the most theoretical aspects (e.g. see [16, 20, 23, 36]) to applications (e.g. see [13, 21, 23, 29, 41, 51, 62] as far as reduced power is concerned very little has been done after [20] both in theory and in applications. Reduced cardinal power has been introduced by Cousot and Cousot in the very last section of their POPL 79 paper (cf. 20, ....
....A is called a disjunctive abstract domain ( 20] In this case, as recalled in Section 2.2, A = fl(ff(D) is a complete sublattice of D . It is well known since [20] that every abstract domain can be lifted to its disjunctive completion: Examples of disjunctive completions can be found e.g. in [21, 23, 29, 36, 41]. The interest in abstract interpretation based on disjunctive domains is evident: Disjunctive abstract domains allow a precise interpretation for disjunction, i.e. concrete and abstract lub s coincide up 3 See e.g. 52, 53, 54, 55] for some applications of the tensor product in abstract ....
R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. To appear in Sci. Comput. Program., 1998. A preliminary version appeared in Proc. ESOP '96.
Making Abstract Interpretations Complete - Giacobazzi, Ranzato (1997) (17 citations) (Correct)
.... strategy for refining domains to compare the expressive power of some well known abstract domains for ground dependency analysis of logic languages, like Def , Pos and their common disjunctive completion IP(Def ) cf. Armstrong et al. 1997; Cortesi et al. 1996; Fil e and Ranzato 1998; Giacobazzi and Ranzato 1998; Marriott and Sndergaard 1993] More in detail, considering a standard bottom up least fixpoint semantics of reference like those of Barbuti et al. 1993] Codish et al. 1994] and Marriott et al. 1994] we prove that the least complete and fully complete extensions of Def with respect to the ....
....; Sub) Pos ; fl Pos ) are the corresponding GIs, foe 1 ; oe 2 g fl Pos (x (y z ) fl Def (x (y z ) The Disjunctive Completion Refinement. Let us then recall how the disjunctive completion refinement is defined. For more details see [Cousot and Cousot 1979b; Fil e and Ranzato 1998; Giacobazzi and Ranzato 1998]. Here, we only consider the simple case of a concrete domain C which is completely distributive (as any powerset h(X ) i is) For a GC (ff; C ; A; fl) we define the following equivalence relation on (A) For all S ; T A, S T , C fl(S ) C fl(T ) The disjunctive completion IP(A) of A ....
[Article contains additional citation context not shown here]
Giacobazzi, R. and Ranzato, F. 1998. Optimal domains for disjunctive abstract interpretation. To appear in Sci. Comput. Program. Preliminary version in Proc. ESOP '96 , LNCS 1058, pages 141-- 155, Springer-Verlag, Berlin.
Domain Compression for Complete Abstractions - Giacobazzi, Mastroeni Self-citation (Giacobazzi) (Correct)
No context found.
R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Sci. Comput. Program, 32(1-3):177-210, 1998.
On The Least Complete Extension Of A - Complete Subsemilattice Roberto Self-citation (Giacobazzi Ranzato) (Correct)
....06A12, 06A15, 06A23. Key words and phrases. Complete subsemilattice, least complete extension, closure operator. 1 2 ROBERTO GIACOBAZZI AND FRANCESCO RANZATO ae. Such an operation is useful for efficient implementations of the disjunctive completion in a program analysis system (cf. [4]) In lattice theoretical terms, this would be equivalent to define an operation providing for any complete sublattice X 2 Sub(C) the least complete meet subsemilattice Omega Gamma X) 2 Sub (C) of C such that f( Omega Gamma X) f(X) holds (whenever this happens, we call Omega Gamma X) the ....
R. Giacobazzi, and F. Ranzato. Optimal domains for disjunctive abstract interpretation. To appear in Sci. Comput. Program., 1998.
Partially Disjunctive Heap Abstraction - Mooly (2004) (1 citation) (Correct)
No context found.
R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Science of Computer Programming, 32(1-3):177--210, 1998.
Partially Disjunctive Heap Abstraction - Roman Manevich Mooly (2004) (1 citation) (Correct)
No context found.
R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Science of Computer Programming, 32(1-3):177--210, 1998.
Partially Disjunctive Heap Abstraction - Manevich, Sagiv, Ramalingam, Field (2004) (1 citation) (Correct)
No context found.
R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Science of Computer Programming, 32(1-3):177--210, 1998.
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