Sciweavers

458 search results - page 7 / 92
» Imperative Programming with Dependent Types
Sort
View
POPL
1998
ACM
14 years 24 days ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
CSFW
2004
IEEE
14 years 9 days 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
PPDP
2009
Springer
14 years 3 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi
JLP
2007
86views more  JLP 2007»
13 years 8 months ago
Typing noninterference for reactive programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
Ana Almeida Matos, Gérard Boudol, Ilaria Ca...
LISP
2002
107views more  LISP 2002»
13 years 8 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi