Safety and Liveness in Concurrent Pointer Programs
DOI10.1007/11804192_14zbMATH Open1196.68045OpenAlexW2153489883MaRDI QIDQ3591397FDOQ3591397
Authors: Dino Distefano, Arend Rensink, Joost-Pieter Katoen 
Publication date: 11 September 2007
Published in: Formal Methods for Components and Objects (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11804192_14
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (16)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- A relational shape abstract domain
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Automatically verifying concurrent queue algorithms
- Verification of higher-order concurrent programs with dynamic resource creation
- Title not available (Why is that?)
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)
