492 search results - page 65 / 99 » XML graphs in program analysis |
121
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
123
click to vote
HICSS
1995
IEEE
15 years 5 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
137
click to vote
PEPM
2010
ACM
15 years 10 months ago
2010
ACM
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
118
click to vote
PLDI
1990
ACM
15 years 6 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
117
click to vote
FLAIRS
2006
15 years 3 months ago
2006
Intelligent Tutoring Systems, while effective at producing student learning [2,7], are notoriously costly to construct [1,9], and require PhD level experience in cognitive science...