2137 search results - page 175 / 428 » Proving Abstract Non-interference |
144
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
121
Voted
ALT
2006
Springer
16 years 5 days ago
2006
Springer
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
131
Voted
SOFSEM
2010
Springer
16 years 3 days ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
100
click to vote
TACAS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
154
click to vote
FLOPS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...