Model Checking Multithreaded Programs with Asynchronous Atomic Methods
From MaRDI portal
Publication:5756745
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 7561313 (Why is no real title available?)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- Realizability of Concurrent Recursive Programs
- On functions weakly computable by pushdown Petri nets and related systems
- Deciding branching time properties for asynchronous programs
- Verification of asynchronous programs with nested locks
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Analyzing Real-Time Event-Driven Programs
- Multiparty half-duplex systems and synchronous communications
- Budget-bounded model-checking pushdown systems
- Some complexity results for stateful network verification
- Context-Bounded Analysis of Concurrent Queue Systems
- Towards generalised half-duplex systems
- Data flow analysis of asynchronous systems using infinite abstract domains
- Analyzing pushdown systems with stack manipulation
- Reasoning about threads with bounded lock chains
This page was built for publication: Model Checking Multithreaded Programs with Asynchronous Atomic Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756745)