Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version

Simple item page
dc.creatorBagnara, Roberto
dc.creatorGori, Roberta
dc.creatorHill, Patricia M.
dc.creatorZaffanella, Enea
dc.date2004-04-26
dc.date2004-04-27
dc.date.accessioned2026-07-07T03:21:09Z
dc.date.available2026-07-07T03:21:09Z
dc.descriptionLogic 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 occurs-check) and increased expressivity (cyclic terms can provide very efficient representations of grammars and other useful objects). Unfortunately, the use of infinite rational trees has problems. For instance, many of the built-in and library predicates are ill-defined for such trees and need to be supplemented by run-time checks whose cost may be significant. Moreover, some widely-used program analysis and manipulation techniques are correct only for those parts of programs working over finite trees. It is thus important to obtain, automatically, a knowledge of the program variables (the finite variables) that, at the program points of interest, will always be bound to finite terms. For these reasons, we propose here a new data-flow analysis, based on abstract interpretation, that captures such information.
dc.description89 pages, 1 table
dc.identifierhttps://arxiv.org/abs/cs/0404055
dc.identifierhttp://arxiv.org/abs/cs/0404055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32092
dc.subjectProgramming Languages
dc.subjectF.3.2
dc.titleFinite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
dc.typetext

Files

Collections

arXiv