2012 IEEE Fifth International Conference on Software Testing, Verification and Validation 2012
DOI: 10.1109/icst.2012.119
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Current industrial testing practices often build test cases in a manual manner, which is slow and ineffective. To alleviate this problem, concolic testing generates test cases that can achieve high coverage in an automated fashion. However, due to a large number of possible execution paths, concolic testing might not detect bugs even after spending significant amount of time. Thus, it is necessary to check if concolic testing can detect bugs in embedded software in a practical manner through case studies. This… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 28 publications
(19 citation statements)
references
References 27 publications
0
19
0
Order By: Relevance
“…Concolic Testing with Focus on Maker Note Tags with Concrete Image Files 1) KLEE Results: Table III shows total time taken for each of the five search strategies of KLEE with --max-time 900, 1800, and 3600 seconds (15,30, and 60 minutes respectively) on the six image files in total. This table also shows total numbers of test cases generated and total branch coverage ratios achieved for each search strategy on the six image files.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Concolic Testing with Focus on Maker Note Tags with Concrete Image Files 1) KLEE Results: Table III shows total time taken for each of the five search strategies of KLEE with --max-time 900, 1800, and 3600 seconds (15,30, and 60 minutes respectively) on the six image files in total. This table also shows total numbers of test cases generated and total branch coverage ratios achieved for each search strategy on the six image files.…”
Section: Resultsmentioning
confidence: 99%
“…We applied KLEE to libexif with depth first search (DFS), random path, random search, covering new, interleaving of DFS + covering new search strategies as these five search strategies may cover different paths and different branches (see [5] for the detail of the search strategies) 2 We executed KLEE with --max-time as 900, 1800, and 3600 seconds (15,30, and 60 minutes respectively) for each testing strategy. 3 The --max-time option restricts only symbolic execution time, not including time spent to generate test cases from the current symbolic execution tree when the target program is forced to stop.…”
Section: Klee and Crest-bv Settingsmentioning
confidence: 99%
See 1 more Smart Citation
“…Because of the impractical implementation on real‐world programs, concolic testing (CONCrete + symbOLIC) is proposed to enhance the ability of symbolic execution. It involves concrete execution while doing symbolic execution so as to address unsolvable constraints . Even though substantial efforts have been made to research about different searching strategies of concolic testing to improve code coverage, program paths grow exponentially as the branches in programs increase.…”
Section: Introductionmentioning
confidence: 99%
“…It obtains information about the reachable paths by adding constraints on every branch during the execution of the program [3]. The utilization of concolic testing tool is being seen as an effective method for software testing, and it is also being actively applied to industry [4].…”
Section: Introductionmentioning
confidence: 99%