The Path Prefix Software Testing Strategy
IEEE Transactions on Software Engineering
Automated Software Test Data Generation
IEEE Transactions on Software Engineering
ADTEST: A Test Data Generation Suite for Ada Software Systems
IEEE Transactions on Software Engineering
Solving Constraints over Floating-Point Numbers
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A CLP Framework for Computing Structural Test Data
CL '00 Proceedings of the First International Conference on Computational Logic
Automated Software Test Data Generation for Complex Programs
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Test Sequences Generation from LUSTRE Descriptions: GATEL
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
A New Way of Automating Statistical Testing Methods
Proceedings of the 16th IEEE international conference on Automated software engineering
Consistency techniques for interprocedural test data generation
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Goal-oriented test data generation for pointer programs
Information and Software Technology
Abstract path testing with PathCrawler
Proceedings of the 5th Workshop on Automation of Software Test
PathCrawler: automatic generation of path tests by combining static and dynamic analysis
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Testing noninterference, quickly
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Dowsing for overflows: a guided fuzzer to find buffer boundary violations
SEC'13 Proceedings of the 22nd USENIX conference on Security
Behind the scenes in SANTE: a combination of static and dynamic analyses
Automated Software Engineering
| Hi-index | 0.00 |
We propose a novel method, called PathCrawler, for the automatic generation of structural tests satisfying the all-paths criterion or its k-path variant. The source code is instrumented so as to recover the symbolic execution path each time that the program under test is executed.This code is first executed using inputs arbitrarily selected from the input domain.The resulting symbolic path is transformed into a path predicate by projection of the conditions onto the input variables.The next test is obtained by using constraint logic programming to find input values outside the domain of the path which is already covered.The instrumented code is then executed on this test and so on, until all feasible paths have been covered.Our method combines static and dynamic analysis in a way that avoids the disadvantages of both.It is currently being implemented for the C language.