Abstract
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. © Springer-Verlag Berlin Heildelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Ponse, A., & Van Der Zwaag, M. B. (2006). An introduction to program and thread algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3988 LNCS, pp. 445–458). Springer Verlag. https://doi.org/10.1007/11780342_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
