R. Bagnara. Constraint systems for pattern analysis of constraint logic-based languages. In P. Codognet, editor, Proc. CCP '95 Workshop, 1995. URL http://www.di.unipi.it/¸bagnara/bagnara.html. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Functional Dependencies and Moore-Set Completions of Abstract.. - Giacobazzi, al. (1995) (9 citations) (Correct)
....; f k 2 lfp(T s Gammac P ) 1 k n and for 1 i k Gamma 1, h i G f i (lfp(T S Q ) and h k b k G f k (lfp(T S Q ) are renamed apart, and # = mgu(hh 1 ; h k i; hg 1 ; g k i) then b k # is a call pattern for G in P [ Q . 6 Related works The most related works are [3, 11, 12, 26]. Cousot and Cousot firstly defined the reduced cardinal power of abstract interpretations in [11] This construction, relied upon the particular semantics of assertions, was based on functional composition with respect to the meet operation on assertions, which restricted to additive functions ....
.... does not behave like a meet operation (e.g. it is not commutative) Note, however, that functional dependencies relatively to an operation of composition are included into the relational analysis defined by combination of reduced product and down set completion ( 12] Recently, Bagnara in [3] has developed an elegant meta language for domain combination which is based on a subset of a cc language, providing asynchronous interaction of domains. Because of this feature, the composition of abstract domains relies upon (lower) closure operators, which provide the standard semantic ....
R. Bagnara. Constraint systems for pattern analysis of constraint logic-based languages. In P. Codognet, editor, Proc. CCP '95 Workshop, 1995. URL http://www.di.unipi.it/¸bagnara/bagnara.html.
Domain Independent Ask Approximation in CCP - Zaffanella (1995) (2 citations) (Correct)
....an extensive study of the cost precision tradeoffs of the different abstract semantics proposals is strongly needed. It has been recently shown that delay mechanisms in both sequential constraint languages and constraint solvers can be formalized as asks primitives on an underling domain (see [1] for the definition of ask tell constraint systems and some related issues) This connection is currently being further investigated from the point of view of ask approximation. Acknowledgements: The author would like to thank Catuscia Palamidessi for her valuable comments and suggestions on a ....
R. Bagnara. Constraint Systems for Pattern Analysis of Constraint Logic--Based Languages. Presented at the First Int'l Workshop on Concurrent Constraint Programming, Venice, Italy, 1995.
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