A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

Hill, P.M., Zaffanella, E. and Bagnara, R. (2004) A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages. Theory and Practice of Logic Programming, 4 (3). pp. 289-323. ISSN 1471-0684

Abstract

Metadata

Authors/Creators:
  • Hill, P.M.
  • Zaffanella, E.
  • Bagnara, R.
Copyright, Publisher and Additional Information: © 2004 Cambridge University Press
Keywords: abstract interpretation, logic programming, abstract unification, rational trees, set-sharing, freeness, linearity
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Repository Assistant
Date Deposited: 18 May 2006
Last Modified: 23 Sep 2016 05:34
Published Version: http://dx.doi.org/10.1017/S1471068403001868
Status: Published
Publisher: Cambridge University Press
Refereed: Yes
Identification Number: 10.1017/S1471068403001868

Download

Filename: hillP3.pdf

Share / Export

Statistics