An orchestrated survey of methodologies for automated software test case generation
Test case generation is among the most labour-intensive tasks in software testing. It also has
a strong impact on the effectiveness and efficiency of software testing. For these reasons, it …
a strong impact on the effectiveness and efficiency of software testing. For these reasons, it …
Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis
Symbolic PathFinder (SPF) is a software analysis tool that combines symbolic execution with
model checking for automated test case generation and error detection in Java bytecode …
model checking for automated test case generation and error detection in Java bytecode …
Sound compilation of reals
Writing accurate numerical software is hard because of many sources of unavoidable
uncertainties, including finite numerical precision of implementations. We present a …
uncertainties, including finite numerical precision of implementations. We present a …
Certified roundoff error bounds using semidefinite programming
Roundoff errors cannot be avoided when implementing numerical programs with finite
precision. The ability to reason about rounding is especially important if one wants to …
precision. The ability to reason about rounding is especially important if one wants to …
Improving search-based test suite generation with dynamic symbolic execution
Search-based testing can automatically generate unit test suites for object oriented code, but
may struggle to generate specific values necessary to cover difficult parts of the code …
may struggle to generate specific values necessary to cover difficult parts of the code …
Generating performance distributions via probabilistic symbolic execution
Analyzing performance and understanding the potential best-case, worst-case and
distribution of program execution times are very important software engineering tasks. There …
distribution of program execution times are very important software engineering tasks. There …
Just fuzz it: solving floating-point constraints using coverage-guided fuzzing
We investigate the use of coverage-guided fuzzing as a means of proving satisfiability of
SMT formulas over finite variable domains, with specific application to floating-point …
SMT formulas over finite variable domains, with specific application to floating-point …
Floating-point symbolic execution: a case study in n-version programming
Symbolic execution is a well-known program analysis technique for testing software, which
makes intensive use of constraint solvers. Recent support for floating-point constraint solving …
makes intensive use of constraint solvers. Recent support for floating-point constraint solving …
Xsat: A fast floating-point satisfiability solver
Abstract The Satisfiability Modulo Theory (SMT) problem over floating-point arithmetic is a
major hurdle in applying SMT techniques to real-world floating-point code. Solving floating …
major hurdle in applying SMT techniques to real-world floating-point code. Solving floating …
Feedback-directed unit test generation for C/C++ using concolic execution
In industry, software testing and coverage-based metrics are the predominant techniques to
check correctness of software. This paper addresses automatic unit test generation for …
check correctness of software. This paper addresses automatic unit test generation for …