Execution architectures for program algebra

DOI10.1016/J.JAL.2005.10.013zbMATH Open1116.68024OpenAlexW1965715676MaRDI QIDQ881834FDOQ881834

J. A. Bergstra, Alban Ponse

Publication date: 18 May 2007

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2005.10.013

zbMATH Keywords

Turing machineprogram algebrahalting problemexecution of programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Process algebra for synchronous communication
• A propositional logic with 4 values: true, false, divergent and meaningless
• Processes and the denotational semantics of concurrency
• Program algebra for sequential code
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Combining programs and state machines
• New Computational Paradigms
• Register-machine based processes
• Bochvar-McCarthy logic and process algebra
• Non-regular iterators in process algebra

Cited In (7)

• On the expressiveness of single-pass instruction sequences
• Decision problems for pushdown threads
• Instruction sequence processing operators
• Machine structure oriented control code logic
• Title not available (Why is that?)
• Thread algebra for poly-threading
• Title not available (Why is that?)

This page was built for publication: Execution architectures for program algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881834)