Finite-tree analysis for constraint logic-based languages

DOI10.1016/j.ic.2004.04.005zbMath1088.68025OpenAlexW1994418588MaRDI QIDQ817224

Roberta Gori, Enea Zaffanella, Patricia M. Hill, Roberto Bagnara

Publication date: 7 March 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.04.005

zbMATH Keywords

static analysisabstract interpretationrational unification

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Negative Ternary Set-Sharing

Uses Software

• LPTP
• YAP-Prolog
• Ciao
• CiaoPP
• SICStus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The quotient of an abstract interpretation
• Generalizations of unification
• A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• Set-sharing is redundant for pair-sharing
• Two classes of Boolean functions for dependency analysis
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• Boolean Functions for Finite-Tree Dependencies
• Parser generation and grammar manipulation using prolog's infinite trees
• On derived dependencies and connected databases
• Abstract interpretation and application to logic programs
• Deriving descriptions of possible values of program variables by means of abstract interpretation
• Static analysis of logic programs for independent and parallelism
• The Logic of Typed Feature Structures
• The theoretical foundations of LPTP (a logic program theorem prover)
• Records for logic programming
• Type analysis of prolog using type graphs
• Soundness, idempotence and commutativity of set-sharing
• Decomposing non-redundant sharing by complementation
• Pair-sharing over rational trees
• A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
• Enhanced sharing analysis techniques: a comprehensive evaluation
• cTI: a constraint-based termination inference tool for ISO-Prolog
• Sharing is optimal
• A semantic basis for the termination analysis of logic programs
• Abstract Interpretation Frameworks