Abstract: Symbolic Pathfinder (SPF) combines symbolic execution with model checking and constraint solving for automated test case generation and error detection in Java programs with unspecified inputs. In this tool, programs are executed on symbolic inputs representing multiple concrete inputs. Values of variables are represented as constraints generated from the analysis of Java bytecode. The constraints are solved using off-the shelf solvers to generate test inputs guaranteed to achieve complex coverage criteria. SPF has been used successfully at NASA, in academia, and in industry.
Publication Year: 2010
Publication Date: 2010-09-20
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 241
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot