Sciweavers

317 search results - page 5 / 64
» Deductive Program Repair
Sort
View
VLDB
1990
ACM
86views Database» more  VLDB 1990»
15 years 1 months ago
How to Forget the Past Without Repeating It
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
Jeffrey F. Naughton, Raghu Ramakrishnan
KBSE
2009
IEEE
15 years 4 months ago
A Case for Automated Debugging Using Data Structure Repair
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
Muhammad Zubair Malik, Khalid Ghori, Bassem Elkara...
CORR
2002
Springer
93views Education» more  CORR 2002»
14 years 9 months ago
Logic program specialisation through partial deduction: Control issues
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
Michael Leuschel, Maurice Bruynooghe
ESOP
1998
Springer
15 years 1 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
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...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
VLDB
1991
ACM
128views Database» more  VLDB 1991»
15 years 1 months ago
A Functional Programming Approach to Deductive Databases
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Alexandra Poulovassilis, Carol Small