1385 search results - page 63 / 277 » Natural Rewriting for General Term Rewriting Systems |
165
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
188
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
156
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
147
click to vote
APBC
2004
15 years 7 months ago
2004
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
170
click to vote
BIRTHDAY
2006
Springer
15 years 9 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...