Safety and Liveness in Concurrent Pointer Programs
From MaRDI portal
Recommendations
- Modular Safety Checking for Fine-Grained Concurrency
- An integrated specification and verification technique for highly concurrent data structures
- Automated verification of concurrent linked lists with counters
- Fragment abstraction for concurrent shape analysis
- Automatic verification of pointer data-structure systems for all numbers of processes
Cited in
(18)- Using integer programming to verify general safety and liveness properties
- Verify heaps via unified model checking
- A relational shape abstract domain
- Checking cleanness in linked lists
- Pointer race freedom
- Safety-liveness exclusion in distributed computing
- Automatically verifying concurrent queue algorithms
- Using unified model checking to verify heaps
- Verification of higher-order concurrent programs with dynamic resource creation
- Modular Safety Checking for Fine-Grained Concurrency
- Automated verification of concurrent linked lists with counters
- Symmetric symbolic safety-analysis of concurrent software with pointer data structures
- Automatic verification of pointer data-structure systems for all numbers of processes
- Safety assurance via on-line monitoring
- Verifying safety properties of concurrent Java programs using 3-valued logic
- Who is pointing when to whom? On the automated verification of linked list structures
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Practical abstractions for automated verification of shared-memory concurrency
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)
