Sciweavers

Share
16 search results - page 1 / 4
» Set-Based Failure Analysis for Logic Programs and Concurrent...
Sort
View
ESOP
1999
Springer
12 years 6 months ago
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
ICLP
1997
Springer
12 years 6 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CL
1999
Springer
12 years 1 months ago
An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
Jimmy Ho-Man Lee, Ho-fung Leung
JLP
2000
109views more  JLP 2000»
12 years 1 months ago
Demand Transformation Analysis for Concurrent Constraint Programs
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
Moreno Falaschi, Patrick Hicks, William H. Winsbor...
PPDP
1999
Springer
12 years 6 months ago
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
Ulrich Neumerkel, Frédéric Mesnard
books