Negative Ternary Set-Sharing

DOI10.1007/978-3-540-89982-2_30zbMath1185.68185OpenAlexW2110360927MaRDI QIDQ5504663

Elena S. Ackley, Jorge A. Navas, E. Trías, Stephanie Forrest, Manuel V. Hermenegildo

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: http://oa.upm.es/14307/

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Parallel Logic Programming: A Sequel ⋮ Negative Ternary Set-Sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Finite-tree analysis for constraint logic-based languages
• Two classes of Boolean functions for dependency analysis
• On the design of a correct freeness analysis for logic programs
• Lazy Set-Sharing Analysis
• Static analysis of logic programs for independent and parallelism
• Compile-time derivation of variable dependency using abstract interpretation
• A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
• An algebraic approach to sharing analysis of logic programs
• Functional and Logic Programming
• Collapsing Closures
• Precise Set Sharing Analysis for Java-Style Programs
• Negative Ternary Set-Sharing

This page was built for publication: Negative Ternary Set-Sharing