R. Bagnara, P. M. Hill, E. Za#anella, E#cient structural information analysis for real CLP languages, in: M. Parigot, A. Voronkov (Eds.), Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) Self-citation (Bagnara Hill) (Correct)
No context found.
R. Bagnara, P. M. Hill, E. Za#anella, E#cient structural information analysis for real CLP languages, in: M. Parigot, A. Voronkov (Eds.), Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) Self-citation (Bagnara Hill) (Correct)
No context found.
R. Bagnara, P. M. Hill, E. Za#anella, E#cient structural information analysis for real CLP languages, in: M. Parigot, A. Voronkov (Eds.), Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) Self-citation (Bagnara Hill) (Correct)
No context found.
R. Bagnara, P. M. Hill, E. Za#anella, E#cient structural information analysis for real CLP languages, in: M. Parigot, A. Voronkov (Eds.), Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) Self-citation (Bagnara Hill) (Correct)
No context found.
R. Bagnara, P. M. Hill, E. Za#anella, E#cient structural information analysis for real CLP languages, in: M. Parigot, A. Voronkov (Eds.), Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000.
Efficient Structural Information Analysis for Real CLP.. - Bagnara, Hill, Zaffanella (1955) (2 citations) Self-citation (Bagnara Hill) (Correct)
No context found.
R. Bagnara, P. M. Hill, and E. Za#anella. E#cient structural information analysis for real CLP languages. Quaderno 229, Dipartimento di Matematica, Universita di Parma, 2000. Available at http://www.cs.unipr.it/~bagnara.
An Efficient and Precise Finite-Tree Analysis for.. - Bagnara, Zaffanella, .. Self-citation (Bagnara Hill) (Correct)
....for constraint languages would be similar. If the analyzed language allows the use of constraints on various domains to restrict the values of the variable leaves of rational trees, the corresponding concrete domain would have one or more extra components to account for the constraints (see [3] for an example) The concrete element y expresses a dependency between x and y. In contrast, only constrains x. The same concept can be expressed by saying that in the first case the variable name y matters, but it does not in the second case. Thus, the set of variables of ....
....and compared the three domains Pattern(P ) Pattern(H ) and Pattern(Bfun H P ) where the parameter component P has been instantiated to the domain Pos SFL 2 [6, 41, 64] for tracking groundness, freeness, linearity and (non redundant) set sharing information. The Pattern( operator [3] further upgrades the precision of its argument by adding explicit structural information. Concerning the Bfun component, the implementation was straightforward, since all the techniques described in [5] and almost all the code, including the widenings) was reused unchanged, obtaining comparable ....
R. Bagnara, P. M. Hill, and E. Za#anella. E#cient structural information analysis for real CLP languages. In M. Parigot and A. Voronkov, editors, Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR
Enhanced Sharing Analysis Techniques: A Comprehensive.. - Bagnara, Zaffanella, Hill (2000) (3 citations) Self-citation (Bagnara Hill) (Correct)
....This technique was proposed by A. Cortesi et al. in [15] where the generic structural domain Pat(#) was introduced. A similar proposal, tailored to sharing analysis, is due to [8] where abstract equation systems are considered. In our experimental evaluation we use the Pattern( construction [2, 3, 5], which is similar to Pat(#) and correctly supports the analysis of languages omitting the occur check in the unification procedure as well as those that do not. The construction Pattern( upgrades a domain D (which must support a certain set of basic operations) with structural information. ....
....has the potential of pruning some computation paths on the grounds that they cannot be followed by the program being analyzed. On the other hand, maintaining a tuple of terms with many variables, each with its own description, can be cheaper than computing a description for the whole tuple [5]. Let us call Modes, the combination of Pos, Sharing, Free, and Lin. We have compared the precision for Modes with that obtained using Pattern(Modes) The results are reported in Tables 2 and 3. The approach we have chosen for measuring the precision gain is simple though unsatisfactory: throw ....
[Article contains additional citation context not shown here]
R. Bagnara, P. M. Hill, and E. Za#anella. E#cient structural information analysis for real CLP languages. Quaderno 229, Dipartimento di Matematica, Universita di Parma, 2000. Available at http://www.cs.unipr.it/~bagnara.
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