Reasoning about threads with bounded lock chains

DOI10.1007/978-3-642-23217-6_30MaRDI QIDQ3090848zbMATH OpenOpenAlexFDO

Authors Vineet Kahlon

Publication date 2 September 2011

Published in CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23217-6_30

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Computer Aided Verification
• scientific article; zbMATH DE number 5954655
• Tools and Algorithms for the Construction and Analysis of Systems
• Model checking concurrent programs
• Causality-based verification of multi-threaded programs

Cites work

• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• A generic approach to the static analysis of concurrent programs with procedures
• Computer Aided Verification
• Computer Aided Verification
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Interprocedural analysis of asynchronous programs
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• On the analysis of interacting pushdown systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Verifying Parallel Programs with Dynamic Communication Structures

Cited in

(3)

• Bounded context-switching and reentrant locking
• Model checking concurrent programs
• Computer Aided Verification

This page was built for publication: Reasoning about threads with bounded lock chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090848)