Sciweavers

154 search results - page 12 / 31
» Cryptographically Sound Theorem Proving
Sort
View
APAL
2010
92views more  APAL 2010»
13 years 5 months ago
The eskolemization of universal quantifiers
This paper is a sequel to the papers [4, 6] in which an alternative skolemization method called ekolemization was introduced that, when applied to the strong existential quantifie...
Rosalie Iemhoff
APLAS
2006
ACM
14 years 1 months ago
Computational Secrecy by Typing for the Pi Calculus
We define and study a distributed cryptographic implementation for an asynchronous pi calculus. At the source level, we adapt simple type systems designed for establishing formal ...
Martín Abadi, Ricardo Corin, Cédric ...
ICFP
2005
ACM
14 years 7 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
POPL
2005
ACM
14 years 8 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
LPAR
2004
Springer
14 years 1 months ago
The Inverse Method for the Logic of Bunched Implications
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...