Formal verification of concurrent programs with Read-write locks
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Recommendations
Cites work
- A Marriage of Rely/Guarantee and Separation Logic
- A semantics for concurrent separation logic
- A syntactic approach to type soundness
- BI as an assertion language for mutable data structures
- Modular verification of concurrent assembly code with dynamic thread creation and termination
- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
- Permission accounting in separation logic
- Resources, concurrency, and local reasoning
- Tentative steps toward a development method for interfering programs
- Verification of safety properties for concurrent assembly code
- Verifying properties of parallel programs
Cited in
(5)
This page was built for publication: Formal verification of concurrent programs with Read-write locks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351980)