328 search results - page 5 / 66 » Simple Termination Revisited |
CAV
2004
Springer
14 years 27 days ago
2004
Springer
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
DEDUCTIVE
1994
13 years 8 months ago
1994
Recent advances in non-monotonic semantics of deductive databases provide a simple framework for modeling the even-condition-action rules of active databases. This approach unifie...