scientific article; zbMATH DE number 1552508
From MaRDI portal
Publication:4524764
Cited in
(22)- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Cogent: uniqueness types and certifying compilation
- Proving linearizability with temporal logic
- Completeness of fair ASM refinement
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages
- Formal verification of a lock-free stack with hazard pointers
- scientific article; zbMATH DE number 4074539 (Why is no real title available?)
- Compositional reasoning using intervals and time reversal
- Model checking simulation rules for linearizability
- scientific article; zbMATH DE number 827984 (Why is no real title available?)
- Automated flaw detection in algebraic specifications
- KIV
- Relational concurrent refinement. II: Internal operations and outputs
- A sound and complete proof technique for linearizability of concurrent data structures
- A framework for correctness criteria on weak memory models
- A Compiled Implementation of Normalization by Evaluation
- Atomic actions, and their refinements to isolated protocols
- A verified implementation of \(\mathrm{B}^+\)-trees in Isabelle/HOL
- Verifying opacity of a transactional mutex lock
- Completeness of ASM refinement
- Verification of concurrent systems with VerCors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524764)
