1716 search results - page 74 / 344 » Proving Conditional Termination |
130
Voted
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
129
Voted
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
115
click to vote
BIRTHDAY
2006
Springer
15 years 6 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
136
Voted
CAV
2001
Springer
15 years 6 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
135
click to vote
ESOP
2008
Springer
15 years 4 months ago
2008
Springer
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...