Automatic test data generation using constraint solving techniques
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Solving Constraints over Floating-Point Numbers
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A CLP Framework for Computing Structural Test Data
CL '00 Proceedings of the First International Conference on Computational Logic
Safe bounds in linear and mixed-integer linear programming
Mathematical Programming: Series A and B
Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
SIAM Journal on Numerical Analysis
Safe and tight linear estimators for global optimization
Mathematical Programming: Series A and B
Symbolic execution of floating-point computations: Research Articles
Software Testing, Verification & Reliability
Accelerating high-level bounded model checking
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Varieties of Static Analyzers: A Comparison with ASTREE
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
A Sound Floating-Point Polyhedra Abstract Domain
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Bounded model checking of software using SMT solvers instead of SAT solvers
International Journal on Software Tools for Technology Transfer (STTT)
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Improving the floating point addition and subtraction constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A logical product approach to zonotope intersection
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
IEEE Transactions on Software Engineering
Eventual linear ranking functions
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Hi-index | 0.00 |
Solving constraints over floating-point numbers is a critical issue in numerous applications notably in program verification. Capabilities of filtering algorithms over the floating-point numbers ($\mathcal{F}$) have been so far limited to 2b-consistency and its derivatives. Though safe, such filtering techniques suffer from the well known pathological problems of local consistencies, e.g., inability to efficiently handle multiple occurrences of the variables. These limitations also have their origins in the strongly restricted floating-point arithmetic. To circumvent the poor properties of floating-point arithmetic, we propose in this paper a new filtering algorithm, called FPLP, which relies on various relaxations over the real numbers of the problem over $\mathcal{F}$. Safe bounds of the domains are computed with a mixed integer linear programming solver (MILP) on safe linearizations of these relaxations. Preliminary experiments on a relevant set of benchmarks are promising and show that this approach can be effective for boosting local consistency algorithms over $\mathcal{F}$.