Partial Orders for Efficient Bounded Model Checking of Concurrent Software

Abstract

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 encoding into integer difference logic for bounded model… (More)
DOI: 10.1007/978-3-642-39799-8_9

Topics

3 Figures and Tables

Statistics

0102030201320142015201620172018
Citations per Year

106 Citations

Semantic Scholar estimates that this publication has 106 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics