Generalized semantics and abstract interpretation for constraint logic programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970715
- Precise goal-independent abstract interpretation of constraint logic programs.
- Observable Semantics for Constraint Logic Programs
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Precise goal-independent abstract interpretation of constraint logic programs
Cited in
(18)- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- Precise goal-independent abstract interpretation of constraint logic programs.
- Set-sharing is redundant for pair-sharing
- A theory of observables for logic programs
- Pair-independence and freeness analysis through linear refinement.
- Model-based computing: Developing flexible machine control software
- A semantic framework for the abstract model checking of tccp programs
- Precise goal-independent abstract interpretation of constraint logic programs
- An algebraic perspective of constraint logic programming
- A constraint solver based on abstract domains
- scientific article; zbMATH DE number 4128359 (Why is no real title available?)
- scientific article; zbMATH DE number 1200168 (Why is no real title available?)
- scientific article; zbMATH DE number 1482189 (Why is no real title available?)
- Abstract interpretation of temporal concurrent constraint programs
- Observable Semantics for Constraint Logic Programs
- A freeness and sharing analysis of logic programs based on a pre-interpretation
- scientific article; zbMATH DE number 970715 (Why is no real title available?)
- Declarative debugging in constraint logic programming
This page was built for publication: Generalized semantics and abstract interpretation for constraint logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128618)