118 search results - page 4 / 24 » Word-Level Sequential Memory Abstraction for Model Checking |
134
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
107
Voted
ITA
2007
15 years 1 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
109
Voted
ISQED
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a method to abstract, formalize, and verify industrial flash memory implementations. Flash memories contain specialized transistors, e.g., floating gate and split gate d...
138
Voted
ESOP
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
112
Voted
ICFEM
2004
Springer
15 years 6 months ago
2004
Springer
Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking. In this context Boolean programs are commonly employed as si...