Green: Reducing, reusing and recycling constraints in program analysis

Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, FSE 2012

Volumn , Issue , 2012, Pages

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

^a STELLENBOSCH UNIVERSITY   (South Africa)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

constraint solving; NoSQL; path feasibility; symbolic execution

Indexed keywords

RECYCLING;

CANONICAL FORM; CONSTRAINT SATISFIABILITY; CONSTRAINT SOLVING; NOSQL; PATH FEASIBILITY; PHYSICAL LOCATIONS; PROGRAM ANALYSIS; SYMBOLIC EXECUTION;

MODEL CHECKING;

EID: 85052274594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2393596.2393665     Document Type: Conference Paper

References (31)

1. th International Conference on Computer Aided Verification (CAV '07), volume 4590 of Lecture Notes in Computer Science, pages 298-302. Springer-Verlag, July 2007. Berlin, Germany.
2. A. Bessey, K. Block, B. Chelf, A. Chou, B. Fulton, S. Hallem, C. Henri-Gros, A. Kamsky, S. McPeak, and D. Engler. A few billion lines of code later: using static analysis to find bugs in the real world. Commun. ACM, 53(2), Feb. 2010.
3. C. Cadar, D. Dunbar, and D. Engler. Klee: unassisted and automatic generation of high-coverage tests for complex systems programs. In Proceedings of the 8th USENIX conference on Operating systems design and implementation, OSDI'08, pages 209-224, Berkeley, CA, USA, 2008. USENIX Association.
4. C. Cadar, V. Ganesh, P. M. Pawlowski, D. L. Dill, and D. R. Engler. Exe: Automatically generating inputs of death. ACM Trans. Inf. Syst. Secur., 12(2):10:1-10:38, Dec. 2008.
5. Choco. Choco Solver. http://www.emn.fr/z-info/choco-solver/.
6. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2001.
7. L. de Moura, S. Owre, H. Rueç, J. Rushby, and N. Shankar. The ICS decision procedures for embedded deduction. In Automated Reasoning, volume 3097, pages 218-222. Springer, 2004.
8. L. de Moura, H. Rueß, and N. Shankar. Justifying equality. Electron. Notes Theor. Comput. Sci., 125(3):69-85, July 2005.
9. R. A. DeMillo and A. J. Offutt. Constraint-based automatic test data generation. IEEE Trans. Software Eng., 17(9):900-910, 1991.
10. J. Geldenhuys, W. Visser, and M. B. Dwyer. Probabilistic symbolic execution. In Proceedings of the 21st International Symposium on Software Testing and Analysis, 2012. To appear.
11. P. Godefroid, M. Y. Levin, and D. Molnar. Sage: whitebox fuzzing for security testing. Commun. ACM, 55(3):40-44, Mar. 2012.
12. R. Iosif. Symmetry reductions for model checking of concurrent dynamic software. International Journal on Software Tools for Technology Transfer (STTT), 6:302-319, 2004.
13. Jedis. Redis Java Interface. http://code.google.com/p/jedis/.
14. Y. Jia and M. Harman. An analysis and survey of the development of mutation testing. IEEE Transactions on Software Engineering, 2008(5):1-32, 2011.
15. Jumble. Jumble mutation testing tool. http://jumble.sourceforge.net/.
16. LattE. LattE Integrale, UC Davis, Mathematics. http://www.math.ucdavis. edu/~latte.
17. G. J. Myers. Art of Software Testing. John Wiley & Sons, Inc., 1979.
18. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst., 1(2):245-257, Oct. 1979.
19. 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, 2008.
20. 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, 2011.
21. 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, ASE '10, pages 179-180, New York, NY, USA, 2010. ACM.
22. D. Ramos and D. Engler. Practical, low-effort equivalence verification of real code. In Computer Aided Verification, pages 669-685. 2011.
23. Redis. Redis NoSQL Database. http://redis.io.
24. T. Sang, F. Bacchus, P. Beame, H. A. Kautz, and T. Pitassi. Combining component caching and clause learning for effective model counting. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, 2004.
25. S. F. Siegel, A. Mironova, G. S. Avrunin, and L. A. Clarke. Using model checking with symbolic execution to verify parallel numerical programs. In Proceedings of the 2006 international symposium on Software testing and analysis, pages 157-168, 2006.
26. SIR. SIR Repository. http://sir.unl.edu.
27. N. Tillmann and J. De Halleux. Pex: white box test generation for .net. In Proceedings of the 2nd international conference on Tests and proofs, TAP'08, pages 134-153, Berlin, Heidelberg, 2008. Springer-Verlag.
28. 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, ISSTA, pages 37-48. ACM, 2006.
29. G. Yang, C. Pǎsǎreanu, and S. Khurshid. Memoized symbolic execution. In Proceedings of the 21st International Symposium on Software Testing and Analysis, 2012. to appear.
30. Yikes. Yices SMT Solver. http://yices.csl.sri.com/.
31. zChaff. SAT Research Group, Princeton University. http://www.princeton. edu/~chaff/zchaff.html.