R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages, in: P. Cousot (Ed.), Static Analysis: 8th International Symposium, SAS 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

No context found.

R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages, in: P. Cousot (Ed.), Static Analysis: 8th International Symposium, SAS 2001.

No context found.

R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages: The complete unabridged version, Quaderno 363, 36 Dipartimento di Matematica, Universita di Parma, Italy, available at http:// www.cs.unipr.it/Publications/. Also published as arXiv:cs.PL/0404055, available from http://arxiv.org/ (2004).

No context found.

R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages, in: P. Cousot (Ed.), Static Analysis: 8th International Symposium, SAS 2001.

No context found.

R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages: The complete unabridged version, Quaderno 363, 36 Dipartimento di Matematica, Universita di Parma, Italy, available at http:// www.cs.unipr.it/Publications/. Also published as arXiv:cs.PL/0404055, available from http://arxiv.org/ (2004).

No context found.

R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages, in: P. Cousot (Ed.), Static Analysis: 8th International Symposium, SAS 2001.

No context found.

R. Bagnara, R. Gori, P. M. Hill, E. Za#anella, Finite-tree analysis for constraint logic-based languages, in: P. Cousot (Ed.), Static Analysis: 8th International Symposium, SAS 2001.

....H ; Section 3.3 defines the abstract unification operator for H P . A brief description of some further developments on the subject is given in Section 4. We conclude in Section 5. A longer version of this paper with proofs of the results presented here is available as a technical report [2]. 2 Preliminaries 2.1 Infinite Terms and Substitutions For a set S, #(S) is the powerset of S, whereas # f (S) is the set of all the finite subsets of S. Let Sig denote a possibly infinite set of function symbols, ranked over the set of natural numbers. It is assumed that Sig contains at least ....

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universita di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/.

....with finite tree dependencies is a practical means of obtaining precise finiteness information. 1 Introduction Many logic based languages refer to a computation domain of rational trees. While rational trees allow for increased expressivity, they also have a surprising number of problems. See [4] for a survey of known applications of rational trees and a detailed account of many of the problems caused by their use. Some of these problems are so serious that rational trees must be used in a very controlled way, disallowing infinite trees in any context where they are dangerous . This, in ....

....that rational trees must be used in a very controlled way, disallowing infinite trees in any context where they are dangerous . This, in turn, causes a secondary problem: in order to disallow infinite trees in selected contexts, one must first detect them, an operation that may be expensive. In [4], we have introduced a composite abstract domain, H P , for finitetree analysis. The H domain, written with the initial of Herbrand and called the finiteness component, is the direct representation of the property of interest: a set of variables guaranteed to be bound to finite terms. The ....

[Article contains additional citation context not shown here]

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. In P. Cousot, editor, Static Analysis: 8th International Symposium, SAS 2001, volume 2126 of Lecture Notes in Computer Science, pages 165--184, Paris, France, 2001. Springer-Verlag, Berlin.

....increased expressivity and faster unification. Unfortunately, the use of infinite rational trees has problems. For instance, many of the built in and library predicates are ill defined for such trees and need to be supplemented by run time checks whose cost may be significant. In a recent paper [3], we have proposed a data flow analysis called finite tree analysis aimed at identifying those program variables (the finite variables) that are not currently bound to infinite terms. Here we present a domain of Boolean functions, called finite tree dependencies that precisely captures how the ....

....on these components, such as explicit structural information. Sharing information is exploited in H P for two purposes: detecting when new infinite terms are possibly created (this is done along the lines of [22] and confining the propagation of those terms as much as possible. As shown in [3, 4], by giving a generic specification for this parameter component in terms of the abstract queries it supports (in the style of the open product construct [12] it is possible to define and establish the correctness of the abstract operators on the finite tree domain independently from any ....

[Article contains additional citation context not shown here]

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universit a di Parma, 2001. Available at http://www.cs.unipr.it/ bagnara/.

....Finite trees, rational trees, data flow analysis, abstract interpretation, Boolean functions. 1 Introduction Many logic based languages refer to a computation domain of rational trees. While rational trees allow for increased expressivity, they also have a surprising number of problems. See [4] for a survey of known applications of rational trees and a detailed account of many of the problems caused by their use. Some of these problems are so serious that rational trees must be used in a very controlled way, disallowing infinite trees in any context where they are dangerous . This, in ....

....Roberta Gori is with the Department of Computer Science of the University of Pisa, Italy. Email: gori di.unipi.it. Patricia M. Hill is with the School of Computing of the University of Leeds, United Kingdom. Email: hill comp.leeds.ac.uk. 2 APPIA GULP PRODE 2001 In [4], we have introduced a composite abstract domain, H P , for finite tree analysis. The H domain, written with the initial of Herbrand and called the finiteness component, is the direct representation of the property of interest: a set of variables guaranteed to be bound to finite terms. The ....

[Article contains additional citation context not shown here]

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. In P. Cousot, editor, Static Analysis: 8th International Symposium, SAS 2001, volume 2126 of Lecture Notes in Computer Science, pages 165--184, Paris, France, 2001. Springer-Verlag, Berlin.

....expressivity and faster unification. Unfortunately, the use of infinite rational trees has problems. For instance, many of the built in and library predicates are ill defined for such trees and need to be supplemented by run time checks whose cost may be significant. In a companion paper [3] we have proposed a data flow analysis called finite tree analysis aimed at identifying those program variables (the finite variables) that are not currently bound to infinite terms. Here we present a domain of Boolean functions, called finite tree dependencies that precisely captures how the ....

....on these components, such as explicit structural information. Sharing information is exploited in H P for two purposes: detecting when new infinite terms are possibly created (this is done along the lines of [23] and confining the propagation of those terms as much as possible. As shown in [3, 4], by giving a generic specification for this parameter component in terms of the abstract queries it supports (in the style of the open product construct [12] it is possible to define and establish the correctness of the abstract operators on the finite tree domain independently from any ....

[Article contains additional citation context not shown here]

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universita di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/.

....operator for H P . A description of some ongoing work on the subject is given in Section 4 where a possible instance of the parameter P is also specified. We conclude in Section 5. A longer version of this paper with proofs of the results presented here is available as a technical report [1]. 2 Preliminaries 2.1 Infinite Terms and Substitutions For a set S, #(S) is the powerset of S, whereas # f (S) is the set of all the finite subsets of S. Let Sig denote a possibly infinite set of function symbols, ranked over the set of natural numbers. It is assumed that Sig contains at least ....

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universit a di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/.

....cation operator for H P . A description of some ongoing work on the subject is given in Section 4 where a possible instance of the parameter P is also speci ed. We conclude in Section 5. A longer version of this paper with proofs of the results presented here is available as a technical report [1]. 2 Preliminaries 2.1 In nite Terms and Substitutions For a set S, S) is the powerset of S, whereas f (S) is the set of all the nite subsets of S. Let Sig denote a possibly in nite set of function symbols, ranked over the set of natural numbers. It is assumed that Sig contains at least one ....

R. Bagnara, R. Gori, P. M. Hill, and E. Zaanella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universit a di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/.

....to the safe omission of the occurscheck) Unfortunately, the use of infinite rational trees has problems. For instance, many of the built in and library predicates are ill defined for such trees and need to be supplemented by run time checks whose cost may be significant. In a companion paper [3] we have proposed a dataflow analysis aimed at the knowledge of those program variables (the finite variables) that will always be bound to finite terms. The analysis domain introduced in [3] correctly captures the creation and propagation of cyclic terms, but is not capable of propagating the ....

....trees and need to be supplemented by run time checks whose cost may be significant. In a companion paper [3] we have proposed a dataflow analysis aimed at the knowledge of those program variables (the finite variables) that will always be bound to finite terms. The analysis domain introduced in [3] correctly captures the creation and propagation of cyclic terms, but is not capable of propagating the guarantees of finiteness that come from built in predicates and program annotations. Here we present a domain of Boolean functions that precisely captures how the finiteness of some variables ....

[Article contains additional citation context not shown here]

R. Bagnara, R. Gori, P. M. Hill, and E. Za#anella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universita di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/.

....(due to the safe omission of the occurscheck) Unfortunately, the use of in nite rational trees has problems. For instance, many of the built in and library predicates are ill de ned for such trees and need to be supplemented by run time checks whose cost may be signi cant. In a companion paper [3] we have proposed a data ow analysis aimed at the knowledge of those program variables (the nite variables) that will always be bound to nite terms. The analysis domain introduced in [3] correctly captures the creation and propagation of cyclic terms, but is not capable of propagating the ....

....trees and need to be supplemented by run time checks whose cost may be signi cant. In a companion paper [3] we have proposed a data ow analysis aimed at the knowledge of those program variables (the nite variables) that will always be bound to nite terms. The analysis domain introduced in [3] correctly captures the creation and propagation of cyclic terms, but is not capable of propagating the guarantees of niteness that come from built in predicates and program annotations. Here we present a domain of Boolean functions that precisely captures how the niteness of some variables in ....

[Article contains additional citation context not shown here]

R. Bagnara, R. Gori, P. M. Hill, and E. Zaanella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universita di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/.

No context found.

R. Bagnara, R. Gori, P. M. Hill, and E. Zaanella. Finite-tree analysis for constraint logic-based languages. In P. Cousot, editor, Static Analysis: 8th International Symposium, SAS 2001.

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