Reasoning about Threads with Bounded Lock Chains
From MaRDI portal
Publication:3090848
DOI10.1007/978-3-642-23217-6_30zbMath1343.68154OpenAlexW2178845291MaRDI QIDQ3090848
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- A generic approach to the static analysis of concurrent programs with procedures
- On the analysis of interacting pushdown systems
- Interprocedural analysis of asynchronous programs
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- Verifying Parallel Programs with Dynamic Communication Structures
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Computer Aided Verification
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Reasoning about Threads with Bounded Lock Chains