Asynchronous programs with prioritized task-buffers
Michael Emmi, Akash Lal, Shaz Qadeer · 2012
We consider the algorithmic analysis of asynchronous software systems as a means for building reliable software. A key challenge in designing such analyses is identifying a concurrency model which does not extraneously introduce behaviors infeasible in the actual system, does not extraneously exclude actual behaviors, and isolates the challenging features for analyses to focus on.