Execution architectures for program algebra

DOI10.1016/j.jal.2005.10.013zbMath1116.68024MaRDI QIDQ881834

Jan 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 machine; halting problem; program algebra; execution of programs

Mathematics Subject Classification ID

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

Related Items

Thread algebra for poly-threading, On the expressiveness of single-pass instruction sequences, Instruction sequence processing operators, Machine structure oriented control code logic, Decision problems for pushdown threads

Cites Work

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