Constraint solving techniques for software testing and analysis

Authors:
Feifei Ma
Affiliations:
Graduate University, Beijing, China
Venue:
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Year:
2010

Citing 4
Cited 0

The C programming language

The C programming language
Software Fault Interactions and Implications for Software Testing

IEEE Transactions on Software Engineering
Combinatorial testing: learnings from our experience

ACM SIGSOFT Software Engineering Notes
The road not taken: Estimating path execution frequency statically

ICSE '09 Proceedings of the 31st International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Software testing and analysis are very important research topics in software engineering. We are interested in improving the accuracy of analysis, as well as automation of test generation. In particular, we have been working on the automatic generation of small Orthogonal Arrays which can be used for combinatorial testing, and the computation of path execution frequency for a program path. The basic idea is to reduce the original problems to constraint satisfaction problems and develop effective constraint solving techniques for solving the problems.