6248 search results - page 423 / 1250 » Programming in a data factory |
180
click to vote
ICTAC
2004
Springer
16 years 7 days ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
167
click to vote
PLDI
2003
ACM
16 years 4 days ago
2003
ACM
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
156
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
164
click to vote
CC
2003
Springer
16 years 3 days ago
2003
Springer
We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data...
203
click to vote
HPDC
2010
IEEE
15 years 8 months ago
2010
IEEE
MapReduce programming model has simplified the implementation of many data parallel applications. The simplicity of the programming model and the quality of services provided by m...