203 search results - page 21 / 41 » Datatype-Generic Termination Proofs |
101
click to vote
RTA
2007
Springer
15 years 8 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
105
click to vote
TOPLAS
2008
15 years 1 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
122
click to vote
SAC
2009
ACM
15 years 6 months ago
2009
ACM
The firmware of an electronic voting machine is typically treated as a “trusted” component of the system. Consequently, it is misconstrued to be vulnerable only to an insider...
123
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
105
click to vote
ENTCS
2000
15 years 1 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...