Treffer: Complexity of subtype satisfiability over posets
Title:
Complexity of subtype satisfiability over posets
Authors:
Source:
Programming languages and systems (Edinburgh, 4-8 April 2005)Lecture notes in computer science. :357-373
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 35 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Langages de programmation, Programming languages, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Analyse programme, Program analysis, Análisis programa, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Langage coordination, Coordination language, Lenguaje coordinación, Langage programmation, Programming language, Lenguaje programación, Logique modale, Modal logic, Lógica modal, Problème satisfiabilité, Satisfiability problem, Problema satisfactibilidad, Relation ordre partiel, Partial ordering, Relación orden parcial, Satisfiabilité, Satisfiability, Satisfactibilidad, Soustype, Subtype, Subtipo, Treillis, Lattice, Enrejado, Vérification programme, Program verification, Verificación programa
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
INRIA Futurs, Lille, France
Programming Systems Lab, Saarland University, Saarbriicken, Germany
Department of Computer Science, University of California, Davis, CA 95616, United States
Programming Systems Lab, Saarland University, Saarbriicken, Germany
Department of Computer Science, University of California, Davis, CA 95616, United States
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16895770
Database:
PASCAL Archive
Weitere Informationen
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.