Partial orders for efficient bounded model checking of concurrent software

The number of interleavings of a concurrent program makes automatic analysis of such software very hard. Modern multiprocessors’ execution models make this problem even harder. Modelling program executions with partial orders rather than interleavings addresses both issues: we obtain an efficient en...

Полное описание

Библиографические подробности
Главные авторы: Alglave, J, Kroening, D, Tautschnig, M
Другие авторы: Sharygina, N
Формат: Conference item
Опубликовано: Springer 2013