Sciweavers

4716 search results - page 155 / 944
» Iterative-free program analysis
Sort
View
ICSE
2001
IEEE-ACM
15 years 6 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
145
Voted
JMLR
2008
169views more  JMLR 2008»
15 years 2 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
CAV
2007
Springer
104views Hardware» more  CAV 2007»
15 years 8 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
ENTCS
2002
73views more  ENTCS 2002»
15 years 2 months ago
Reducing the Overhead of Dynamic Analysis
Dynamic analysis (instrumenting programs with code to detect and prevent errors during program execution) can be an effective approach to debugging, as well as an effective means ...
Suan Hsi Yong, Susan Horwitz
113
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...