Abstract
We present an efficient symbolic search algorithm for software model checking. Our algorithms perform word-level reasoning by using a combination of decision procedures in Boolean and integer and real domains, and use novel symbolic search strategies optimized specifically for sequential programs to improve scalability. Experiments on real-world C programs show that the new symbolic search algorithms can achieve several orders-of-magnitude improvements over existing methods based on bit-level (Boolean) reasoning.
Original language | English (US) |
---|---|
Article number | 10 |
Journal | ACM Transactions on Design Automation of Electronic Systems |
Volume | 14 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 2009 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
Keywords
- Binary decision diagram
- Composite symbolic formula
- Image computation
- Model checking
- Presburger arithmetic
- Reachability analysis