Sciweavers

492 search results - page 56 / 99
» XML graphs in program analysis
Sort
View
134
Voted
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 8 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
141
Voted
ECML
2007
Springer
15 years 8 months ago
Using Text Mining and Link Analysis for Software Mining
Many data mining techniques are these days in use for ontology learning – text mining, Web mining, graph mining, link analysis, relational data mining, and so on. In the current ...
Miha Grcar, Marko Grobelnik, Dunja Mladenic
104
Voted
UM
2007
Springer
15 years 8 months ago
Exploiting Evidence Analysis in Plan Recognition
Information graphics, such as bar charts and line graphs, that appear in popular media generally have a message that they are intended to convey. We have developed a novel plan inf...
Sandra Carberry, Stephanie Elzer
ICS
1995
Tsinghua U.
15 years 6 months ago
Gated SSA-based Demand-Driven Symbolic Analysis for Parallelizing Compilers
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
Peng Tu, David A. Padua
141
Voted
PLDI
2012
ACM
13 years 5 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...