Verifying a concurrent garbage collector using a rely-guarantee methodology
From MaRDI portal
Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Recommendations
Cites work
- A calculus of atomic actions
- A certified framework for compiling and executing garbage-collected languages
- A Marriage of Rely/Guarantee and Separation Logic
- Automated verification of practical garbage collectors
- Concurrent separation logic and operational semantics
- scientific article; zbMATH DE number 1956564 (Why is no real title available?)
- On-the-fly garbage collection
- Tentative steps toward a development method for interfering programs
- Verifying a concurrent garbage collector using a rely-guarantee methodology
Cited in
(9)- Verifying a concurrent garbage collector using a rely-guarantee methodology
- Verifying a concurrent garbage collector with a rely-guarantee methodology
- Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example
- scientific article; zbMATH DE number 1670550 (Why is no real title available?)
- A rely-guarantee-based simulation for verifying concurrent program transformations
- Formal derivation of concurrent garbage collectors
- A verified generational garbage collector for CakeML
- A verified generational garbage collector for CakeML
- A mechanically verified garbage collector for OCaml
This page was built for publication: Verifying a concurrent garbage collector using a rely-guarantee methodology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687774)