Sciweavers

122 search results - page 12 / 25
» Completeness of Pointer Program Verification by Separation L...
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 8 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
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...
ICFP
2003
ACM
14 years 7 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
PTS
2008
109views Hardware» more  PTS 2008»
13 years 9 months ago
Runtime Verification of C Programs
We present in this paper a framework, RMOR, for monitoring the execution of C programs against state machines, expressed in a textual (nongraphical) format in files separate from t...
Klaus Havelund
CSFW
2004
IEEE
13 years 11 months ago
Secure Information Flow by Self-Composition
Non-interference is a high-level security property that guarantees the absence of illicit information leakages through executing programs. More precisely, non-interference for a p...
Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk