1147 search results - page 49 / 230 » Termination in language-based systems |
LICS
1991
IEEE
14 years 8 days ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
ECEASST
2010
13 years 6 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
ICMCS
2000
IEEE
14 years 1 months ago
2000
IEEE
Interoperability in digital TV is still hampered by proprietary content protection systems. The OPIMA specification offers a generic solution for multimedia terminals, in which th...
ENTCS
2008
13 years 8 months ago
2008
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
USENIX
2007
13 years 11 months ago
2007
Operating system lockup errors can render a computer unusable by preventing the execution other programs. Watchdog timers can be used to recover from a lockup by resetting the pro...