By Topic

Specification analysis and test data generation by solving Boolean combinations of numeric constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jian Zhang ; Inst. of Software, Acad. Sinica, Beijing, China

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

Published in:

Quality Software, 2000. Proceedings. First Asia-Pacific Conference on

Date of Conference: