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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Souza, M., Borges, M., D’Amorim, M., & Pǎsǎreanu, C. S. (2011). CORAL: Solving complex constraints for symbolic pathfinder. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6617 LNCS, pp. 359–374). https://doi.org/10.1007/978-3-642-20398-5_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
