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...
Main Authors: | Alglave, J, Kroening, D, Tautschnig, M |
---|---|
Andre forfattere: | Sharygina, N |
Format: | Conference item |
Udgivet: |
Springer
2013
|
Lignende værker
-
Making Software Verification Tools Really Work
af: Alglave, J, et al.
Udgivet: (2011) -
Software Verification for Weak Memory via Program Transformation
af: Alglave, J, et al.
Udgivet: (2013) -
Software verification for weak memory via program transformation
af: Alglave, J, et al.
Udgivet: (2013) -
Static Analysis to Enhance the Power of Model Checking for Concurrent Software
af: Clarke, E, et al.
Udgivet: (2007) -
Incremental bounded model checking for embedded software
af: Schrammel, P, et al.
Udgivet: (2017)