All-paths test generation for programs with internal aliases

Proceedings - International Symposium on Software Reliability Engineering, ISSRE

Volumn , Issue , 2008, Pages 147-156

  Kosmatov, Nikolai ^a  

^a CEA LIST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

C PROGRAMS; COVERAGE CRITERIA; DEPTH FIRST; ENTRY POINT; EXECUTION PATHS; MEMORY LOCATIONS; STRUCTURAL TESTING; SYMBOLIC EXECUTION; TEST CASE; TEST GENERATIONS;

COMPUTER SOFTWARE SELECTION AND EVALUATION; POINT GROUPS; SOFTWARE RELIABILITY; SOFTWARE TESTING;

TESTING;

EID: 67249122359     PISSN: 10719458     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISSRE.2008.25     Document Type: Conference Paper

References (26)

1. S. Bardin and P. Herrmann. Structural testing of executables. In the First IEEE International Conference on Software Testing, Verification, and Validation (ICST'08), pages 22-31, Lillehammer, Norway, April 2008.
2. C. Cadar, V. Ganesh, P. M. Pawlowski, D. L. Dill, and D. R. Engler. EXE: automatically generating inputs of death. In 13th ACM Conference on Computer and Communications Security (CCS'06), pages 322-335, Alexandria, Virginia, USA, November 2006. (Pubitemid 47131380)
3. F. Charreteur, B. Botella, and A. Gotlieb. Modelling dynamic memory management in constraint-based testing. In Testing: Academic and Industrial Conference, Practice and Research Techniques (TAIC-PART'07), Windsor, UK, September 2007.
4. CIL: C Intermediate Language. Infrastructure for C Program Analysis and Transformation. 2005/2006. http://manju.cs.berkeley.edu/cil/.
5. R. A. DeMillo and A. J. Offutt. Constraint-based automatic test data generation. IEEE Transactions on Software Engineering (TSE), 17(9):900-910, 1991. (Pubitemid 21717628)
6. R. Ferguson and B. Korel. The chaining approach for software test data generation. ACM Trans. Softw. Eng. Methodol., 5(1):63-86, 1996. (Pubitemid 126669196)
7. P. Godefroid, N. Klarlund, and K. Sen. DART: Directed automated random testing. In the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (PLDI'05), pages 213-223, Chicago, IL, USA, June 2005.
8. A. Gotlieb, B. Botella, and M. Rueher. Automatic test data generation using constraint solving techniques. In the ACM SIGSOFT 1998 International Symposium on Software Testing and Analysis (ISSTA'98), pages 53-62, Clearwater Beach, Florida, USA, March 1998.
9. A. Gotlieb, B. Botella, and M. Rueher. A CLP framework for computing structural test data. Lecture Notes in Computer Science, 1861:399-413, July 2000.
10. B. S. Gulavani, T. A. Henzinger, Y. Kannan, A. V. Nori, and S. K. Rajamani. SYNERGY: a new algorithm for property checking. In the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE'05), pages 117-127, Portland, Oregon, USA, November 2006. (Pubitemid 47129390)
11. M. Hind. Pointer analysis: haven't we solved this problem yet? In the ACM SIGPLAN-SIGSOFT 2001 Workshop on Program Analysis For Software Tools and Engineering (PASTE'01), pages 54-61, Snowbird, Utah, USA, June 2001.
12. J. C. King. Symbolic execution and program testing. Communications of the ACM (CACM), 19(7):385-394, 1976.
13. N. Kosmatov. A toy implementation of latealiases algorithm for all-paths test generation for C programs with internal aliases, May 2008. http://frama-c.cea.fr/test/aliases/index.htm.
14. D. Kröning, A. Groce, and E. M. Clarke. Counterexample guided abstraction refinement via program execution. In the 6th International Conference on Formal Engineering Methods (ICFEM'04), pages 224-238, Seattle, WA, USA, November 2004. (Pubitemid 39750935)
15. W. Landi. Undecidability of static analysis. ACM Letters on Programming Languages and Systems (LOPLAS), 1(4):323-337, 1992.
16. B. Marre and A. Arnould. Test sequences generation from Lustre descriptions : GATeL. In the 15th IEEE International Conference on Automated Software Engineering (ASE'00), pages 229-237, Grenoble, France, September 2000.
17. C. Meudec. ATGen : automatic test data generation using constraint logic programming and symbolic execution. Software Testing Verification and Reliability, 11(2):81-96, June 2001.
18. K. Sen, D. Marinov, and G. Agha. CUTE: a concolic unit testing engine for C. In the 5th joint meeting of the European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'05), pages 263-272, Lisbon, Portugal, September 2005. (Pubitemid 43218836)
19. S. Visvanathan and N. Gupta. Generating test data for functions with pointer inputs. In the 17th IEEE International Conference on Automated Software Engineering (ASE'02), page 149, Edinburgh, Scotland, UK, September 2002.
20. N. Williams. WCET measurement using modified path testing. In 5th InternationalWorkshop onWorst-Case Execution Time Analysis (WCET'05), July 2005.
21. N. Williams, B. Marre, and P. Mouy. On-the-fly generation of k-paths tests for C functions : towards the automation of grey-box testing. In the 19th IEEE International Conference on Automated Software Engineering (ASE'04), pages 290- 293, Linz, Austria, September 2004.
22. N.Williams, B.Marre, P.Mouy, and M. Roger. Pathcrawler: Automatic generation of path tests by combining static and dynamic analysis. In the 5th European Dependable Computing Conference (EDCC'05), pages 281-292, Budapest, Hungary, April 2005. (Pubitemid 41312765)
23. Z. Xu and J. Zhang. A test data generation tool for unit testing of C programs. In the 6th International Conference on Quality Software (QSIC'06), pages 107-116, Beijing, China, October 2006.
24. G. Yorsh, T. Ball, and M. Sagiv. Testing, abstraction, theorem proving: better together! In ACM/SIGSOFT 2006 International Symposium on Software Testing and Analysis (ISSTA' 06), pages 145-156, Portland, Maine, USA, July 2006.
25. X. Zheng and R. Rugina. Demand-driven alias analysis for C. In the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'08), pages 197- 208, San Francisco, California, USA, January 2008.
26. H. Zhu, P. A. V. Hall, and J. H. R. May. Software unit test coverage and adequacy. ACM Computing Surveys, 29(4):366-427, 1997. (Pubitemid 127583222)