A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages

DOI10.1016/S0167-6423(97)00009-9MaRDI QIDQ1380123zbMATH OpenOpenAlexFDO

Authors Roberto Bagnara

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

zbMATH Keywords

constraint logic-based languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Generalized semantics and abstract interpretation for constraint logic programs
• scientific article; zbMATH DE number 970715
• Efficient analysis of concurrent constraint logic programs
• A confluent semantic basis for the analysis of concurrent constraint logic programs
• Observable Semantics for Constraint Logic Programs

Cited in

(12)

• Iterating Octagons
• Donut domains: efficient non-convex domains for abstract interpretation
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• The reduced relative power operation on abstract domains
• Semantics of multiway dataflow constraint systems
• Exact join detection for convex polyhedra and other numerical abstractions
• Set-sharing is redundant for pair-sharing
• The two variable per inequality abstract domain
• The octagon abstract domain
• Pair-independence and freeness analysis through linear refinement.
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380123)