On the expressiveness of single-pass instruction sequences
From MaRDI portal
(Redirected from Publication:692925)
Recommendations
- Quantitative expressiveness of instruction sequence classes for computation on single bit registers
- Program algebra with a jump-shift instruction
- On the contribution of backward jumps to instruction sequence expressiveness
- Axioms for behavioural congruence of single-pass instruction sequences
- A short introduction to program algebra with instructions for Boolean registers
Cites work
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- Describing data flow analysis techniques with Kleene algebra
- Execution architectures for program algebra
- Instruction sequences with dynamically instantiated instructions
- Instruction sequences with indirect jumps
- Logical Approaches to Computational Barriers
- Maurer computers for pipelined instruction processing
- On Hoare logic and Kleene algebra with tests
- Program algebra for sequential code
- Program algebra with a jump-shift instruction
- Synchronous cooperation for explicit multi-threading
- Transmission Protocols for Instruction Streams
- Two Complete Axiom Systems for the Algebra of Regular Events
Cited in
(7)- Quantitative expressiveness of instruction sequence classes for computation on single bit registers
- On the contribution of backward jumps to instruction sequence expressiveness
- Axioms for behavioural congruence of single-pass instruction sequences
- Instruction sequence processing operators
- On the behaviours produced by instruction sequences under execution
- Thread extraction for polyadic instruction sequences
- Transmission Protocols for Instruction Streams
This page was built for publication: On the expressiveness of single-pass instruction sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692925)
