Sciweavers

184 search results - page 25 / 37
» A Formal Framework for Mutation Testing
Sort
View
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 3 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
CVPR
2005
IEEE
14 years 9 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
ICDM
2007
IEEE
158views Data Mining» more  ICDM 2007»
14 years 2 months ago
On Appropriate Assumptions to Mine Data Streams: Analysis and Practice
Recent years have witnessed an increasing number of studies in stream mining, which aim at building an accurate model for continuously arriving data. Somehow most existing work ma...
Jing Gao, Wei Fan, Jiawei Han
TVLSI
2008
151views more  TVLSI 2008»
13 years 7 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi