19 search results - page 1 / 4 » Generalizing Redundancy Elimination in Checking Sequences |
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
114
Voted
IMC
2010
ACM
14 years 8 months ago
2010
ACM
Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous...
83
Voted
ISSRE
2008
IEEE
15 years 4 months ago
2008
IEEE
As software systems evolve, the size of their test suites grow due to added functionality and customer-detected defects. Many of these tests may contain redundant elements with pr...
IBERAMIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
75
Voted
ASPLOS
2010
ACM
15 years 5 months ago
2010
ACM
This paper introduces a new abstraction to accelerate the readbarriers and write-barriers used by language runtime systems. We exploit the fact that, dynamically, many barrier exe...