691 search results - page 7 / 139 » Automatically Proving Linearizability |
ISSAC
2005
Springer
14 years 3 months ago
2005
Springer
We define a class of special function inequalities that contains many classical examples, such as the Cauchy-Schwarz inequality, and introduce a proving procedure based on induct...
SEFM
2007
IEEE
14 years 4 months ago
2007
IEEE
We describe a simple and efficient algorithm for proving the termination of a class of loops with nonlinear assignments to variables. The method is based on divergence testing fo...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
OPODIS
2010
13 years 7 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
FROCOS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...