%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:22 +0100 GMT
%    
% Selection : Author: Witold_Charatonik
%




@TechReport{Podelski_et_al:1997,
      AUTHOR = {Podelski, Andreas and Charatonik, Witold and Müller, Martin},
      TITLE = {Set-Based Error Diagnosis of Concurrent Constraint Programs},
      YEAR = {1997},
      MONTH = {December},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {http://www.ps.uni-sb.de/Paper/abstracts/Diagnosis-97.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diagnosis-97.ps.gz},
      ABSTRACT = {We present an automated method for the static prediction of the run-time error 'deadlock or failure' in concurrent constraint programs. The method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically, the method is based on the connection between the inevitability of 'deadlock or failure' in concurrent constraint programs, finite failure in logic programming and the greatest-model semantics over infinite trees.},
      ANNOTE = {COLIURL : Podelski:1997:SBE.pdf Podelski:1997:SBE.ps}
}

@InProceedings{Podelski_et_al:1999,
      AUTHOR = {Podelski, Andreas and Charatonik, Witold and Müller, Martin},
      TITLE = {Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs},
      YEAR = {1999},
      BOOKTITLE = {8th European Symposium of Programming (ESOP '99). Programming Languages and Systems, March 22-28},
      NUMBER = {1576},
      PAGES = {177-192},
      EDITOR = {Swierstra, S. Doaitse},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Amsterdam, The Netherlands},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/esop99.ps.gz},
      ABSTRACT = {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.},
      ANNOTE = {COLIURL : Podelski:1999:SBF.pdf Podelski:1999:SBF.ps}
}