325 search results - page 5 / 65 » Rewriting Strategies in Java |
CAV
2012
Springer
11 years 9 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...
ENTCS
2008
13 years 7 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
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...
MODELS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
LPAR
2005
Springer
14 years 17 days ago
2005
Springer