Communications of the ACM
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The equational theory of pomsets
Theoretical Computer Science
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
An axiomatic basis for computer programming
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Local Reasoning about Programs that Alter Data Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Graphical models of separation logic
Information Processing Letters
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Concurrent abstract predicates
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
On locality and the exchange law for concurrent processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
SAGE: Whitebox Fuzzing for Security Testing
Queue - Networks
Generic models of the laws of programming
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
We survey the well-known algebraic laws of sequential programming, and propose some less familiar laws for concurrent programming. On the basis of these laws, we derive the rules of a number of classical programming and process calculi, for example, those due to Hoare, Milner, and Kahn. The algebra is simpler than each of the calculi derived from it, and stronger than all the calculi put together. We end with a section describing the role of unification in Science and Engineering.