Computer viruses: theory and experiments
Computers and Security
A Theory of Computer Instructions
Journal of the ACM (JACM)
ACSAC '01 Proceedings of the 6th Australasian conference on Computer systems architecture
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Polarized process algebra and program equivalence
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A bypass of cohen's impossibility result
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Transmission Protocols for Instruction Streams
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Instruction Sequences with Dynamically Instantiated Instructions
Fundamenta Informaticae
On the Behaviours Produced by Instruction Sequences under Execution
Fundamenta Informaticae
Hi-index | 0.00 |
We provide an introduction to Program Algebra (PGA, an algebraic approach to the modeling of sequential programming) and to Thread Algebra (TA). PGA is used as a basis for several low- and higher-level programming languages. As an example we consider a simple language with goto's. Threads in TA model the execution of programs. Threads may be composed with services which model (part of) the execution environment, such as a stack. Finally, we discuss briefly the expressiveness of PGA and allude to current work on multithreading and security hazard risk assessment.