Sciweavers

1274 search results - page 19 / 255
» New Proofs for
Sort
View
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
A Simple Proof of the Entropy-Power Inequality via Properties of Mutual Information
— While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon’s entropy power inequality (EPI) seems...
Olivier Rioul
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
POPL
2010
ACM
14 years 5 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
PLDI
2009
ACM
14 years 2 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
ROOM
2000
13 years 9 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark