Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs

Podelski, Andreas; Charatonik, Witold; Müller, Martin

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs

MPS-Authors

/persons/resource/persons45201

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

/persons/resource/persons44232

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Podelski, A., Charatonik, W., & Müller, M. (1999). Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs. In S. D. Swierstra (Ed.), Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP-99) (pp. 177-192). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3694-7

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