Dynamic Solution of Linear Constraints for Test Case Generation
Abstract
The manual generation of test cases for unit testsis tedious. We have developed the tool Muggl, which generatestest cases based on symbolic execution and constraint solving.Solving constraints for this purpose is no trivial task and greatlyattributes to the total runtime. Hence, we developed a solver forlinear constraints adapted to the special needs of Muggl. It takesinto account the particularities of constraint retrieval throughsymbolic execution. Specifically, it is capable of incrementaladdition and backtracking of constraints. Moreover, we havedeveloped an approach to avoid rounding errors.
Keywords
test-case generation; symbolic execution; Java; constraint solving; simplex algorithm
Cite as
Ernsting, M., Majchrzak, T. A., & Kuchen, H. (2012). Dynamic Solution of Linear Constraints for Test Case Generation. In Margaria, T., Qiu, Z., & Yang, H. (Eds.), 2012 Sixth International Conference on Theoretical Aspects of Software Engineering (pp. 271–274). IEEE.Details
Publication type
Research article in proceedings (conference)
Peer reviewed
Yes
Publication status
Published
Year
2012
Conference
6th International Symposium on Theoretical Aspects of Software Engineering
Venue
Beijing, China
Book title
2012 Sixth International Conference on Theoretical Aspects of Software Engineering
Editor
Margaria Tiziana, Qiu Zongyan, Yang Hongli
Start page
271
End page
274
Publisher
IEEE
Language
English
ISBN
978-0-7695-4751-0