556 search results - page 56 / 112 » Pair Programming: Not for Everyone |
248
Voted
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
159
click to vote
SP
2009
IEEE
15 years 10 months ago
2009
IEEE
Malware authors have recently begun using emulation technology to obfuscate their code. They convert native malware binaries into bytecode programs written in a randomly generated...
123
click to vote
BIBM
2008
IEEE
15 years 10 months ago
2008
IEEE
We develop a parallel algorithm for a widely used whole genome alignment method called LAGAN. We use the MPI-based protocol to develop parallel solutions for two phases of the alg...
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
130
click to vote
BIOCOMP
2006
15 years 5 months ago
2006
Stochastic context-free grammar (SCFG) based models for non-coding RNA (ncRNA) gene searches are much more powerful than regular grammar based models due to the ability to model in...