Reddy, U. S. and Kamin, S. N. 1992. On the power of abstract interpretation. In Proc. of the 1992 IEEE Internat. Conf. on Computer Languages (ICCL '92 ). IEEE Computer Society Press, Los Alamitos, Calif. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Making Abstract Interpretations Complete - Giacobazzi, Ranzato (1997) (17 citations) (Correct)
....exactness our notion of (nonfull) completeness; Steffen [1989, Section 3.1] uses instead the term full abstraction; Comini and Levi [1994] use the term precision; while Dams et al. 1997, Section 4] use the term optimality for the same notion. We follow Cousot and Cousot [1994] Mycroft [1993] Reddy and Kamin [1992], and Sekar et al. 1997] by using the term completeness, which is more typically used in contrast to the well established notion of soundness. 2 rule of signs example [Cousot and Cousot 1977;1979b] helps in clarifying this concept. Let us represent the sign of sets of integers in (ZZ) by an ....
....P 2 Cl . Thus, in our terminology, they have found the greatest set of programs Cl such that Strictness 2 Delta(C ; fT P gP2Cl ) where C is the concrete domain of the standard collecting denotational semantics and T P is the standard least fixpoint semantic operator for a functional program P . Reddy and Kamin [1992] generalize the above approach of Sekar et al. which first appeared in POPL 91, by studying completeness with respect to a so called similarity concrete semantics, which is defined in a denotational like environment. They obtained two completeness results, respectively, for first order and typed ....
Reddy, U. S. and Kamin, S. N. 1992. On the power of abstract interpretation. In Proc. of the 1992 IEEE Internat. Conf. on Computer Languages (ICCL '92 ). IEEE Computer Society Press, Los Alamitos, Calif.
On the Desirable Link Between Theory and Practice in.. - Le Charlier, Flener (1997) (Correct)
....general purpose algorithms. 3.2 Some Problems With Strong Mathematical Frameworks Strong mathematical frameworks of abstract interpretation based on denotational semantics or Galois insertions have some benefits. Notably, they allow researchers to prove some nice theoretical results (see, e.g. [13, 22]) or to specify some aspects of program analyses in an optimal way. Nevertheless these approaches also exhibit some drawbacks, a few of which we list in the rest of this section. Restricted form of properties. In the homomorphic approach, it is necessary to require that the abstract and concrete ....
U.S. Reddy and S.N. Kamin. On the power of abstract interpretation. In J. Cordy, editor, Proceedings of the IEEE fourth International Conference on Computer Languages (ICCL'92), Oakland, U.S.A., April 1992. IEEE Press.
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