Sciweavers

4716 search results - page 614 / 944
» Iterative-free program analysis
Sort
View
165
Voted
SAT
2004
Springer
85views Hardware» more  SAT 2004»
15 years 11 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
IWPC
2003
IEEE
15 years 11 months ago
Automatic Design Pattern Detection
We detect design patterns in legacy code combining static and dynamic analyses. The analyses do not depend on coding or naming conventions. We classify potential pattern instances...
Dirk Heuzeroth, Thomas Holl, Gustav Högstr&ou...
153
Voted
GCC
2003
Springer
15 years 11 months ago
Computing Pool: A Simplified and Practical Computational Grid Model
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
Peng Liu, Yao Shi, Sanli Li
ADAEUROPE
2001
Springer
15 years 11 months ago
OASIS - An ASIS Secondary Library for Analyzing Object-Oriented Ada Code
: ASIS has proven to be an effective platform for developing various program analysis tools. However, in many cases ASIS, as defined in the ASIS dard, appears to be at a very low-l...
Alexey Kuchumov, Sergey Rybin, Alfred Strohmeier
163
Voted
INFOCOM
2000
IEEE
15 years 10 months ago
Heuristics for Internet Map Discovery
— Mercator is a program that uses hop-limited probes—the same primitive used in traceroute—to infer an Internet map. It uses informed random address probing to carefully expl...
Ramesh Govindan, Hongsuda Tangmunarunkit