Asynchronous programs with prioritized task-buffers

Abstract

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.

BibTeX

@inproceedings{Emmi-al:FSE12,
  author    = {Michael Emmi and
               Akash Lal and
               Shaz Qadeer},
  title     = {Asynchronous programs with prioritized task-buffers},
  booktitle = {FSE},
  pages     = {48},
  publisher = {{ACM}},
  year      = {2012},
}

Asynchronous programs with prioritized task-buffers

Abstract

Related papers