Thread algebra for strategic interleaving

DOI10.1007/s00165-007-0024-9zbMath1131.68067MaRDI QIDQ2461536

C. A. Middelburg, Jan A. Bergstra

Publication date: 28 November 2007

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-007-0024-9

zbMATH Keywords

Services; Threads; Deadlock freedom; Interleaving strategies; Multi-threading; Thread algebra

Mathematics Subject Classification ID

68N15: Theory of programming languages

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Maurer computers for pipelined instruction processing, Program algebra with a jump-shift instruction, A thread calculus with molecular dynamics, Synchronous cooperation for explicit multi-threading, Polarized process algebra with reactive composition, Thread algebra for noninterference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision problems for pushdown threads
• A calculus of communicating systems
• An alternative formulation of operational conservativity with binding terms.
• Program algebra for sequential code
• Combining programs and state machines
• Simulating Turing machines on Maurer machines
• Notions of bisimulation and congruence formats for SOS with data
• A theory of computer instructions
• Polarized process algebra with reactive composition
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• A Theory of Computer Instructions
• New Computational Paradigms