1147 search results - page 16 / 230 » Termination in language-based systems |
WDAG
2004
Springer
14 years 25 days ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
RTA
2005
Springer
14 years 29 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
TISSEC
2002
13 years 7 months ago
2002
Language runtime systems are increasingly being embedded in systems to support runtime extensibility via mobile code. Such systems raise a number of concerns when the code running...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...