1274 search results - page 19 / 255 » New Proofs for |
CORR
2007
Springer
15 years 14 days ago
2007
Springer
— 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...
199
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
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...
112
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
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...
118
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
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...
95
Voted
ROOM
2000
15 years 1 months ago
2000
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...