A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
From MaRDI portal
Publication:1380123
DOI10.1016/S0167-6423(97)00009-9zbMath0891.68056OpenAlexW2009654690MaRDI QIDQ1380123
Publication date: 19 July 1998
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6423(97)00009-9
Related Items (11)
Pair-independence and freeness analysis through linear refinement. ⋮ Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness ⋮ The octagon abstract domain ⋮ The two variable per inequality abstract domain ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ Iterating Octagons ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ The reduced relative power operation on abstract domains ⋮ Set-sharing is redundant for pair-sharing ⋮ Finite-tree analysis for constraint logic-based languages
This page was built for publication: A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
