Paper Info
Title
Specification analysis and test data generation by solving Boolean combinations of numeric constraints
Abstract
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
Year
DOI
Venue
2000
10.1109/APAQ.2000.883800
APAQS
Keywords
Field
DocType
numeric constraints,non-linear constraint,boolean logic reasoning,boolean constraint solver,boolean algebra,requirement specifications,test data generation,linear programming,computability,satisfiability,specification analysis,new tool,bound propagation,problem instance,boolean combination,enumerated type,software test data generation,boolean combinations,formal specification,programming,data analysis,linear program,debugging,boolean functions,computer bugs,computer science,software testing
Maximum satisfiability problem,Boolean circuit,Computer science,Boolean satisfiability problem,Theoretical computer science,Product term,Boolean algebra,Boolean data type,And-inverter graph,Boolean expression
Conference
ISBN
Citations 
PageRank 
0-7695-0825-1
17
1.45
References 
Authors
15
1
Name
Order
Citations
PageRank
Jian Zhang1605.20