Abstract
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in practice is its inability to handle complex mathematical constraints. To address the problem, we have integrated CORAL’s heuristic solvers into NASA Ames’ Symbolic PathFinder symbolic execution tool. CORAL’s solvers have been designed to deal with mathematical constraints and their heuristics have been improved based on examples from the aerospace domain. This integration significantly broadens the application of Symbolic PathFinder at NASA and in industry.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
CHOCO web page, http://www.emn.fr/z-info/choco-solver/
CVC3 web page, http://www.cs.nyu.edu/acsys/cvc3/
Opt4J web page, http://opt4j.sourceforge.net/
TSAFE maryland, http://www.cs.umd.edu/~mvz/cmsc435-s09/
TSAFE mit, http://sdg.csail.mit.edu/TSAFE/downloads/
Wolfram Alpha web page, http://www.wolframalpha.com/
YICES web page, http://yices.csl.sri.com/
JPF project (2010), http://babelfish.arc.nasa.gov/trac/jpf
Back, T., Eiben, A.E., Vink, M.E.: A superior evolutionary algorithm for 3-SAT. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 125–136. Springer, Heidelberg (1998)
Baresi, L., Lanzi, P.L., Miraz, M.: Testful: An evolutionary test approach for java. In: ICST, pp. 185–194 (2010)
Godefroid, P., Klarlund, N., Sen, K.: DART: Directed Automated Random Testing. In: PLDI, pp. 213–223 (2005)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)
JavaNCSS website. JavaNCSS - A Source Measurement Suite for Java, http://www.kclee.de/clemens/java/javancss/
Kennedy, J., Eberhart, R.: Particle swarm optimization. IEEE Neural Networks, 1942–1948 (1995)
King, J.C.: Symbolic execution and program testing. Communications of ACM 19(7), 385–394 (1976)
Korel, B.: Automated software test data generation. IEEE Transactions on Software Engineering 16(8), 870–879 (1990)
Kroening, D., Strichman, O.: Decision Procedures – an Algorithmic Point of View. In: EATCS. Springer, Heidelberg (2008)
Lakhotia, K., Tillmann, N., Harman, M., de Halleux, J.: FloPSy - search-based floating point constraint solving for symbolic execution. In: Petrenko, A., Simão, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 142–157. Springer, Heidelberg (2010)
Pasareanu, C.S., Schumann, J., Mehlitz, P., Lowry, M., Karasai, G., Nine, H., Neema, S.: Model based analysis and test generation for flight software. In: Proceedings of SMC-IT (2009)
Păsăreanu, C.S., Mehlitz, P.C., Bushnell, D.H., Gundy-Burlet, K., Lowry, M., Person, S., Pape, M.: Combining unit-level symbolic execution and system-level concrete execution for testing nasa software. In: ISSTA, pp. 15–26 (2008)
Takaki, M., Cavalcanti, D., Gheyi, R., Iyoda, J., d’Amorim, M., Prudencio, R.: A comparative study of randomized constraint solvers for random-symbolic testing. In: NFM, pp. 56–65 (2009)
Takaki, M., Cavalcanti, D., Gheyi, R., Iyoda, J., d’Amorim, M., Prudencio, R.: Randomized constraint solvers: a comparative study. Innovations in Systems and Software Engineering (ISSE) 6(3), 243–253 (2010)
Tillmann, N., de Halleux, J.: Pex–white box test generation for.NET. In: Beckert, B., Hähnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134–153. Springer, Heidelberg (2008)
Tonella, P.: Evolutionary testing of classes. In: ISSTA, pp. 119–128 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Souza, M., Borges, M., d’Amorim, M., Păsăreanu, C.S. (2011). CORAL: Solving Complex Constraints for Symbolic PathFinder. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds) NASA Formal Methods. NFM 2011. Lecture Notes in Computer Science, vol 6617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20398-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-20398-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20397-8
Online ISBN: 978-3-642-20398-5
eBook Packages: Computer ScienceComputer Science (R0)