On the expressiveness of single-pass instruction sequences

Details On the expressiveness of single-pass instruction sequences On the expressiveness of single-pass instruction sequences

2008-10-07

arxiv.org/abs/0810.1106v3

Theory of Computing Systems, 50(2):313--328, 2012

Computer Science

Programming Languages

14 pages; error corrected, acknowledgement added; another error corrected, another acknowledgement added

Scientific paper

10.1007/s00224-010-9301-8

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.

Affiliated with

Also associated with

No associations

Rating

On the expressiveness of single-pass instruction sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the expressiveness of single-pass instruction sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the expressiveness of single-pass instruction sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556817