Constraint-based test data generation in the presence of stack-directed pointers

Authors:
Arnaud Gotlieb;Tristan Denmat;Bernard Botella
Affiliations:
IRISA / INRIA, Rennes Cedex, France;IRISA / INRIA, Rennes Cedex, France;THALES AEROSPACE, Elancourt Cedex, France
Venue:
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Year:
2005

Citing 8
Cited 1

Data flow-based test adequacy analysis for languages with pointers

TAV4 Proceedings of the symposium on Testing, analysis, and verification
Constraint-Based Automatic Test Data Generation

IEEE Transactions on Software Engineering
Application of the pointer state subgraph to static program slicing

Journal of Systems and Software
Automatic test data generation using constraint solving techniques

Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
The dynamic domain reduction procedure for test data generation

Software—Practice & Experience
Introduction to Constraint Logic Programming

Introduction to Constraint Logic Programming
Extended SSA Numbering: Introducing SSA Properties to Language with Multi-level Pointers

CC '98 Proceedings of the 7th International Conference on Compiler Construction
Tracking pointers with path and context sensitivity for bug detection in C programs

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering

On complementary principles of object-oriented constraint programming

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint-Based Test data generation (CBT) exploits constraint satisfaction techniques to generate test data able to kill a given mutant or to reach a selected branch in a program. When pointer variables are present in the program, aliasing problems may arise and may lead to the failure of current CBT approaches. In our work, we propose an overall CBT method that exploits the results of an intraprocedural points-to analysis and provides two specific constraint combinators for automatically generating test data able to reach a selected branch. Our approach correctly handles multi-levels stack-directed pointers that are mainly used in real-time control systems. The method has been fully implemented in the test data generation tool INKA and first experiences in applying it to a variety of existing programs tend to show the interest of the approach.