Non-deterministic data types: models and implementations
Acta Informatica
Software Engineering Journal - Special issue on Mascot 3
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Monitors: an operating system structuring concept
Communications of the ACM
Synthesis and Implementation of a Signal-Type Asynchronous Data Communication Mechanism
ASYNC '01 Proceedings of the 7th International Symposium on Asynchronous Circuits and Systems
Analysis of the four-slot mechanism
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Metastability in Asynchronous Wait-Free Protocols
IEEE Transactions on Computers
Theoretical Computer Science
Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Journal of Parallel and Distributed Computing
An Approach to Splitting Atoms Safely
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper critiques and extends Lamport's taxonomy of asynchronous registers, [8], [9]. This extended taxonomy is used to characterise Simpson's 4-slot asynchronous communication mechanism (ACM), [15], [16], [17], [18], [19]. A formalisation of the Lamport atomic property and Simpson's original 4-slot implementation is given in the PVS logic [12]. We prove that the 4-slot is atomic using Nipkow's retrieve relation proof rules, [10], [11], [7]. A description is given of the formal proofs, which have been discharged in the PVS theorem prover [13].