Global renaming operators in concrete process algebra
Information and Computation
Handbook of theoretical computer science (vol. B)
A Theory of Computer Instructions
Journal of the ACM (JACM)
Introduction to Process Algebra
Introduction to Process Algebra
A theory of computer instructions
Science of Computer Programming
Thread Algebra with Multi-Level Strategies
Fundamenta Informaticae
A Thread Algebra with Multi-Level Strategic Interleaving
Theory of Computing Systems
Thread algebra for strategic interleaving
Formal Aspects of Computing
Distributed strategic interleaving with load balancing
Future Generation Computer Systems
Maurer computers for pipelined instruction processing†
Mathematical Structures in Computer Science
Polarized process algebra and program equivalence
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An introduction to program and thread algebra
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Hi-index | 0.00 |
We study sequential programs that are instruction sequences with dynamically instantiated instructions. We define the meaning of such programs in two different ways. In either case, we give a translation by which each program with dynamically instantiated instructions is turned into a program without them that exhibits on execution the same behaviour by interaction with some service. The complexity of the translations differ considerably, whereas the services concerned are equally simple. However, the service concerned in the case of the simpler translation is far more powerful than the service concerned in the other case.