288 search results - page 11 / 58 » Interactive Termination Proofs Using Termination Cores |
DAC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
GRAPHICSINTERFACE
2001
14 years 10 months ago
2001
Meeting the increasing demand for desktop-like applications on mobile products requires powerful interaction techniques. One candidate is GUI-style point-andclick interaction usin...
TOPLAS
2008
14 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
RTA
2007
Springer
15 years 3 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
83
Voted
SAS
2010
Springer
14 years 7 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...