39 search results - page 1 / 8 » Generalizing Cook's Transformation to Imperative Stack Progr... |
BIRTHDAY
1994
Springer
13 years 9 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
ECOOPWEXCEPTION
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
SIGADA
2007
Springer
13 years 11 months ago
2007
Springer
Teaching beginners predicate transformer semantics for imperative languages is not a trivial task. For Computer Science majors, the teaching of the theoretical material must be su...
MICRO
2012
IEEE
11 years 8 months ago
2012
IEEE
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
PEPM
2004
ACM
13 years 10 months ago
2004
ACM
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to ident...