Performance Estimation Using Symbolic Data
Symbolic execution is a useful technique in formal verification and testing. In this paper, we propose to use it to estimate the performance of programs. We first extract a set of paths (either randomly or systematically) from the program, and then obtain a weighted average of the performance of the paths. The weight of a path is the number of input data that drive the program to execute along the path, or the size of the input space that corresponds to the path. As compared with traditional benchmarking, the proposed approach has the benefit that it uses more points in the input space. Thus it is more representative in some sense. We illustrate the new approach with a sorting algorithm and a selection algorithm.
KeywordsInput Space Performance Estimation Array Element Symbolic Data Sorting Algorithm
Unable to display preview. Download preview PDF.
- 2.Cole, R.: Tight bounds on the complexity of the Boyer-Moore string matching algorithm. In: Proc. of the 2nd Symp. on Discrete Algorithms (SODA 1991), pp. 224–233 (1991)Google Scholar
- 3.Geldenhuys, J., Dwyer, M.B., Visser, W.: Probabilistic symbolic execution. In: Proc. of the Int’l Symposium on Software Testing and Analysis (ISSTA 2012), pp. 166–176 (2012)Google Scholar
- 6.Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press (1994), http://www-cs-faculty.stanford.edu/~knuth/sgb.html
- 7.Liu, S., Zhang, J.: Program analysis: from qualitative analysis to quantitative analysis. In: Proc. of the 33rd Int’l Conf. on Software Engineering (ICSE 2011), pp. 956–959 (2011)Google Scholar
- 9.Zhang, J.: Quantitative analysis of symbolic execution. Presented at the 28th Int’l Computer Software and Applications Conf. (COMPSAC 2004) (2004)Google Scholar
- 11.Zhang, J., Liu, S., Ma, F.: A tool for computing the volume of the solution space of SMT(LAC) constraints, draft (January 2013)Google Scholar