activity
20012009
collaborators

5 papers

cs.PL2009

Coding Guidelines for Prolog

Michael A. Covington, Roberto Bagnara, Richard A. O'Keefe +2

Coding standards and good practices are fundamental to a disciplined approach to software projects, whatever programming languages they employ. Prolog programming can benefit from…

cs.PL2004

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…

cs.PL2004

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…

cs.PL2003

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…

cs.PL2001

Decomposing Non-Redundant Sharing by Complementation

Enea Zaffanella, Patricia M. Hill, Roberto Bagnara

Complementation, the inverse of the reduced product operation, is a technique for systematically finding minimal decompositions of abstract domains. File' and Ranzato advanced the…