1940 search results - page 130 / 388 » Graph Transformation with Variables |
106
click to vote
SLP
1997
15 years 4 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
131
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
2008
IEEE-ACM
Software product line engineering is mostly about the systematic management of commonality and variability between product line members. The effectiveness of this approach thus ve...
145
Voted
JIPS
2007
15 years 3 months ago
2007
: Although the Java bytecode has numerous advantages, it also has certain shortcomings such as its slow execution speed and difficulty of analysis. In order to overcome such disadv...
110
Voted
FLAIRS
2003
15 years 4 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
109
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...