Solving Constraints over Floating-Point Numbers
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Symbolic execution of floating-point computations: Research Articles
Software Testing, Verification & Reliability
Test Selection Strategies for Lustre Descriptions in GATeL
Electronic Notes in Theoretical Computer Science (ENTCS)
PathCrawler: automatic generation of path tests by combining static and dynamic analysis
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Boosting local consistency algorithms over floating-point numbers
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Refining abstract interpretation based value analysis with constraint programming techniques
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Behind the scenes in SANTE: a combination of static and dynamic analyses
Automated Software Engineering
| Hi-index | 0.00 |
Solving constraints over the floating point numbers is a key issue in the process of software validation and verification. Techniques to solve such constraints on the basis of projection functions have been successfully developed. However, though correct, this approach can lead to slow convergence phenomena for very common constraints like addition and subtraction constraints. In this paper, we introduce new addition and subtraction constraints which, thanks to a new floating point subtraction property, directly compute optimal bounds for the domain of the variables at a low cost. Preliminary experiments have shown that these constraints can drastically speed up the filtering process.