Sciweavers

590 search results - page 50 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 9 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
CP
1998
Springer
14 years 1 months ago
A Framework for Assertion-Based Debugging in Constraint Logic Programming
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
Germán Puebla, Francisco Bueno, Manuel V. H...
EMSOFT
2009
Springer
14 years 3 months ago
Probabilistic modeling of data cache behavior
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
Vinayak Puranik, Tulika Mitra, Y. N. Srikant
META
1992
14 years 28 days ago
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
Maurice Bruynooghe, Gerda Janssens
PODS
1991
ACM
131views Database» more  PODS 1991»
14 years 11 days ago
Termination Detection in Logic Programs using Argument Sizes
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
Kirack Sohn, Allen Van Gelder