1204 search results - page 89 / 241 » Termination of Polynomial Programs |
109
click to vote
LPAR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
120
Voted
CLIMA
2004
15 years 2 months ago
2004
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
104
Voted
ENTCS
2008
15 years 22 days ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
101
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
85
Voted
IWMM
2004
Springer
15 years 6 months ago
2004
Springer
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...