Sciweavers

CAV
2006
Springer
113views Hardware» more  CAV 2006»
13 years 8 months ago
Causal Atomicity
Atomicity-checking is a powerful approach for finding subtle concurrency errors in shared-memory multithreaded code. The goal is to verify that certain code sections appear to exec...
Azadeh Farzan, P. Madhusudan
CAV
2006
Springer
80views Hardware» more  CAV 2006»
13 years 8 months ago
Don't Care Words with an Application to the Automata-Based Approach for Real Addition
d Abstract) Jochen Eisinger1 and Felix Klaedtke2 1 Albert-Ludwigs-Universit
Jochen Eisinger, Felix Klaedtke
CAV
2006
Springer
101views Hardware» more  CAV 2006»
13 years 8 months ago
A Fast Linear-Arithmetic Solver for DPLL(T)
Bruno Dutertre, Leonardo Mendonça de Moura
CAV
2006
Springer
101views Hardware» more  CAV 2006»
13 years 8 months ago
Terminator: Beyond Safety
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 8 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 8 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
CAV
2006
Springer
90views Hardware» more  CAV 2006»
13 years 8 months ago
Termination of Integer Linear Programs
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
Mark Braverman
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 8 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
CAV
2006
Springer
86views Hardware» more  CAV 2006»
13 years 8 months ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
CAV
2006
Springer
143views Hardware» more  CAV 2006»
13 years 8 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....