1204 search results - page 156 / 241 » Termination of Polynomial Programs |
106
Voted
CAL
2006
15 years 21 days ago
2006
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
124
click to vote
ICAI
2010
14 years 10 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
200
Voted
POPL
2004
ACM
16 years 29 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
97
Voted
APLAS
2005
ACM
15 years 6 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
92
Voted
SCAM
2006
IEEE
15 years 6 months ago
2006
IEEE
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...