%
% 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: S-Doaitse_Swierstra
%




@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}
}

@InProceedings{Van Roy_et_al:1996,
      AUTHOR = {Van Roy, Peter and Mehl, Michael and Scheidhauer, Ralf},
      TITLE = {Integrating Efficient Records into Concurrent Constraint Programming},
      YEAR = {1996},
      BOOKTITLE = {8th International Symposium on Programming Languages, Implementations, Logics, and Programs (PLILP '96), September 24-27},
      NUMBER = {1140},
      PAGES = {438-453},
      EDITOR = {Kuchen, Herbert and Swierstra, S. Doaitse},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Aachen, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/plilp96.ps.gz},
      ABSTRACT = {We show how to implement efficient records in constraint logic programming (CLP) and its generalization concurrent constraint programming (CCP). Records can be naturally integrated into CCP as a new constraint domain. The implementation provides the added expressive power of concurrency and fine-grained constraints over records, yet does not pay for this expressivity when it is not used. In addition to traditional record operations, our implementation allows to compute with partially-known records. This fine granularity is useful for natural-language and knowledge-representation applications. The paper describes the implementation of records in the DFKI Oz system. Oz is a higher-order CCP language with encapsulated search. We show that the efficiency of records in CCP is competitive with modern Prolog implementation technology and that our implementation provides improved performance for natural-language applications.},
      ANNOTE = {COLIURL : Roy:1996:IER.pdf Roy:1996:IER.ps}
}