Safety and Liveness in Concurrent Pointer Programs

DOI10.1007/11804192_14MaRDI QIDQ3591397zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Modular Safety Checking for Fine-Grained Concurrency
• An integrated specification and verification technique for highly concurrent data structures
• scientific article; zbMATH DE number 1948389
• Fragment abstraction for concurrent shape analysis
• scientific article; zbMATH DE number 1487480

Cited in

(18)

• Using integer programming to verify general safety and liveness properties
• Verify heaps via unified model checking
• A relational shape abstract domain
• scientific article; zbMATH DE number 1617320 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1948389 (Why is no real title available?)
• scientific article; zbMATH DE number 1973975 (Why is no real title available?)
• scientific article; zbMATH DE number 1487480 (Why is no real title available?)
• Safety assurance via on-line monitoring
• Verifying safety properties of concurrent Java programs using 3-valued logic
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• 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)