Probabilistic symbolic execution

2012 International Symposium on Software Testing and Analysis, ISSTA 2012 - Proceedings

Volumn , Issue , 2012, Pages 166-176

  Geldenhuys, Jaco ^a   Dwyer, Matthew B ^b   Visser, Willem ^a  

^a STELLENBOSCH UNIVERSITY   (South Africa)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

model counting; probabilistic analysis; Symbolic execution; testing

Indexed keywords

COMPUTATIONAL ALGEBRA; CONTRACT SPECIFICATIONS; DECISION PROCEDURE; EMPIRICAL EVALUATIONS; EXACT RESULTS; LIBRARY CODES; MEMOIZATION; PATH CONDITION; PATH PROBABILITY; PROBABILISTIC ANALYSIS; PROGRAM ANALYSIS; SOFTWARE ANALYSIS; SYMBOLIC EXECUTION; WORST-CASE EXECUTION;

ALGEBRA; PROBABILITY; TESTING;

SOFTWARE TESTING;

EID: 84865289875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/04000800.2336773     Document Type: Conference Paper

References (36)

1. T. Ball and J. R. Larus. Efficient path profiling. In Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture, pages 46-57. IEEE, Dec. 1996.
2. J. Burnim, S. Juvekar, and K. Sen. Wise: Automated test generation for worst-case complexity. In Proceedings of the 31st International Conference on Software Engineering, pages 463-473, May 2009.
3. R. P. L. Buse and W. Weimer. The road not taken: Estimating path execution frequency statically. In Proceedings of the 31st International Conference on Software Engineering, pages 144-154. ACM, May 2009.
4. J. A. De Loera, B. Dutra, M. Köppe, S. Moreinis, G. Pinto, and J. Wu. Software for exact integration of polynomials over polyhedra. arXiv:1108.0117v2 [math.MG], 2011.
5. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, LNCS #4963, pages 337-340. Springer, 2008.
6. R. A. DeMillo and A. J. Offutt. Constraint-based automatic test data generation. IEEE Trans. Software Eng., 17(9):900-910, Sept. 1991.
7. J. A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Computers, C-30(7):478-490, July 1981.
8. J. Galambos and I. Simonelli. Bonferroni-Type Inequalities with Applications. Springer-Verlag, 1996.
9. J. P. Galeotti, N. Rosner, C. L. Pombo, and M. F. Frias. Analysis of invariants for efficient bounded verification. In Proceedings of the 19th International Symposium on Software Testing and Analysis, pages 25-36, July 2010.
10. D. Garbervetsky, S. Yovine, V. A. Braberman, M. Rouaux, and A. Taboada. On transforming Java-like programs into memory-predictable code. In Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems, pages 140-149. ACM, Sept. 2009.
11. D. Garbervetsky, S. Yovine, V. A. Braberman, M. Rouaux, and A. Taboada. Quantitative dynamic-memory analysis for Java. Concurrency and Computation: Practice and Experience, 23(14):1665-1678, Sept. 2011.
12. C. P. Gomes, A. Sabharwal, and B. Selman. Model counting. In Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 633-654. IOS Press, 2009.
13. S. Gulwani. SPEED: Symbolic complexity bound analysis. In Proceedings of the 21st International Conference on Computer Aided Verification, LNCS #5643, pages 51-62. Springer, June-July 2009.
14. J. A. Jones and M. J. Harrold. Empirical evaluation of the tarantula automatic fault-localization technique. In Proceedings of the 20th IEEE/ACM international Conference on Automated Software Engineering, pages 273-282. ACM, Nov. 2005.
15. S. Khurshid, C. S. Pǎsǎreanu, and W. Visser. Generalized symbolic execution for model checking and testing. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, LNCS #2619, pages 553-568. Springer, Apr. 2003.
16. M. Köppe. A primal Barvinok algorithm based on irrational decompositions. SIAM J. Discrete Math., 21(1):220-236, 2007.
17. M. Z. Kwiatkowska, G. Norman, and D. Parker. PRISM 4.0: Verification of probabilistic real-time systems. In Proceedings of the 23rd International Conference on Computer Aided Verification, LNCS #6806, pages 585-591. Springer, July 2011.
18. S. Liu and J. Zhang. Program analysis: from qualitative analysis to quantitative analysis. In Proceedings of the 33rd International Conference on Software Engineering - NIER Track, pages 956-959. ACM, May 2011.
19. J. A. D. Loera, R. Hemmecke, J. Tauzer, and R. Yoshida. Effective lattice point counting in rational convex polytopes. J. Symb. Comput., 38(4):1273-1302, Oct. 2004.
20. F. Ma, S. Liu, and J. Zhang. Volume computation for Boolean combination of linear arithmetic constraints. In Proceedings of the 22nd International Conference on Automated Deduction, LNCS #5663, pages 453-468. Springer, Aug. 2009.
21. K.-K. Ma, K. Yit Phang, J. Foster, and M. Hicks. Directed symbolic execution. In Proceedings of the 18th International Static Analysis Symposium, LNCS #6887, pages 95-111. Springer, Sept. 2011.
22. D. Monniaux. Abstract interpretation of probabilistic semantics. In Proceedings of the 7th International Static Analysis Symposium, LNCS #1824, pages 322-339. Springer, June 2000.
23. C. C. Morgan and A. K. McIver. pGCL: Formal reasoning for random algorithms. South African Comp Jnl, 22:14-27, Mar. 1999.
24. G. J. Myers. Art of Software Testing. John Wiley & Sons, Inc., 1979.
25. S. Person, M. B. Dwyer, S. Elbaum, and C. S. Pǎsǎreanu. Differential symbolic execution. In Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pages 226-237, Nov. 2008.
26. S. Person, G. Yang, N. Rungta, and S. Khurshid. Directed incremental symbolic execution. In Proceedings of the 32nd ACM SIGPLAN conference on Programming Language Design and Implementation, pages 504-515, June 2011.
27. C. S. Pǎsǎreanu and N. Rungta. Symbolic PathFinder: symbolic execution of Java bytecode. In Proceedings of the IEEE/ACM International Conference on Automated Software Engineering, pages 179-180. ACM, Sept. 2010.
28. G. Ramalingam. Data flow frequency analysis. In Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation, pages 267-277, May 1996.
29. T. Sang, P. Beame, and H. A. Kautz. Performing Bayesian inference by weighted model counting. In Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, pages 475-482. AAAI Press / The MIT Press, July 2005.
30. R. Sharma, M. Gligoric, A. Arcuri, G. Fraser, and D. Marinov. Testing container classes: Random or systematic? In Proceedings of the 14th International Conference on Fundamental Approaches to Software Engineering, LNCS #6603, pages 262-277. Springer, Mar.-Apr. 2011.
31. UC Davis, Mathematics. Latte integrale. http://www.math.ucdavis.edu/ ~latte.
32. W. Visser, K. Havelund, G. P. Brat, S. Park, and F. Lerda. Model checking programs. Autom. Softw. Eng., 10(2):203-232, Apr. 2003.
33. W. Visser, C. S. Pǎsǎreanu, and R. Pelánek. Test input generation for Java containers using state matching. In L. L. Pollock and M. Pezzè, editors, Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, pages 37-48. ACM, July 2006.
34. R. Williams. Triangle classification problem. http://russcon.org/ triangle-classification.html.
35. T. Xie, N. Tillmann, J. de Halleux, and W. Schulte. Fitness-guided path exploration in dynamic symbolic execution. In Proceedings of the 2009 IEEE/IFIP International Conference on Dependable Systems and Networks, pages 359-368, June-July 2009.
36. P. Zhang, S. G. Elbaum, and M. B. Dwyer. Automatic generation of load tests. In Proceedings of the 26th IEEE/ACM International Conference on Automated Software Engineering, pages 43-52, Nov. 2011.