Sciweavers

492 search results - page 24 / 99
» XML graphs in program analysis
Sort
View
ICALP
2001
Springer
15 years 11 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
DOCENG
2003
ACM
15 years 11 months ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
GPEM
2008
116views more  GPEM 2008»
15 years 6 months ago
An Eigen analysis of the GP community
The coauthorship and coeditorship relations as recorded in the genetic programming bibliography provide a quantitative view of the GP community. Eigen analysis is used to find the ...
William B. Langdon, Riccardo Poli, Wolfgang Banzha...
ICSM
2008
IEEE
16 years 25 days ago
Change impact analysis for AspectJ programs
Change impact analysis is a useful technique for software evolution. It determines the effects of a source editing session and provides valuable feedbacks to the programmers for m...
Sai Zhang, Zhongxian Gu, Yu Lin, Jianjun Zhao
ECOOP
1995
Springer
15 years 10 months ago
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
Optimizing compilers for object-oriented languages apply static class analysis and other techniques to try to deduce precise information about the possible classes of the receivers...
Jeffrey Dean, David Grove, Craig Chambers