OASIcs.ICCSW.2013.1.pdf
- Filesize: 354 kB
- 1 pages
The algebraic laws for programming with concurrency are as simple as (and very similar to) the familiar laws of arithmetic. Yet they are stronger for reasoning about the properties of programs than the axioms of Hoare Logic and the rules of an operational semantics put together.
Feedback for Dagstuhl Publishing