On the expressiveness of single-pass instruction sequences

DOI10.1007/S00224-010-9301-8zbMATH Open1278.68032OpenAlexW2124067458MaRDI QIDQ692925

Could not fetch data.

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

zbMATH Keywords

expressivenessjump-free instruction sequenceregular threadsingle-pass instruction sequence

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Mathematical problems of computer architecture (68M07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Related Items (1)

Instruction sequence processing operators

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)