1485 search results - page 32 / 297 » Whole Program Paths |
PLDI
2004
ACM
14 years 1 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...
CC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
GBRPR
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a novel approach to the smart execution of scenario-based models of reactive systems, such as those resulting from the multi-modal inter-object language of live sequen...
CASES
2005
ACM
13 years 9 months ago
2005
ACM
Embedded systems are being deployed as a part of critical infrastructures and are vulnerable to malicious attacks due to internet accessibility. Intrusion detection systems have b...