scientific article; zbMATH DE number 1832223
From MaRDI portal
Recommendations
- Finite-tree analysis for constraint logic-based languages
- Boolean functions for finite-tree dependencies
- Pair-sharing over rational trees
- A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
- Finite and Rational Tree Constraints
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778701)