1716 search results - page 21 / 344 » Proving Conditional Termination |
POPL
2009
ACM
14 years 9 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
LOGCOM
2007
13 years 8 months ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
CAV
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
LISP
2002
13 years 8 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...