Sciweavers

24 search results - page 4 / 5
» Finding bugs efficiently with a SAT solver
Sort
View
TSE
2010
155views more  TSE 2010»
12 years 12 months ago
Incremental Test Generation for Software Product Lines
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence to deploy more dependable software. This pap...
Engin Uzuncaova, Sarfraz Khurshid, Don S. Batory
IJISEC
2008
101views more  IJISEC 2008»
13 years 5 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
IJCSA
2007
104views more  IJCSA 2007»
13 years 5 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
CADE
2006
Springer
14 years 5 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
CAV
2008
Springer
139views Hardware» more  CAV 2008»
13 years 7 months ago
CSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
Dirk Beyer, Damien Zufferey, Rupak Majumdar