#### Filter Results:

- Full text PDF available (177)

#### Publication Year

1979

2017

- This year (17)
- Last 5 years (88)
- Last 10 years (138)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gilles Barthe, Maria João Frade, Eduardo Giménez, Luís Pinto, Tarmo Uustalu
- Mathematical Structures in Computer Science
- 2004

This paper introduces λ̂ , a simply typed lambda calculus supporting inductive types and recursive function definitions with termination ensured by types. The system is shown to enjoy subject reduction, strong normalisation of typable terms and to be stronger than a related system λG in which termination is ensured by a syntactic guard condition. The system… (More)

- Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk
- Proceedings. 17th IEEE Computer Security…
- 2004

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 program assumes a separation between secret inputs and public inputs on the one hand, and secret outputs and public outputs on the other hand, and requires that the value of public… (More)

- Gilles Barthe, Benjamin Grégoire, Romain Janvier, Santiago Zanella Béguelin
- IACR Cryptology ePrint Archive
- 2007

As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-based techniques provide a popular approach in which proofs are structured as sequences of games and in which proof steps establish the validity of transitions between successive… (More)

- Gilles Barthe, Boris Köpf, Federico Olmedo, Santiago Zanella Béguelin
- ACM Trans. Program. Lang. Syst.
- 2012

Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential privacy guarantees for real programs is a difficult and error-prone task that calls for principled approaches and tool support. Approaches based on linear types and static analysis have… (More)

- Gilles Barthe, David Pichardie, Tamara Rezk
- ESOP
- 2007

Non-interference guarantees the absence of illicit information flow throughout program execution. It can be enforced by appropriate information flow type systems. Much of previous work on type systems for non-interference has focused on calculi or high-level programming languages, and existing type systems for low-level languages typically omit objects,… (More)

We present an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a proof as a sequence of games and hints. Proof sketches are checked automatically using off-the-shelf SMT solvers and automated theorem provers, and then compiled into verifiable proofs in the… (More)

Relational program logics are formalisms for specifying and verifying properties about two programs or two runs of the same program. These properties range from correctness of compiler optimizations or equivalence between two implementations of an abstract data type, to properties like non-interference or determinism. Yet the current technology for… (More)

- Gilles Barthe, Morten Heine Sørensen
- J. Funct. Program.
- 1997

Pure type systems make use of domain-full-abstractions x : D : M. We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free-abstractions x : M. Domain-free pure type systems have a number of advantages over both pure type systems and so-called type assignment systems (they also have some disadvantages) and have… (More)

- Gilles Barthe, Tamara Rezk
- TLDI
- 2005

We define an information flow type system for a sequential JVM-like language that includes classes, objects, and exceptions. Furthermore, we show that it enforces non-interference. Our work provides, to our best knowledge, the first analysis that has been shown to guarantee non-interference for a realistic low level language.

- Gilles Barthe, Horatiu Cirstea, Claude Kirchner, Luigi Liquori
- POPL
- 2003

We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction application with built-in matching facilities. This framework, that we call "<i>Pure Pattern Type Systems</i>", is particularly well-suited for the foundations of programming (meta)languages… (More)