We introduce an algebra of instruction sequences by presenting a semigroup C in which programs can be represented without directional bias: in terms of the next instruction to be executed, C has both forward and backward instructions and a C-expression can be interpreted starting from any instruction. We provide equations for thread extraction, i.e., C's program semantics. Then we consider thread extraction compatible (anti-)homomorphisms and (anti-)automorphisms. Finally we discuss some expressiveness results
We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under ...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
We introduce an algebra of instruction sequences by presenting a semigroup C in which programs can b...
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequ...
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes ...
Abstract. Instruction sequences are often fragmented. An important reason for instruction sequence f...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
Abstract. We perceive programs as single-pass instruction sequences. A single-pass instruction seque...
Abstract. Single-pass instruction sequences under execution are con-sidered to produce behaviours to...
We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under ...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
We introduce an algebra of instruction sequences by presenting a semigroup C in which programs can b...
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequ...
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes ...
Abstract. Instruction sequences are often fragmented. An important reason for instruction sequence f...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
In this paper, we study the phenomenon that instruction sequences are split into fragments which som...
Abstract. We perceive programs as single-pass instruction sequences. A single-pass instruction seque...
Abstract. Single-pass instruction sequences under execution are con-sidered to produce behaviours to...
We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under ...
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on i...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...