Verification of Asynchronous Programs with Nested Locks

DOI10.4230/LIPIcs.FSTTCS.2017.11zbMath1491.68105OpenAlexW2788878077MaRDI QIDQ5136300

Ahmed Bouajjani, Prakash Saivasan, K. K. Narayan, Mohamed Faouzi Atig

Publication date: 25 November 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8410/pdf/LIPIcs-FSTTCS-2017-11.pdf/

zbMATH Keywords

reachability problemasynchronous programsnested locks

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Unnamed Item

Uses Software

• Program-Conflict-Analysis

Cites Work

• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Analyzing Asynchronous Programs with Preemption
• Interprocedural analysis of asynchronous programs
• Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
• Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
• Analyzing Real-Time Event-Driven Programs
• Delay-bounded scheduling
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Verification of Asynchronous Programs with Nested Locks