Formalizing and Checking Thread Refinement for Data-Race-Free Execution Models
When optimizing a thread in a concurrent program (either done manually or by the compiler), it must be guaranteed that the resulting thread is a refinement of the original thread. Most definitions of refinement are formulated in terms of valid syntactic transformations on the program code, or in ter...
Main Authors: | Kroening, D, Poetzl, D |
---|---|
Format: | Conference item |
Published: |
Springer Verlag
2016
|
Similar Items
-
Formalizing and checking thread refinement for data-race-free execution models
by: Poetzl, D, et al.
Published: (2016) -
Approximation Refinement for Interpolation−Based Model Checking
by: D'Silva, V, et al.
Published: (2008) -
Approximation Refinement for Interpolation−Based Model Checking
by: D'Silva, V, et al.
Published: (2008) -
Race analysis for systemC using model checking
by: Blanc, N, et al.
Published: (2010) -
Automatic analysis of DMA races using model checking and k-induction.
by: Donaldson, A, et al.
Published: (2011)