Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scalable Error Detection using Boolean Satisfiability Computer Science Department
 

Summary: Scalable Error Detection using Boolean Satisfiability
Yichen Xie
Alex Aiken
Computer Science Department
Stanford University
Stanford, CA 94305
{yxie,aiken}@cs.stanford.edu
ABSTRACT
We describe a software error-detection tool that exploits re-
cent advances in boolean satisfiability (SAT) solvers. Our
analysis is path sensitive, precise down to the bit level, and
models pointers and heap data. Our approach is also highly
scalable, which we achieve using two techniques. First, for
each program function, several optimizations compress the
size of the boolean formulas that model the control- and
data-flow and the heap locations accessed by a function.
Second, summaries in the spirit of type signatures are com-
puted for each function, allowing inter-procedural analysis
without a dramatic increase in the size of the boolean con-
straints to be solved.

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences