5 papers · 1 filter
Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract)
Roberto Bagnara, Patricia M. Hill, Elena Mazzi +1
We discuss the divergence problems recently identified in some extrapolation operators for weakly-relational numeric domains. We identify the cause of the divergences and point out…
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Roberto Bagnara, Roberta Gori, Patricia M. Hill +1
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occu…
Enhanced sharing analysis techniques: a comprehensive evaluation
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core…
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of lo…
cTI: A constraint-based termination inference tool for ISO-Prolog
Fred Mesnard, Roberto Bagnara
We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a t…