31 search results - page 2 / 7 » Extending Graph Rewriting for Refactoring |
RELMICS
1997
Springer
13 years 9 months ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
AISC
2008
Springer
13 years 6 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
AGTIVE
2003
Springer
13 years 10 months ago
2003
Springer
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...