A framework for formally verifying software transactional memory algorithms
From MaRDI portal
Publication:2912700
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(10)- Towards formally specifying and verifying transactional memory
- Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata
- Mechanical Verification of Transactional Memories with Non-transactional Memory Accesses
- Proving Isolation Properties for Software Transactional Memory
- scientific article; zbMATH DE number 7577571 (Why is no real title available?)
- Formal verification of a C-like memory model and its uses for verifying program transformations
- Checking opacity and durable opacity with FDR
- An analytic framework for performance modeling of software transactional memory
- Mechanized proofs of opacity: a comparison of two techniques
- Model checking transactional memories
This page was built for publication: A framework for formally verifying software transactional memory algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912700)