596 search results - page 4 / 120 » Complexity Analysis by Graph Rewriting |
RTA
2011
Springer
12 years 10 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
ACSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
Software component technology facilitates the costeffective development of specialized applications. Nevertheless, due to the high number of principals involved in a component-str...
FMCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...