High-performance just-in-time compilers for Java need to invest considerable effort before actual code generation can commence. This is in part due to the very nature of the Java Virtual Machine, which is not well matched to the requirements of optimizing code generators. Alternative transportation

ABSTRACT. We consider a classical system of point particles interacting by means of a short range potential. We prove that, in the low–density (Boltzmann–Grad) limit, the system behaves, for short times, as predicted by the associated Boltzmann equation. This is a revisitation and an extension

pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios

de modes. Enfin, nous présentons quelques remarques théoriques portant sur l’analyse des modes normaux de suspensions colloïdales près de leur transition de blocage. pastel-00601408, version 1- 17 Jun 2011GLASS TRANSITION AND JAMMING TRANSITION:

work was done when the first author was a graduate student at the Pennsylvania State University EDITED VERSION OF THE ORIGINAL SUBMISSION 2 THE PROBLEM Transportation planning methodology and practice can be greatly enhanced using Geographic Information Systems (GIS). This relatively new technology

Anne SABOURIN Mélanges bayésiens de modèles d'extrêmes multivariés, Application à la prédétermination régionale des crues avec données incomplètes. Sous la direction de:

for discussions and advice. I would like to thank Arnaud Durand and Patrice Ossona de Mendez for accepting to review this thesis and for their constructive comments on the earlier versions of this manuscript. Many thanks to Nicole Bidoit and Victor Vianu for accepting to be in my jury. Special thanks go to my

Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on advanced type-theoretic machinery that is not easily integrated into established theorem provers. We present Mtac, a lightweight but powerful extension to Coq that supports dependently typed tactic programming. Mtac tactics have access to all the features of ordinary Coq programming, as well as a new set of typed tactical primitives. We avoid the need to touch the trusted kernel type-checker of Coq by encapsulating uses of these new tactical primitives in a monad, and instrumenting Coq so that it executes monadic tactics during type inference. 1

Implementational aspects of code-based cryptography

de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: