Model-Based Testing of Concurrent Programs with Predicate Sequencing Constraints
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Volume Computation for Boolean Combination of Linear Arithmetic Constraints
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Theory decision by decomposition
Journal of Symbolic Computation
Finding relations among linear constraints
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
A novel requirement analysis approach for periodic control systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
In the analysis of state-based requirement specifications and in software test data generation, one often has to determine the satisfiability of Boolean combinations of numeric constraints. Theoretically, this problem is undecidable, and practically many problem instances are very difficult. In this paper, an extension to a Boolean constraint solver is described. The new tool can deal with variables of other types (including the enumerated type, integers and reals). It combines Boolean logic reasoning with linear programming and bound propagation. Non-linear constraints are allowed, but the solving method is incomplete. Experimental results show that the tool can be quite useful in testing specifications as well as procedural code.