1204 search results - page 29 / 241 » Termination of Polynomial Programs |
ICFP
2012
ACM
12 years 1 months ago
2012
ACM
When termination of a program is observable by an adversary, confidential information may be leaked by terminating accordingly. While this termination covert channel has limited ...
FROCOS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
ICALP
2005
Springer
14 years 4 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...
HICSS
2003
IEEE
14 years 4 months ago
2003
IEEE
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
ESSLLI
2009
Springer
13 years 8 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...