691 search results - page 117 / 139 » Automatically Proving Linearizability |
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
RTA
2007
Springer
14 years 4 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...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
ICTAC
2004
Springer
14 years 3 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
FSTTCS
2003
Springer
14 years 3 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...