It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined and sound with respect to the concrete semantics. In logic programming, the abstract domain Sharing is a standard choice for sharing analysis for both practical work and further theoretical study. In spite of this, we found that there were no satisfactory proofs for the key properties of commutativity and idempotence that are essential for Sharing to be well-defined and that published statements of the soundness of Sharing assume the occurs-check. This paper provides a generalization of the abstractio...
In this paper we consider static analyses based on abstract interpretation of logic programs over co...
In this paper, abstract interpretation algorithms are described for computing the sharmg as well as ...
The Set-Sharing domain has been widely used to infer at compiletime interesting properties of logic ...
It is important that practical data-flow analyzers are backed by reliably proven theoretical results...
AbstractThis paper describes an algebraic approach to the sharing analysis of logic programs based o...
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
It is well known that freeness and linearity information positively interact with aliasing informati...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs...
We investigate Jacobs and Langen's Sharing domain for the analysis of set-sharing and show that...
This article considers static analysis based on abstract interpretation of logic programs over combi...
It is well known that freeness and linearity information positively interact with aliasing informati...
AbstractSharing information is useful in specialising, optimising and parallelising logic programs a...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
AbstractAlthough the usual goal of sharing analysis is to detect which pairs of variables share, the...
Abstract interpretation is a technique for developing static analyses. Yet, proving abstract interpr...
In this paper we consider static analyses based on abstract interpretation of logic programs over co...
In this paper, abstract interpretation algorithms are described for computing the sharmg as well as ...
The Set-Sharing domain has been widely used to infer at compiletime interesting properties of logic ...
It is important that practical data-flow analyzers are backed by reliably proven theoretical results...
AbstractThis paper describes an algebraic approach to the sharing analysis of logic programs based o...
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
It is well known that freeness and linearity information positively interact with aliasing informati...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs...
We investigate Jacobs and Langen's Sharing domain for the analysis of set-sharing and show that...
This article considers static analysis based on abstract interpretation of logic programs over combi...
It is well known that freeness and linearity information positively interact with aliasing informati...
AbstractSharing information is useful in specialising, optimising and parallelising logic programs a...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
AbstractAlthough the usual goal of sharing analysis is to detect which pairs of variables share, the...
Abstract interpretation is a technique for developing static analyses. Yet, proving abstract interpr...
In this paper we consider static analyses based on abstract interpretation of logic programs over co...
In this paper, abstract interpretation algorithms are described for computing the sharmg as well as ...
The Set-Sharing domain has been widely used to infer at compiletime interesting properties of logic ...