590 search results - page 52 / 118 » Non-Failure Analysis for Logic Programs |
ESOP
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applica...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the program code of an application...
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore process...