Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
The Java Language Specification
The Java Language Specification
An Event-Based Structural Operational Semantics of Multi-Threaded Java
Formal Syntax and Semantics of Java
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Refinement of Actions in Causality Based Models
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Configuration Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
The java memory model: operationally, denotationally, axiomatically
ESOP'07 Proceedings of the 16th European conference on Programming
| Hi-index | 0.00 |
A new framework for describing concurrent systems is presented. Rules for composing configurations of concurrent programs are represented by sequents 驴 驴驴 驴, where 驴 and 驴 are sequences of partially ordered sets (of events) and 驴 is a matrix of monotone maps from the components of 驴 to the components of 驴. Such a sequent expresses that whenever a configuration has certain specified subposets of events (驴), then it extends to a configuration containing one of several specified subposets (驴). The structural rules of Gentzen's sequent calculus are decorated by suitable operations on matrices, where cut corresponds to product. The calculus thus obtained is shown to be sound with respect to interpretation in configuration structures [GG90]. Completeness is proven for a restriction of the calculus to finite sequents. As a case study we axiomatise the Java memory model, and formally derive a nontrivial property of thread-memory interaction.