NASA Formal Methods

Volume 6617 of the series Lecture Notes in Computer Science pp 359-374

CORAL: Solving Complex Constraints for Symbolic PathFinder

  • Matheus SouzaAffiliated withFederal University of Pernambuco
  • , Mateus BorgesAffiliated withFederal University of Pernambuco
  • , Marcelo d’AmorimAffiliated withFederal University of Pernambuco
  • , Corina S. PăsăreanuAffiliated withCMU SV/NASA Ames Research Center

* Final gross prices may vary according to local VAT.

Get Access


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.