de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Directional Type Inference for Logic Programs

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44232

Charatonik,  Witold
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45201

Podelski,  Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Charatonik, W., & Podelski, A. (1998). Directional Type Inference for Logic Programs. In G. Levi (Ed.), Proceedings of the 5th International Symposium in Static Analysis (SAS-98) (pp. 278-294). Berlin, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-382C-5
Zusammenfassung
We follow the set-based approach to directional types proposed by Aiken and Lakshman$\:$\cite{AikenL:sas94}. Their type \emph{checking} algorithm works via set constraint solving and is sound and complete for given discriminative types. We characterize directional types in model-theoretic terms. We present an algorithm for \emph{inferring} directional types. The directional type that we derive from a logic program~$\P$ is uniformly at least as precise as any discriminative directional type of~$\P$, i.e., any directional type out of the class for which the type {\em checking\/} algorithm of Aiken and Lakshman is sound and complete. We improve their algorithm as well as their lower bound and thereby settle the complexity (D{\footnotesize EXPTIME}-complete) of the corresponding problem.