99 search results - page 2 / 20 » Proving Self-Stabilization with a Proof Assistant |
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
CEFP
2007
Springer
13 years 11 months ago
2007
Springer
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
TPHOL
2000
IEEE
13 years 9 months ago
2000
IEEE
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
ICST
2009
IEEE
13 years 2 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
PROVSEC
2007
Springer
13 years 11 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...