Analyzing Asynchronous Programs with Preemption

DOI10.4230/LIPIcs.FSTTCS.2008.1739zbMath1248.68348OpenAlexW1590145945MaRDI QIDQ3165945

Ahmed Bouajjani, Tayssir Touili, Mohamed Faouzi Atig

Publication date: 19 October 2012

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

zbMATH Keywords

program verificationverification algorithmsmultiset pushdown systemsmultithreaded asynchronous programs

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)

Related Items (4)

Unnamed Item ⋮ Analyzing Real-Time Event-Driven Programs ⋮ On the Complexity of Bounded Context Switching. ⋮ Verification of Asynchronous Programs with Nested Locks

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