Symbolic execution formally explained

Boer, Frank S. de; Bonsangue, Marcello M.

doi:10.1007/s00165-020-00527-y

Cited by 5 publications

(1 citation statement)

References 22 publications

(1 reference statement)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many methodologies [4,[14][15][16] have been devised in recent decades. Symbolic execution [2,[17][18][19] is a traditional approach in static test-case generation, which was initially proposed by James C. King in 1976. By this methodology, a program is analyzed to build an execution tree without actually executing the program.…”

Section: Related Workmentioning

confidence: 99%

Scalable Path Search for Automated Test Case Generation

Wang

2022

Electronics

View full text Add to dashboard Cite

Test case generation is an important task during software testing. In this paper, we present a new test-case generation framework for C programs. This approach combines dataflow analysis and dynamic symbolic execution together, and more importantly, it efficiently searches the program path space for potential faults based on the tabu search strategy and the program fault statistics. Unlike the traditional symbolic execution, which explores the program space exhaustively and is difficult to apply to complicated programs effectively, our approach automatically explores the feasible paths of hidden faults with high probability. The scalable and efficient path search strategy facilitates bug finding with much fewer test cases generated. We implemented this approach, and the experimental results presented in this paper are attractive.

show abstract