Deciding branching time properties for asynchronous programs

DOI10.1016/J.TCS.2009.01.021zbMATH Open1187.68313OpenAlexW2166873473MaRDI QIDQ732003FDOQ732003

Authors: Rohit Chadha, Mahesh Viswanathan 

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.021

Recommendations

• Verifying liveness for asynchronous programs
• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• Verification of asynchronous programs with nested locks
• Analyzing Asynchronous Programs with Preemption
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods

zbMATH Keywords

model checkingwell-structured transition systemsasynchronous programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Algorithmic analysis of programs with well quasi-ordered domains.
• Well-structured transition systems everywhere!
• The theory of well-quasi-ordering: a frequently discovered concept
• Context-Bounded Analysis of Concurrent Queue Systems
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Reduction and synthesis of live and bounded free choice Petri nets
• Interprocedural analysis of asynchronous programs
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

Cited In (4)

• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• Branch-well-structured transition systems and extensions
• Verifying liveness for asynchronous programs
• Well structured transition systems with history

This page was built for publication: Deciding branching time properties for asynchronous programs

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