4719 search results - page 209 / 944 » Newtonian program analysis |
117
click to vote
LREC
2008
15 years 6 months ago
2008
Terminology extraction commonly includes two steps: identification of term-like units in the texts, mostly multi-word phrases, and the ranking of the extracted term-like units acc...
264
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
243
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
136
click to vote
ACSAC
2007
IEEE
15 years 11 months ago
2007
IEEE
Understanding security bugs in a vulnerable program is a non-trivial task, even if the target program is known to be vulnerable. Though there exist debugging tools that facilitate...
172
click to vote
ICPADS
1994
IEEE
15 years 8 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...