Controllable combinatorial coverage in grammar-based testing

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

Volumn 3964 LNCS, Issue , 2006, Pages 19-38

  Lämmel, Ralf ^a   Schulte, Wolfram ^b  

^a MICROSOFT   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONTROL THEORY; FUNCTIONS; METADATA; SET THEORY; EXPLOSIVES;

COMBINATORIALLY EXHAUSTIVE TEST-DATA SETS; DATA SETS; GRAMMAR-DRIVEN FUNCTIONALITY; STRESS TESTING; CONFORMANCE TESTING; CONTROL MECHANISM; DIFFERENTIAL TESTING; EXHAUSTIVE TESTS; GRAMMAR-BASED TESTING; NON EXPLOSIVES; TEST DATA GENERATION;

COMBINATORIAL MATHEMATICS; CONTEXT FREE GRAMMARS;

EID: 33745875641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11754008_2     Document Type: Conference Paper

References (32)

1. A. Andoni, D. Daniliuc, S. Khurshid, and D. Marinov. Evaluating the "Small Scope Hypothesis". Unpublished; Available at http://sdg.lcs.mit.edu/publications.html, Sept. 2002.
2. G. Bernot, M. C. Gaudel, and B. Marre. Software testing based on formal specifications: a theory and a tool. Software Engineering Journal, 6(6):387-405, 1991.
3. D. L. Bird and C. U. Munoz. Automatic generation of random self-checking test cases. IBM Systems Journal, 22(3):229-245, 1983.
4. L. Bouge, N. Choquet, L. Fribourg, and M.-C. Gaudel. Test sets generation from algebraic specifications using logic programming. Journal of Systems and Software, 6(4):343-360, 1986.
5. C. Boyapati, S. Khurshid, and D. Marinov. Korat: automated testing based on Java predicates. In Proc. International Symposium on Software, testing and analysis, pages 123-133. ACM Press, 2002.
6. C. Burgess. The Automated Generation of Test Cases for Compilers. Software Testing, Verification and Reliability, 4(2):81-99, June 1994.
7. C. J. Burgess and M. Saidi. The automatic generation of test cases for optimizing Fortran compilers. Information and Software Technology, 38(2):111-119, Feb. 1996.
8. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pages 268-279, New York, NY, USA, 2000. ACM Press.
9. D. Cohen, S. Dalai, M. Fredman, and G. Patton. The AETG system: An approach to testing based on combinatorial design. IEEE Transactions on Software Engineering, 23(7):437-443, July 1997.
10. Foundations of Software Engineering, Microsoft Research. AsmL - Abstract State Machine Language, 2005. http://research.microsoft.com/fse/AsmL/.
11. Y. Gurevich and C. Wallace. Specification and Verification of the Windows Card Runtime Environment Using Abstract State Machines. Technical report, Microsoft Research, Feb. 1999. MSR-TR-99-07.
12. J. Harm and R. Lämmel. Two-dimensional Approximation Coverage. Informatica, 24(3):355-369, 2000.
13. D. Jackson and C. A. Damon. Elements of Style: Analyzing a Software Design Feature with a Counterexample Detector. IEEE Transactions on Software Engineering, 22(7):484-495, 1996.
14. J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385-394, July 1976.
15. D. Knuth. Semantics of context-free languages. Mathematical Systems Theory, 2:127-145, 1968. Corrections in 5:95-96, 1971.
16. R. Lämmel. Grammar Testing. In H. Hussmann, editor, Proc. of Fundamental Approaches to Software Engineering (FASE) 2001, volume 2029 of LNCS, pages 201-216. Springer-Verlag, 2001.
17. R. Lämmel and J. Harm. Test case characterisation by regular path expressions. In E. Brinksma and J. Tretmans, editors, Proc. Formal Approaches to Testing of Software (FATES'01), Notes Series NS-01-4, pages 109-124. BRIGS, Aug. 2001.
18. Y. Lei and K.-C. Tai. In-pararneter-order: A test generation strategy for pairwise testing. In HASE, pages 254-261. IEEE Computer Society, 1998.
19. P. Maurer. Generating test data with enhanced context-free grammars. IEEE Software, 7(4):50-56, 1990.
20. W. McKeeman. Differential testing for software. Digital Technical Journal of Digital Equipment Corporation, 10(1): 100-107, 1998.
21. P. Purdom. A sentence generator for testing parsers. BIT, 12(3):366-375, 1972.
22. J. Schlimmer et al. Web Services Policy Framework, Sept. 2004. Available at http://www-128.ibm.com/developerworks/library/specification/wspolfram/.
23. E. G. Sirer and B. N. Bershad. Using production grammars in software testing. In USENIX, editor, Proceedings of the 2nd Conference on Domain-Specific Languages (DSL '99), October 3-5, 1999, Austin, Texas, USA, pages 1-13, Berkeley, CA, USA, 1999. USENIX.
24. D. Slutz. Massive Stochastic Testing for SQL. Technical Report MSR-TR-98-21, Microsoft Research, Redmond, 1998.
25. A shorter form of the paper appeared in the Proc. of the 24th VLDB Conference, New York, USA, 1998.
26. S. Stepney. High Integrity Compilation: A Case Study. Prentice Hall, 1993.
27. K. Tai and Y. Lei. A Test Generation Strategy for Pairwise Testing. IEEE Transactions on Software Engineering, 28(1):109-111, 2002.
28. N. Tillmann, W. Schulte, and W. Grieskamp. Parameterized Unit Tests. Technical report, Microsoft Research, 2005. MSR-TR-2005-64;
29. also appeared in FSE/ESEC 2005.
30. W3C. XML Path Language (XPath) Version 1.0, Nov. 1999. http://www.w3.org/TR/xpath.
31. W3C. XML Schema, 2000-2003. http://www.w3.org/XML/Schema.
32. V. V. Zaytsev. Combinatorial test set generation: Concepts, implementation, case study. Master's thesis, Universiteit Twente, Enschede, The Netherlands, June 2004.