Skip to Main content Skip to Navigation
Conference papers

Inclusion Constraints over Non-Empty Sets of Trees

Abstract : We present a new constraint system called Ines. Its constraints are conjunctions of inclusions t1 subset t2 between first-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express Ines constraints only if they include negation. Their satisfiability problem is NEXPTIME-complete. We present an incremental algorithm that solves the satisfiability problem of Ines constraints in cubic time. We intend to apply Ines constraints for type analysis for a concurrent constraint programming language.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00536816
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:09:59 PM
Last modification on : Thursday, September 20, 2018 - 7:54:02 AM
Long-term archiving on: : Thursday, February 17, 2011 - 3:15:59 AM

Files

ines97.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536816, version 1

Citation

Martin Müller, Joachim Niehren, Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, 1997, Lille, France. pp.217-231. ⟨inria-00536816⟩

Share

Metrics

Record views

29

Files downloads

105