Reducing test inputs using information partitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 555-569

  Majumdar, Rupak ^a   Xu, Ru Gang ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCOLIC EXECUTION; DYNAMIC COMPUTATIONS; INFORMATION FLOWS; OPERATING SYSTEMS; PACKET PROCESSING; RANDOM VALUES; SYMBOLIC TECHNIQUES; TEST GENERATIONS; TEST INPUTS;

ALGORITHMS; COMPUTER AIDED ANALYSIS; COMPUTER OPERATING SYSTEMS; TESTING;

SET THEORY;

EID: 70350216056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_41     Document Type: Conference Paper

References (18)

1. Anand, S., Godefroid, P., Tillmann, N.: Demand-driven compositional symbolic execution. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 367-381. Springer, Heidelberg (2008)
2. Boonstoppel, P., Cadar, C., Engler, D.: RWset: Attacking path explosion in constraint-based test generation. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 351-366. Springer, Heidelberg (2008)
3. Cadar, C., Dunbar, D., Engler, D.R.: KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In: OSDI (2008)
4. Cadar, C., Ganesh, V., Pawlowski, P., Dill, D., Engler, D.: Exe: automatically generating inputs of death. In: CCS (2006)
5. Clause, J., Li, W., Orso, A.: Dytan: A generic dynamic taint analysis framework. In: ISSTA (2007)
6. Denning, D.E.: A lattice model of secure information flow. Commun. ACM 19(5), 236-243 (1976)
7. Godefroid, P.: Compositional dynamic test generation. In: POPL. ACM, New York (2007)
8. Godefroid, P., Klarlund, N., Sen, K.: Dart: directed automated random testing. In: PLDI (2005)
9. Jhala, R., Majumdar, R.: Path slicing. In: PLDI 2005, ACM, New York (2005)
10. Korel, B., Laski, J.: Dynamic program slicing. Information Processing Letters 29, 155-163 (1988)
11. Korel, B., Yalamanchili, S.: Forward computation of dynamic program slices. In: ISSTA (1994)
12. Masri, W., Podgurski, A., Leon, D.: Detecting and debugging insecure information flows. In: ISSRE (2004)
13. Muchnick, S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)
14. Necula, G.C., McPeak, S., Rahul, S.P., Weimer, W.: CIL: Intermediate language and tools for analysis and transformation of C programs. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, p. 213. Springer, Heidelberg (2002)
15. Sen, K., Marinov, D., Agha, G.: Cute: a concolic unit testing engine for c. In: FSE (2005)
16. Tip, F.: A survey of program slicing techniques. Journel of Programming Languages 3, 121-189 (1995)
17. Weiser, M.: Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. Ph.D Thesis (1979)
18. Xu, R., Godefroid, P., Majumdar, R.: Testing for buffer overflows with length abstraction. In: ISSTA (2008)