691 search results - page 16 / 139 » Automatically Proving Linearizability |
SIAMCOMP
2000
13 years 9 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
ICLP
1997
Springer
14 years 2 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...