• Set-based failure analysis for...

Treffer: Set-based failure analysis for logic programs and concurrent constraint programs

Title:
Set-based failure analysis for logic programs and concurrent constraint programs
Authors:
PODELSKI, A, CHARATONIK, W, MÜLLER, M
Source:
Programming languages and systems (Amsterdam, 22-28 March 1999)Lecture notes in computer science. :177-192
Publisher Information:
Berlin: Springer, 1999.
Publication Year:
1999
Physical Description:
print, 37 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 programme, Program analysis, Análisis programa, Analyse syntaxique, Syntactic analysis, Análisis sintáxico, Analyse sémantique, Semantic analysis, Análisis semántico, Langage programmation, Programming language, Lenguaje programación, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation concurrente par contrainte, Concurrent constraint programming
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Max-Planck-Institut für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany
Programming Systems Lab, Universität des Saarlandes, 66041 Saarbrücken, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=1576972
Rights:
Copyright 1999 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.1576972
Database:
PASCAL Archive

Weitere Informationen

This paper presents the first approximation method of the finite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs with ongoing behaviors (perpetual processes). Our technical contributions are (1) the semantical characterization of finite failure of logic programs over infinite trees and (2) the design and soundness proof of the first set-based analysis of logic programs with the greatest-model semantics. Finally, we exhibit the connection between finite failure and the inevitability of the 'inconsistent-store' error in fair executions of concurrent constraint programs where no process suspends forever. This indicates a potential application to error diagnosis for concurrent constraint programs.