3456 search results - page 250 / 692 » Byte Code Engineering |
146
Voted
AMAST
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we present a novel approach that establishes a synergy between static and dynamic analyses for detecting memory errors in C code. We extend the standard C type syste...
137
Voted
ISSTA
2010
ACM
15 years 5 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
153
click to vote
COMPSAC
2009
IEEE
15 years 4 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
147
Voted
COMPSAC
2010
IEEE
15 years 1 months ago
2010
IEEE
An important goal of automatic testing techniques, including random testing is to achieve high code coverage with a minimum set of test cases. To meet this goal, random testing res...
149
Voted
ICSE
2008
IEEE-ACM
16 years 4 months ago
2008
IEEE-ACM
According to Parnas's information hiding principle and Baldwin and Clark's design rule theory, the key step to decomposing a system into modules is to determine the desi...