CUTE A Concolic Unit Testing Engine for C文档.pptVIP

* Related Work “DART: Directed Automated Random Testing” by Patrice Godefroid, Nils Klarlund, and Koushik Sen (PLDI’05) handles only arithmetic constraints CUTE Supports C with pointers, data-structures Highly efficient constraint solver 100 -1000 times faster arithmetic, pointers Provides Bounded Depth-First Search and Random Search strategies Publicly available tool that works on ALL C programs * Discussion CUTE is light-weight dynamic analysis (compare with static analysis) ensures no false alarms concrete execution and symbolic execution run simultaneously symbolic execution consults concr