Sciweavers

118 search results - page 8 / 24
» Word-Level Sequential Memory Abstraction for Model Checking
Sort
View
TACAS
2009
Springer
132views Algorithms» more  TACAS 2009»
15 years 6 months ago
Transition-Based Directed Model Checking
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by inļ¬...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
CAV
2004
Springer
154views Hardware» more  CAV 2004»
15 years 3 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...
ESOP
2011
Springer
14 years 3 months ago
Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs
We present a static analysis by Abstract Interpretation to check for run-time errors in parallel C programs. Following our work on Astr“ee, we focus on embedded critical programs ...
Antoine Miné
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
15 years 5 months ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
PLDI
2012
ACM
13 years 2 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa