654 search results - page 11 / 131 » Matrix Graph Grammars |
98
Voted
RSA
2008
15 years 2 months ago
2008
131
Voted
GG
2010
Springer
15 years 2 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
117
click to vote
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
87
Voted
ACL
2000
15 years 4 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
132
Voted
TSE
2010
15 years 1 months ago
2010
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...