144 search results - page 21 / 29 » Nondeterminism Analysis of Functional Logic Programs |
109
click to vote
IWMM
2007
Springer
15 years 9 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
142
click to vote
FMCAD
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
237
click to vote
POPL
2004
ACM
16 years 3 months 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...
161
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
168
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...