Publication | Closed Access
Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving
40
Citations
20
References
2013
Year
Unknown Venue
EngineeringVerificationTest Data GenerationSoftware EngineeringComputational ComplexitySoftware AnalysisFormal VerificationComputational TestingSat SolvingTest AutomationSystems EngineeringTight BoundsCombinatorial OptimizationSatisfiabilityTest GenerationComputer EngineeringIncremental SatComputer ScienceProgram AnalysisSoftware TestingAutomated Test GenerationFormal MethodsCombinatorial Testing WorkflowTest Evolution
We present a novel and general technique for automated test generation that combines tight bounds with incremental SAT solving. The proposed technique uses incremental SAT to build test suites targeting a specific testing criterion, amongst various black-box and white-box criteria. As our experimental results show, the combination of tight bounds with incremental SAT, and the testing criterion driven approach implemented in our prototype tool FAJITA, enable us to effectively generate test suites for container classes with rich contracts, more efficiently than other state-of-the-art tools.
| Year | Citations | |
|---|---|---|
Page 1
Page 1