Safety and Liveness in Concurrent Pointer Programs
From MaRDI portal
Publication:3591397
Recommendations
Cited in
(16)- scientific article; zbMATH DE number 1948389 (Why is no real title available?)
- Verify heaps via unified model checking
- Safety-liveness exclusion in distributed computing
- Pointer race freedom
- Using integer programming to verify general safety and liveness properties
- Modular Safety Checking for Fine-Grained Concurrency
- Using unified model checking to verify heaps
- Verifying safety properties of concurrent Java programs using 3-valued logic
- Safety assurance via on-line monitoring
- scientific article; zbMATH DE number 1617320 (Why is no real title available?)
- scientific article; zbMATH DE number 1973975 (Why is no real title available?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- A relational shape abstract domain
- Automatically verifying concurrent queue algorithms
- Verification of higher-order concurrent programs with dynamic resource creation
This page was built for publication: Safety and Liveness in Concurrent Pointer Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591397)