Programming from specifications
Programming from specifications
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
ACM Transactions on Computational Logic (TOCL)
Resources, concurrency, and local reasoning
Theoretical Computer Science
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
FM'06 Proceedings of the 14th international conference on Formal Methods
Hi-index | 0.00 |
A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent execution [10]. In this paper we investigate the abstract background of this law in terms of independence relations on which a concrete trace model of the algebra is based. Moreover, we show the interdependence of the basic properties of such relations and two further laws that are essential in the application of the algebra to a Jones style rely/guarantee calculus. Finally we reconstruct the trace model in a more abstract setting based on the notion of atoms from lattice theory.