Deciding branching time properties for asynchronous programs

DOI10.1016/J.TCS.2009.01.021MaRDI QIDQ732003zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)