A steering fragment of an instruction sequence consists of a sequence of steering instructions. These are decision points involving the check of a propositional statement in sequential logic. The question is addressed why composed propositional statements occur in steering fragments given the fact that a straightforward transformation allows their elimination. A survey is provided of constraints that may be implicitly assumed when composed propositional statements occur in a meaningful instruction sequence
We study sequential programs that are instruction sequences with dynamically instantiated instructio...
Imperatives can be answers to questions. That creates a dilemma. It seems to force us to choose betw...
AbstractWe here extend our earlier work on the theory of computer instructions to consider instructi...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequ...
We present a formal system for proving the partial correctness of a single-pass instruction sequence...
Abstract. Instruction sequences are often fragmented. An important reason for instruction sequence f...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
In this thesis I will give a formal definition of side effects. I will do so by modifying a system f...
We study sequential programs that are instruction sequences with jump-shift instructions in the sett...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
AbstractWe study sequential programs that are instruction sequences with jump-shift instructions in ...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
We study sequential programs that are instruction sequences with dynamically instantiated instructio...
Imperatives can be answers to questions. That creates a dilemma. It seems to force us to choose betw...
AbstractWe here extend our earlier work on the theory of computer instructions to consider instructi...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequ...
We present a formal system for proving the partial correctness of a single-pass instruction sequence...
Abstract. Instruction sequences are often fragmented. An important reason for instruction sequence f...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
In this thesis I will give a formal definition of side effects. I will do so by modifying a system f...
We study sequential programs that are instruction sequences with jump-shift instructions in the sett...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
AbstractWe study sequential programs that are instruction sequences with jump-shift instructions in ...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
We study sequential programs that are instruction sequences with dynamically instantiated instructio...
Imperatives can be answers to questions. That creates a dilemma. It seems to force us to choose betw...
AbstractWe here extend our earlier work on the theory of computer instructions to consider instructi...