1458 search results - page 3 / 292 » Extended Term Rewriting Systems |
175
Voted
RTA
2011
Springer
14 years 3 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...
CORR
2009
Springer
14 years 10 months ago
2009
Springer
104
Voted
MFCS
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
86
Voted
PLILP
1998
Springer
15 years 4 months ago
1998
Springer
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
87
Voted
ENTCS
2007
15 years 11 days ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...