Sciweavers

33 search results - page 2 / 7
» Augur 2 - A New Version of a Tool for the Analysis of Graph ...
Sort
View
FAST
2011
12 years 8 months ago
Making the Common Case the Only Case with Anticipatory Memory Allocation
We present Anticipatory Memory Allocation (AMA), a new method to build kernel code that is robust to memoryallocation failures. AMA avoids the usual difficulties in handling allo...
Swaminathan Sundararaman, Yupu Zhang, Sriram Subra...
RTA
2011
Springer
12 years 8 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
BMCBI
2010
162views more  BMCBI 2010»
13 years 5 months ago
SNP-RFLPing 2: an updated and integrated PCR-RFLP tool for SNP genotyping
Background: PCR-restriction fragment length polymorphism (RFLP) assay is a cost-effective method for SNP genotyping and mutation detection, but the manual mining for restriction e...
Hsueh-Wei Chang, Yu-Huei Cheng, Li-Yeh Chuang, Che...
AI
2009
Springer
13 years 12 months ago
Exploratory Analysis of Co-Change Graphs for Code Refactoring
Abstract. Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS ha...
Hassan Khosravi, Recep Colak
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 3 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...