Analyzing Asynchronous Programs with Preemption

DOI10.4230/LIPICS.FSTTCS.2008.1739MaRDI QIDQ3165945zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili

Publication date 19 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_e2e7.html

zbMATH Keywords

multiset pushdown systemsmultithreaded asynchronous programsprogram verificationverification algorithms

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Interprocedural analysis of asynchronous programs
• Analysis of asynchronous programs with event-based synchronization
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Analysis of an asynchronous PRAM algorithm
• scientific article; zbMATH DE number 1834570
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Program analysis to support concurrent programming in declarative languages
• Verification of asynchronous programs with nested locks

Cited in

(5)

• Analyzing Real-Time Event-Driven Programs
• Verification of timed asynchronous programs
• On the Complexity of Bounded Context Switching.
• Verification of asynchronous programs with nested locks
• Deciding branching time properties for asynchronous programs

This page was built for publication: Analyzing Asynchronous Programs with Preemption

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