99 search results - page 13 / 20 » Proving Self-Stabilization with a Proof Assistant |
SCP
2008
13 years 7 months ago
2008
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
FTRTFT
1998
Springer
13 years 11 months ago
1998
Springer
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
FMOODS
2008
13 years 9 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...