Sciweavers

169 search results - page 11 / 34
» Which Languages Have 4-Round Zero-Knowledge Proofs
Sort
View
CCS
2004
ACM
14 years 28 days ago
Formally verifying information flow type systems for concurrent and thread systems
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
Gilles Barthe, Leonor Prensa Nieto
TPHOL
2003
IEEE
14 years 24 days ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
IWFM
1998
13 years 9 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 5 months ago
A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
Mads Dam, Andreas Lundblad
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 5 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...