Sciweavers

4491 search results - page 189 / 899
» Algorithm Engineering
Sort
View
134
Voted
AMOST
2005
ACM
15 years 8 months ago
Test prioritization for pairwise interaction coverage
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
AOSD
2007
ACM
15 years 6 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
105
Voted
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 6 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
ESSOS
2009
Springer
15 years 9 months ago
Report: Extensibility and Implementation Independence of the .NET Cryptographic API
Abstract. When a vulnerability is discovered in a cryptographic algorithm, or in a specific implementation of that algorithm, it is important that software using that algorithm or...
Pieter Philippaerts, Cédric Boon, Frank Pie...
ISSTA
1998
ACM
15 years 6 months ago
On the Limit of Control Flow Analysis for Regression Test Selection
Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will have the same behavior as an old version of the prog...
Thomas Ball