Abstract. We study sequential programs that are instruction sequences with dynamically instantiated instructions. We de¯ne the meaning of such programs in two di®erent ways. In either case, we give a transla-tion by which each program with dynamically instantiated instructions is turned into a program without them that exhibits on execution the same behaviour by interaction with some service. The complexity of the trans-lations di®er considerably, whereas the services concerned are equally simple. However, the service concerned in the case of the simpler trans-lation is far more powerful than the service concerned in the other case
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
AbstractWe consider a class of programs whose output is a sequence of elementary actions or moves. F...
We position Turing's result regarding the undecidability of the halting problem as a result about pr...
We study sequential programs that are instruction sequences with dynamically instantiated instructio...
We study sequential programs that are instruction sequences with direct and indirect jump instructio...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
We study sequential programs that are instruction sequences with jump-shift instructions in the sett...
AbstractWe study sequential programs that are instruction sequences with jump-shift instructions in ...
Earlier work on program and thread algebra detailed the functional, observable behavior of programs ...
Abstract. Single-pass instruction sequences under execution are con-sidered to produce behaviours to...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
In a previous paper, we presented several extensions of ACP with conditional expressions, including ...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
The behaviour produced by an instruction sequence under execution is a behaviour to be controlled by...
Instruction sequences with direct and indirect jump instructions are as expressive as instruction se...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
AbstractWe consider a class of programs whose output is a sequence of elementary actions or moves. F...
We position Turing's result regarding the undecidability of the halting problem as a result about pr...
We study sequential programs that are instruction sequences with dynamically instantiated instructio...
We study sequential programs that are instruction sequences with direct and indirect jump instructio...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
We study sequential programs that are instruction sequences with jump-shift instructions in the sett...
AbstractWe study sequential programs that are instruction sequences with jump-shift instructions in ...
Earlier work on program and thread algebra detailed the functional, observable behavior of programs ...
Abstract. Single-pass instruction sequences under execution are con-sidered to produce behaviours to...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
In a previous paper, we presented several extensions of ACP with conditional expressions, including ...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
The behaviour produced by an instruction sequence under execution is a behaviour to be controlled by...
Instruction sequences with direct and indirect jump instructions are as expressive as instruction se...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
AbstractWe consider a class of programs whose output is a sequence of elementary actions or moves. F...
We position Turing's result regarding the undecidability of the halting problem as a result about pr...