Communicating sequential processes
Communicating sequential processes
Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Modeling concurrency with partial orders
International Journal of Parallel Programming
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
On the semantics of concurrency: partial orders and transition systems
The International Joint Conference on theory and practice of software development on TAPSOFT '87
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)
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
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
Partial orders and the axiomatic theory of shuffle (pomsets)
Partial orders and the axiomatic theory of shuffle (pomsets)
ACM Transactions on Computational Logic (TOCL)
Resources, concurrency, and local reasoning
Theoretical Computer Science
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Foundations of Concurrent Kleene Algebra
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Towards an algebra of routing tables
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
On probabilistic kleene algebras, automata and simulations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Algebra of monotonic boolean transformers
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Algebra, logic, locality, concurrency
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Algebra, logic, locality, concurrency
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Operational semantics for SPARQL update
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
The laws of programming unify process calculi
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
The type discipline of behavioral separation
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange law. We show applicability of the algebra to a partially-ordered trace model of program execution semantics and demonstrate its usefulness by validating familiar proof rules for sequential programs (Hoare triples) and for concurrent ones (Jones's rely/guarantee calculus). This involves an algebraic notion of invariants; for these the exchange inequation strengthens to an equational distributivity law. Most of our reasoning has been checked by computer.