Subtype satisfiability is an important problem for designing advanced subtype systems and subtype-based program analysis algorithms. The problem is well understood if the atomic types form a lattice. However, little is known about subtype satisfiability over posets. In this paper, we investigate algorithms for and the complexity of subtype satisfiability over general posets. We present a uniform treatment of different flavors of subtyping: simple versus recursive types and structural versus non-structural subtype orders. Our results are established through a new connection of subtype constraints and modal logic. As a consequence, we settle a problem left open by Tiuryn and Wand in 1993. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Niehren, J., Priesnitz, T., & Su, Z. (2005). Complexity of subtype satisfiability over posets. In Lecture Notes in Computer Science (Vol. 3444, pp. 357–373). Springer Verlag. https://doi.org/10.1007/978-3-540-31987-0_25
Mendeley helps you to discover research relevant for your work.