Verification of timed asynchronous programs

DOI10.4230/LIPICS.FSTTCS.2018.8MaRDI QIDQ5090941FDOQ5090941

Authors Mohamed Faouzi Atig, Shankara Narayanan Krishna, S. Vaidya, Parosh A. Abdulla 

Publication date 21 July 2022

zbMATH Keywords

reachabilitytimed automataasynchronous programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Recommendations

• Verification of asynchronous programs with nested locks
• scientific article; zbMATH DE number 2080041
• scientific article; zbMATH DE number 1955911
• Deciding branching time properties for asynchronous programs
• General decidability results for asynchronous shared-memory programs: higher-order and beyond

Cites work

• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A perfect model for bounded verification
• A theory of timed automata
• Analyzing Asynchronous Programs with Preemption
• Analyzing Real-Time Event-Driven Programs
• Applications and Theory of Petri Nets 2005
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• Delay-bounded scheduling
• Interprocedural analysis of asynchronous programs
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Ordering by Divisibility in Abstract Algebras
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• The theory of well-quasi-ordering: a frequently discovered concept
• Verification of asynchronous programs with nested locks

Cited in

(1)

• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond

This page was built for publication: Verification of timed asynchronous programs

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