Sciweavers

406 search results - page 39 / 82
» Boosting Using Branching Programs
Sort
View
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
14 years 2 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...
SIGSOFT
1998
ACM
14 years 3 months ago
Further Empirical Studies of Test Effectiveness
This paper reports on an empirical evaluation of the fault-detecting ability of two white-box software testing techniques: decision coverage (branch testing) and the all-uses data...
Phyllis G. Frankl, Oleg Iakounenko
VEE
2006
ACM
150views Virtualization» more  VEE 2006»
14 years 4 months ago
Evaluating fragment construction policies for SDT systems
Software Dynamic Translation (SDT) systems have been used for program instrumentation, dynamic optimization, security policy enforcement, intrusion detection, and many other uses....
Jason Hiser, Daniel Williams, Adrian Filipi, Jack ...
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 4 months ago
Predicate Expression Cost Functions to Guide Evolutionary Search for Test Data
Several researchers are using evolutionary search methods to search for test data with which to test a program. The fitness or cost function depends on the test goal but almost in...
Leonardo Bottaci
ESOP
2001
Springer
14 years 3 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing