Affordable Access

Publisher Website

Program algebra with a jump-shift instruction

Authors
Journal
Journal of Applied Logic
1570-8683
Publisher
Elsevier
Publication Date
Volume
6
Issue
4
Identifiers
DOI: 10.1016/j.jal.2008.07.001
Keywords
  • Program Algebra
  • Jump-Shift Instruction
  • Thread Algebra
  • Thread Extraction
  • Execution Mechanism
Disciplines
  • Computer Science

Abstract

Abstract We study sequential programs that are instruction sequences with jump-shift instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions preceding a jump instruction increase the position to jump to. The jump-shift instruction is not found in programming practice. Its merit is that the expressive power of PGA extended with the jump-shift instruction, is not reduced if the reach of jump instructions is bounded. This is used to show that there exists a finite-state execution mechanism that by making use of a counter can produce each finite-state thread from some program that is a finite or periodic infinite sequence of instructions from a finite set.

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