Sciweavers

1310 search results - page 19 / 262
» On a Class of Traceability Codes
Sort
View
OOPSLA
2009
Springer
14 years 2 months ago
Minimizing dependencies within generic classes for faster and smaller programs
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
Dan Tsafrir, Robert W. Wisniewski, David F. Bacon,...
ISESE
2006
IEEE
14 years 1 months ago
Identifying domain-specific defect classes using inspections and change history
We present an iterative, reading-based methodology for analyzing defects in source code when change history is available. Our bottom-up approach can be applied to build knowledge ...
Taiga Nakamura, Lorin Hochstein, Victor R. Basili
CSMR
2005
IEEE
14 years 1 months ago
Characterizing the Evolution of Class Hierarchies
Analyzing historical information can show how a software system evolved into its current state, which parts of the system are stable and which have changed more. However, historic...
Tudor Gîrba, Michele Lanza, Stéphane ...
AAECC
2007
Springer
127views Algorithms» more  AAECC 2007»
13 years 7 months ago
Skew-cyclic codes
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...
Delphine Boucher, Willi Geiselmann, Felix Ulmer
ECCC
2010
91views more  ECCC 2010»
13 years 7 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan