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...
Príomhchruthaitheoirí: | Alglave, J, Kroening, D, Tautschnig, M |
---|---|
Rannpháirtithe: | Sharygina, N |
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
Springer
2013
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Making Software Verification Tools Really Work
de réir: Alglave, J, et al.
Foilsithe / Cruthaithe: (2011) -
Software Verification for Weak Memory via Program Transformation
de réir: Alglave, J, et al.
Foilsithe / Cruthaithe: (2013) -
Software verification for weak memory via program transformation
de réir: Alglave, J, et al.
Foilsithe / Cruthaithe: (2013) -
Static Analysis to Enhance the Power of Model Checking for Concurrent Software
de réir: Clarke, E, et al.
Foilsithe / Cruthaithe: (2007) -
Incremental bounded model checking for embedded software
de réir: Schrammel, P, et al.
Foilsithe / Cruthaithe: (2017)