A Basis for Verifying Multi-threaded Programs
From MaRDI portal
Recommendations
Cited in
(20)- Unifying separation logic and region logic to allow interoperability
- Stepwise refinement of heap-manipulating code in Chalice
- On the relation between concurrent separation logic and concurrent Kleene algebra
- scientific article; zbMATH DE number 1701757 (Why is no real title available?)
- Automatic inference of access permissions
- Temporary read-only permissions for separation logic
- The relationship between separation logic and implicit dynamic frames
- Enforcing structural invariants using dynamic frames
- Effect-polymorphic behaviour inference for deadlock checking
- Checking a Multithreaded Algorithm with + CAL
- Verifying a Compiler for Java Threads
- scientific article; zbMATH DE number 2087551 (Why is no real title available?)
- Concise read-only specifications for better synthesis of programs with pointers
- A first-order logic with frames
- Concurrent Robin Hood hashing
- The dynamic frames theory
- Derivable partial locking for algebraic data types
- Modular verification of multithreaded programs
- Product programs in the wild: retrofitting program verifiers to check information flow security
- Ghost signals: verifying termination of busy waiting
This page was built for publication: A Basis for Verifying Multi-threaded Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617715)