Structure sharing is used in symbolic computation to share a common top level between terms with different lower levels. It is widely used in the implementation of Prolog interpreters and is of interest for the implementation of automatic theorem provers, interactive proof editors and verification systems. Previously, structure sharing has been applied only to free-variable terms. In this paper we extend the structure sharing technique to quantified terms. We give an efficient unification algorithm of our structure sharing representation of quantified terms, and we prove the correctness of the algorithm
AbstractThis paper describes an algebraic approach to the sharing analysis of logic programs based o...
emaih mauriceOcs.kuleuven.ac.be Abst ract. The availability of freeness and sharing information for ...
AbstractQu-Prolog is an extension of Prolog which performs meta-level computations over object langu...
AbstractConventional logic-programming languages rely fundamentally on symbolic computation with qua...
AbstractVarious Prolog systems can be classified into two categories: Structure Sharing (SS) and Str...
Abstract: "Unification for a first order language is a method that attempts to make terms of the lan...
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
Several proposals for computing freeness information for logic programs have been put forward in the...
AbstractSeveral proposals for computing freeness information for logic programs have been put forwar...
Representation sharing can reduce the memory footprint of a program by sharing one representation be...
Sharing information between logical variables is crucial for a lot of analyses of logic programs, e....
The precise computation of abstractions is a bottleneck in many approaches to CEGAR-based verificat...
Several proposals for computing freeness information for logic programs have been put forward in re...
Abstract. Sharing of substructures like subterms and subcontexts in terms is a common method for spa...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
AbstractThis paper describes an algebraic approach to the sharing analysis of logic programs based o...
emaih mauriceOcs.kuleuven.ac.be Abst ract. The availability of freeness and sharing information for ...
AbstractQu-Prolog is an extension of Prolog which performs meta-level computations over object langu...
AbstractConventional logic-programming languages rely fundamentally on symbolic computation with qua...
AbstractVarious Prolog systems can be classified into two categories: Structure Sharing (SS) and Str...
Abstract: "Unification for a first order language is a method that attempts to make terms of the lan...
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
Several proposals for computing freeness information for logic programs have been put forward in the...
AbstractSeveral proposals for computing freeness information for logic programs have been put forwar...
Representation sharing can reduce the memory footprint of a program by sharing one representation be...
Sharing information between logical variables is crucial for a lot of analyses of logic programs, e....
The precise computation of abstractions is a bottleneck in many approaches to CEGAR-based verificat...
Several proposals for computing freeness information for logic programs have been put forward in re...
Abstract. Sharing of substructures like subterms and subcontexts in terms is a common method for spa...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
AbstractThis paper describes an algebraic approach to the sharing analysis of logic programs based o...
emaih mauriceOcs.kuleuven.ac.be Abst ract. The availability of freeness and sharing information for ...
AbstractQu-Prolog is an extension of Prolog which performs meta-level computations over object langu...