378 search results - page 47 / 76 » Automating Mathematical Program Transformations |
100
click to vote
LPAR
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
PLILP
1993
Springer
15 years 3 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
PLDI
2003
ACM
15 years 4 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
ESOP
2005
Springer
15 years 4 months ago
2005
Springer
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
120
click to vote
PLDI
2003
ACM
15 years 4 months ago
2003
ACM
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program’s user community. Several example applications illustrat...