Sciweavers

159 search results - page 17 / 32
» Verifying the Equivalence of Logic Programs in the Disjuncti...
Sort
View
POPL
2009
ACM
14 years 10 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
POPL
2005
ACM
14 years 10 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic
ICFP
2010
ACM
13 years 11 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
ISSTA
2004
ACM
14 years 3 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
APSEC
2008
IEEE
13 years 11 months ago
A Verification Framework for FBD Based Software in Nuclear Power Plants
Formal verification of Function Block Diagram (FBD) based software is an essential task when replacing traditional relay-based analog system with PLC-based software in nuclear rea...
Junbeom Yoo, Sung Deok Cha, Eunkyoung Jee