Sciweavers

CAV
2007
Springer
166views Hardware» more  CAV 2007»
13 years 11 months ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...
CAV
2007
Springer
86views Hardware» more  CAV 2007»
13 years 11 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
CAV
2007
Springer
114views Hardware» more  CAV 2007»
13 years 11 months ago
Comparison Under Abstraction for Verifying Linearizability
Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly ...
CAV
2007
Springer
123views Hardware» more  CAV 2007»
13 years 11 months ago
Test Coverage for Continuous and Hybrid Systems
Tarik Nahhal, Thao Dang
CAV
2007
Springer
104views Hardware» more  CAV 2007»
13 years 11 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
CAV
2007
Springer
120views Hardware» more  CAV 2007»
13 years 11 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...
CAV
2007
Springer
126views Hardware» more  CAV 2007»
13 years 11 months ago
Shape Analysis for Composite Data Structures
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
Josh Berdine, Cristiano Calcagno, Byron Cook, Dino...
CAV
2007
Springer
110views Hardware» more  CAV 2007»
13 years 11 months ago
Parallelising Symbolic State-Space Generators
Jonathan Ezekiel, Gerald Lüttgen, Gianfranco ...
CAV
2007
Springer
121views Hardware» more  CAV 2007»
13 years 11 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
CAV
2007
Springer
121views Hardware» more  CAV 2007»
13 years 11 months ago
Low-Level Library Analysis and Summarization
Programs typically make extensive use of libraries, including dynamically linked libraries, which are often not available in source-code form, and hence not analyzable by tools tha...
Denis Gopan, Thomas W. Reps