Sciweavers

218 search results - page 19 / 44
» Generating Compiler Optimizations from Proofs
Sort
View
CP
2009
Springer
14 years 8 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
ICFP
2008
ACM
14 years 7 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar
CAEPIA
2005
Springer
14 years 1 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
Héctor Palacios, Hector Geffner
FMCO
2008
Springer
133views Formal Methods» more  FMCO 2008»
13 years 9 months ago
BML and Related Tools
The Bytecode Modeling Language (BML) is a specication for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML s...
Jacek Chrzaszcz, Marieke Huisman, Aleksy Schubert
LCPC
2004
Springer
14 years 1 months ago
Performance of OSCAR Multigrain Parallelizing Compiler on SMP Servers
Abstract. This paper describes performance of OSCAR multigrain parallelizing compiler on various SMP servers, such as IBM pSeries 690, Sun Fire V880, Sun Ultra 80, NEC TX7/i6010 an...
Kazuhisa Ishizaka, Takamichi Miyamoto, Jun Shirako...