Abstract domains for reordering CLP(RLin) programs

DOI10.1016/S0743-1066(99)00011-4MaRDI QIDQ4943436zbMATH OpenOpenAlexFDO

Authors

Publication date 4 June 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(99)00011-4

zbMATH Keywords

constraint logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Partial order reduction for rewriting semantics of programming languages
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Structures for abstract rewriting
• Order-Sorted Rewriting and Congruence Closure
• Lifting CDCL to template-based abstract domains for program verification
• A semantic approach to order-sorted rewriting
• A semantic approach to order-sorted rewriting
• Verification, Model Checking, and Abstract Interpretation
• Composing programs in a rewriting logic for declarative programming

Cited in

(4)

• Repeated redundant inequalities in constraint logic programming
• Widening and narrowing operators for abstract interpretation
• A method for detecting symmetries in constraint models and its generalisation
• scientific article; zbMATH DE number 1678390 (Why is no real title available?)

This page was built for publication: Abstract domains for reordering CLP(RLin) programs

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