456 search results - page 29 / 92 » A Proof System for Abstract Non-interference |
TPHOL
2008
IEEE
14 years 3 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
MKM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type ...
RTA
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
ICFEM
2007
Springer
14 years 14 days ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...