Sciweavers

1760 search results - page 128 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
SCAM
2007
IEEE
15 years 7 months ago
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
Eva Magnusson, Torbjörn Ekman, Görel Hed...
EUROPAR
2004
Springer
15 years 6 months ago
A Data Structure Oriented Monitoring Environment for Fortran OpenMP Programs
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
Edmond Kereku, Tianchao Li, Michael Gerndt, Josef ...
100
Voted
FMOODS
2008
15 years 2 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
PPDP
2010
Springer
14 years 11 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
93
Voted
CC
2007
Springer
15 years 6 months ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...