Sciweavers

309 search results - page 23 / 62
» Termination proofs for systems code
Sort
View
ICFP
2002
ACM
14 years 7 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
ENTCS
2008
94views more  ENTCS 2008»
13 years 7 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
13 years 7 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...
ESORICS
2008
Springer
13 years 9 months ago
Code-Carrying Authorization
In authorization, there is often a wish to shift the burden of proof to those making requests, since they may have more resources and more specific knowledge to construct the requi...
Sergio Maffeis, Martín Abadi, Cédric...