Sciweavers

378 search results - page 31 / 76
» Automating Mathematical Program Transformations
Sort
View
PEPM
2009
ACM
15 years 8 months ago
Program interpolation
Program interpolation is a new type of transformation that given an input program written in a specially constructed Domain Specific Language (DSL), produces a family of function...
Andrew Moss, Dan Page
LPNMR
2001
Springer
15 years 3 months ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang
LOPSTR
2004
Springer
15 years 4 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
PLILP
1998
Springer
15 years 3 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
IPPS
2007
IEEE
15 years 5 months ago
Automatic MPI application transformation with ASPhALT
This paper describes a source to source compilation tool for optimizing MPI-based parallel applications. This tool is able to automatically apply a “prepushing” transformation...
Anthony Danalis, Lori L. Pollock, D. Martin Swany