1294 search results - page 46 / 259 » FFT Compiler Techniques |
116
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
131
Voted
TSE
2010
15 years 1 months ago
2010
—The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or...
120
Voted
ISMIS
2005
Springer
15 years 9 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
111
click to vote
KBSE
2003
IEEE
15 years 8 months ago
2003
IEEE
Refactoring, an important technique for increasing flexibility of the source code, can be applied with much ease and efficiency by using automated tools. There is currently a lack...
123
Voted
IJCAI
2003
15 years 4 months ago
2003
A promising technique used in some planning systems to improve their performance is the use of domain dependent search control knowledge. We present a procedure for compiling sear...