The design and implementation of a grammar-based data generator
Software—Practice & Experience
Black-box testing: techniques for functional testing of software and systems
Black-box testing: techniques for functional testing of software and systems
Random generation of words in an algebraic language in linear binary space
Information Processing Letters
Automatic test data generation using constraint solving techniques
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Introduction to the Theory of Computation
Introduction to the Theory of Computation
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
ICSE '81 Proceedings of the 5th international conference on Software engineering
Criteria for Generating Specification-Based Tests
ICECCS '99 Proceedings of the 5th International Conference on Engineering of Complex Computer Systems
DART: directed automated random testing
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
yagg: an easy-to-use generator for structured test inputs
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Automated testing of refactoring engines
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Directed test generation using symbolic grammars
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Introduction to Software Testing
Introduction to Software Testing
Grammar-based whitebox fuzzing
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Random testing and model checking: building a common framework for nondeterministic exploration
WODA '08 Proceedings of the 2008 international workshop on dynamic analysis: held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008)
Analytic Combinatorics
A Case Study in Grammar Engineering
Software Language Engineering
On the Use of Uniform Random Generation of Automata for Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
A Sentence Generation Algorithm for Testing Grammars
COMPSAC '09 Proceedings of the 2009 33rd Annual IEEE International Computer Software and Applications Conference - Volume 01
A Toolkit for Generating Sentences from Context-Free Grammars
SEFM '10 Proceedings of the 2010 8th IEEE International Conference on Software Engineering and Formal Methods
Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing
ICST '11 Proceedings of the 2011 Fourth IEEE International Conference on Software Testing, Verification and Validation
Mutation Testing of "Go-Back" Functions Based on Pushdown Automata
ICST '11 Proceedings of the 2011 Fourth IEEE International Conference on Software Testing, Verification and Validation
Controllable combinatorial coverage in grammar-based testing
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Jartege: a tool for random generation of unit tests for java classes
QoSA'05 Proceedings of the First international conference on Quality of Software Architectures and Software Quality, and Proceedings of the Second International conference on Software Quality
Testing concurrent object-oriented systems with spec explorer
FM'05 Proceedings of the 2005 international conference on Formal Methods
| Hi-index | 0.00 |
Developing efficient and automatic testing techniques is one of the major challenges facing the software validation community. Recent work by Denise and al. (in MBT'08 proceedings) shows how to draw traces uniformly at random in large systems modeled by finite automata for testing purposes. Since finite automata are strong abstractions of systems, many generated test cases following this approach may be un-concretizable, i.e., do not correspond to any concrete execution of the system under test. In this paper, we propose to tackle this problem by extending the approach to pushdown systems that can encode either a stack data structure or the call stack. The method is based on context-free grammar algorithms, and relies on combinatorial techniques to guarantee the uniformity of generated traces.