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

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

zbMATH Keywords

reachabilitytimed automataasynchronous programs

Mathematics Subject Classification ID

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

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• The theory of well-quasi-ordering: a frequently discovered concept
• Ordering by Divisibility in Abstract Algebras
• Delay-bounded scheduling
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• A perfect model for bounded verification
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• Interprocedural analysis of asynchronous programs
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• Analyzing Real-Time Event-Driven Programs
• Applications and Theory of Petri Nets 2005
• Analyzing Asynchronous Programs with Preemption
• 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)