Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...
Abstract We define a notion of context that represents invariant, stable-over-time behavior in an environment and we propose an algorithm for detecting context changes in a stream ...
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Systems of autonomous agents providing automated services over the Web are fast becoming a reality. Often these agent systems are constructed using procedural architectures that pr...
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...
Martin Wildmoser, Tobias Nipkow, Gerwin Klein, Seb...