Affordable Access

Publisher Website

On the expressiveness of single-pass instruction sequences

Authors
Type
Published Article
Publication Date
Submission Date
Identifiers
DOI: 10.1007/s00224-010-9301-8
arXiv ID: 0810.1106
Source
arXiv
External links

Abstract

We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some execution environment. Threads as considered in basic thread algebra model such behaviours. We show that all regular threads, i.e. threads that can only be in a finite number of states, can be produced by single-pass instruction sequences without jump instructions if use can be made of Boolean registers. We also show that, in the case where goto instructions are used instead of jump instructions, a bound to the number of labels restricts the expressiveness.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments