691 search results - page 38 / 139 » Automatically Proving Linearizability |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
ITP
2010
14 years 1 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
ICFEM
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its automation is highly desirable, despite the fact ...
APLAS
2005
ACM
14 years 3 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
ECSQARU
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. This paper discusses the relationship between incidence calculus and the ATMS. It shows that managing labels for statements in an ATMS is similar to producing the inciden...