On the expressiveness of single-pass instruction sequences
From MaRDI portal
Publication:692925
DOI10.1007/s00224-010-9301-8zbMath1278.68032MaRDI QIDQ692925
C. A. Middelburg, Jan A. Bergstra
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9301-8
68Q65: Abstract data types; algebraic specification
68M07: Mathematical problems of computer architecture
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Describing data flow analysis techniques with Kleene algebra
- Execution architectures for program algebra
- Program algebra with a jump-shift instruction
- A completeness theorem for Kleene algebras and the algebra of regular events
- Program algebra for sequential code
- Synchronous cooperation for explicit multi-threading
- Transmission Protocols for Instruction Streams
- Instruction Sequences with Dynamically Instantiated Instructions
- Maurer computers for pipelined instruction processing
- Two Complete Axiom Systems for the Algebra of Regular Events
- On Hoare logic and Kleene algebra with tests
- Logical Approaches to Computational Barriers