Sciweavers

4940 search results - page 225 / 988
» On the Complexity of Universal Programs
Sort
View
JSC
2007
106views more  JSC 2007»
15 years 6 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
FAC
2002
78views more  FAC 2002»
15 years 6 months ago
A Refinement Calculus for Shared-Variable Parallel and Distributed Programming
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...
Jürgen Dingel
ECBS
1999
IEEE
112views Hardware» more  ECBS 1999»
15 years 10 months ago
Metaprogrammable Toolkit for Model-Integrated Computing
Model-Integrated Computing, specifically Model-Integrated Program Synthesis (MIPS) environments that include visual model building, constraint management, and automatic program sy...
Ákos Lédeczi, Miklos Maroti, Gabor K...
TOOLS
1998
IEEE
15 years 10 months ago
Macro Processing in Object-Oriented Languages
There are a number of programmable macro systems such as Lisp's. While they can handle complex program transformation, they still have difficulty in handling some kinds of tr...
Shigeru Chiba
PLDI
2009
ACM
16 years 1 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner