691 search results - page 61 / 139 » Automatically Proving Linearizability |
CCS
2008
ACM
13 years 12 months ago
2008
ACM
Proving that particular methods within a code base are functionally pure--deterministic and side-effect free--would aid verification of security properties including function inve...
POPL
2011
ACM
13 years 24 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
SAS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...