Sciweavers

CAV
2007
Springer
120views Hardware» more  CAV 2007»
14 years 12 days 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»
14 years 12 days 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»
14 years 12 days ago
Parallelising Symbolic State-Space Generators
Jonathan Ezekiel, Gerald Lüttgen, Gianfranco ...
CAV
2007
Springer
121views Hardware» more  CAV 2007»
14 years 12 days 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»
14 years 12 days 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
CAV
2007
Springer
106views Hardware» more  CAV 2007»
14 years 12 days ago
Leaping Loops in the Presence of Abstraction
Thomas Ball, Orna Kupferman, Mooly Sagiv
CAV
2007
Springer
110views Hardware» more  CAV 2007»
14 years 12 days ago
Hector: Software Model Checking with Cooperating Analysis Plugins
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
Nathaniel Charlton, Michael Huth
CAV
2007
Springer
116views Hardware» more  CAV 2007»
14 years 12 days ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 12 days ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
MEMOCODE
2008
IEEE
14 years 19 days ago
Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
Radu Mateescu, Emilie Oudot