1385 search results - page 24 / 277 » Natural Rewriting for General Term Rewriting Systems |
AAECC
2007
Springer
14 years 12 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
103
click to vote
ACTA
2005
14 years 11 months ago
2005
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
ENTCS
2007
14 years 11 months ago
2007
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
129
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
164
click to vote
RTA
2011
Springer
14 years 2 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...