Simulating Turing machines on Maurer machines

Bergstra, Jan A.; Middelburg, Cornelis A.

doi:10.1016/j.jal.2007.04.001

Cited by 6 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [BM05b,BM06c], we extend the theory developed in this paper with features to cover systems that consist of several multi-threaded programs on various hosts in different networks. Our work on a formal approach to design new micro-architectures, see [BM07a,BM05a,BM06a,BM06b], is a notable application of thread algebra. The approach is based on Maurer's model for computers [Mau66,Mau06], thread algebra and program algebra [BL02].…”

Section: Discussionmentioning

confidence: 99%

Thread algebra for strategic interleaving

2007

View full text Add to dashboard Cite

Abstract. We take a thread as the behavior of a sequential deterministic program under execution and multi-threading as the form of concurrency provided by contemporary programming languages such as Java and C#. We outline an algebraic theory about threads and multi-threading. In the case of multi-threading, some deterministic interleaving strategy determines how threads are interleaved. Interleaving operators for a number of plausible interleaving strategies are specified in a simple and concise way. By that, we show that it is essentially open-ended what counts as an interleaving strategy. We use deadlock freedom as an example to show that there are properties of multi-threaded programs that depend on the interleaving strategy used.

show abstract

Section: Discussionmentioning

confidence: 99%

Thread algebra for strategic interleaving

2007

View full text Add to dashboard Cite

show abstract

“…In this paper, we have carried on the line of research that has already resulted in [8][9][10]. We pursue with this line of research the object to develop an approach to design new micro-architectures that allows for their correctness and anticipated speed-up results to be verified.…”

Section: Discussionmentioning

confidence: 99%

“…In [8][9][10], the interface of a Maurer machine did not include an atomic action concurrency relation. Its inclusion is needed to be able to determine the correctness of any program parallelization statically.…”

Section: The Members Of a Are Called The Atomic Actions Of H And [[mentioning

confidence: 99%

“…We regard the work presented in this paper, like the preceding work presented in [8][9][10], as a preparatory step in developing, as part of a project investigating micro-threading [16,21], a formal approach to design new micro-architectures. That approach should allow for the correctness of new micro-architectures and their anticipated speed-up results to be verified.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synchronous cooperation for explicit multi-threading

Bergstra

Middelburg

2007

Acta Informatica

View full text Add to dashboard Cite

We develop an algebraic theory of threads, synchronous cooperation of threads and interaction of threads with Maurer machines, and investigate program parallelization using the resulting theory. Program parallelization underlies techniques for speeding up instruction processing on a computer that make use of the abilities of the computer to process instructions simultaneously in cases where the state changes involved do no influence each other. One of our findings is that a strong induction principle is needed when proving theorems about sufficient conditions for the correctness of program parallelizations. The induction principle introduced has brought us to construct a projective limit model for the theory developed.

show abstract

“…that there will always come a next turn for all active threads, multi-threads, etc. For the single-level case, a mathematically precise definition of a fair interleaving strategy is given in [8].…”

Section: ( (Nv))mentioning

confidence: 99%

A Thread Algebra with Multi-Level Strategic Interleaving

Bergstra

Middelburg

2007

Theory Comput Syst

Self Cite

View full text Add to dashboard Cite

Abstract. In a previous paper we developed an algebraic theory about threads and a form of concurrency where some deterministic interleaving strategy determines how threads that exist concurrently are interleaved. The interleaving of different threads constitutes a multi-thread. Several multi-threads may exist concurrently on a single host in a network, several host behaviours may exist concurrently in a single network on the internet, etc. In the current paper we assume that the abovementioned kind of interleaving is also present at those other levels. We extend the theory developed so far with features to cover the multi-level case. We employ the resulting theory to develop a simplified, formal representation schema of the design of systems that consist of several multi-threaded programs on various hosts in different networks and to verify a property of all systems designed according to that schema.

show abstract

Simulating Turing machines on Maurer machines

Cited by 6 publications

References 22 publications

Thread algebra for strategic interleaving

Thread algebra for strategic interleaving

Synchronous cooperation for explicit multi-threading

A Thread Algebra with Multi-Level Strategic Interleaving

Contact Info

Product

Resources

About