Sciweavers

141 search results - page 5 / 29
» A type system for certified binaries
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
13 years 7 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
APLAS
2007
ACM
13 years 11 months ago
More Typed Assembly Languages for Confidentiality
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
Dachuan Yu
FLOPS
2010
Springer
14 years 2 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
CIE
2007
Springer
14 years 1 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
CC
2003
Springer
120views System Software» more  CC 2003»
14 years 26 days ago
Run-Time Type Checking for Binary Programs
Abstract. Many important software systems are written in the C programming language. Unfortunately, the C language does not provide strong safety guarantees, and many common progra...
Michael Burrows, Stephen N. Freund, Janet L. Wiene...