École Polytechnique

Research Coordinator (2010)

José Côté, Ph. D, Hc J, Université De Montréal, Université De Montréal, Université De Montréal, ...

A nursing virtual intervention: Real-time support for managing antiretroviral therapy The advent of a powerful antiretroviral therapy in 1996 and the subsequent availability of adequate prophylaxis...

Focusing in Asynchronous Games (2010)

Samuel Mimram, Cea List, École Polytechnique

Abstract. Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on...

Categories and Subject Descriptors: F.3.3 [LOGICS AND MEANINGS OF PROGRAMS]: (2010)

Alexis Saurin, Inria Saclay, École Polytechnique

Λµ-calculus is a Böhm-complete extension of Parigot's λµ-calculus closely related with delimited control in functional programming. In this paper, we investigate the meta-theory of untyped...

Julien Cretin (2010)

Barbosa M. J, Davi Cretin, Julien Foster Nate, Greenberg Michael, Benjamin C. Pierce, Ecole Polytechnique, ...

Bidirectional programming languages have been proposed as a practical approach to the view update problem. Programs in these languages, often called lenses, can be read in two ways— from left to...

Overseeing Professor/Verantwortlicher Hochschullehrer: (2009)

Technische Universität Dresden, Fakultät Informatik, Armin Troy, Dr. Lutz, Straßburger Inria Futurs, École Polytechnique, ...

Hybrid logic is an extension of modal logic which allows to access the states of a Kripke structure directly from within the logic. This is achieved with nominals which are an additional kind of...

Critical Sections: Re-emerging Scalability Concerns for Database Storage Engines (2009)

Ryan Johnson, Is Anastasia Ailamaki, École Polytechnique, Fédérale Lausanne

Critical sections in database storage engines impact performance and scalability more as the number of hardware contexts per chip continues to grow exponentially. With enough threads in the system,...

Relatively Quantified Constraint Satisfaction (2009)

Manuel Bodirsky, École Polytechnique, Hubie Chen

The constraint satisfaction problem (CSP) is a convenient framework for modelling search problems; the CSP involves deciding, given a set of constraints on variables, whether or not there is an...

On Dissipation-Induced Destabilization and Brake Squeal: A Perspective using Structured (2009)

Patrick Kessler, Oliver M. O’reilly, Anne-lise Raphael B, Maciej Zworski C, École Polytechnique, Palaiseau Cedex

Numerous linearizations of mechanical systems feature non-normal operators. This is particularly the case in follower force systems, gyroscopic systems and models for squealing brakes. In this paper,...

Thesis Committee: (2009)

Sean Mclaughlin, Jeremy Avigad, Robert Harper, Dale Miller, Frank Pfenning (chair, André Platzer, ...

Mechanically checked, formal reasoning as envisioned by Leibniz has in the past few decades become a reality. Proof assistants are programs that can rigorously and mechanically check the details of...

Abstract A game semantics for proof search: Preliminary results 1 (2008)

Dale Miller, Alexis Saurin, École Polytechnique

We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contains one element for...

Quotient lenses (2008)

J. Nathan Foster, Alexandre Pilkiewicz, École Polytechnique, Benjamin C. Pierce

There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reverse transformation...

Quotient lenses (2008)

J. Nathan Foster, Alexandre Pilkiewicz, École Polytechnique, Benjamin C. Pierce

There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reverse transformation...

Polarities in Theorem Proving and Logic Programming (2007)

Kaustuv Chaudhuri, Inria Futurs, École Polytechnique

Andreoli famously observed [1] that the logical connectives divide precisely into two polarities determined by their inference rules in the sequent calculus. Connectives of the negative polarity,...

On Feature Traceability in Object Oriented Programs (2005)

Giuliano Antoniol, Ettore Merlo, École Polytechnique, Yann-gaël Guéhéneuc, Houari Sahraoui

Open-source and industrial software systems often lack upto-date documents on the implementation of user-observable functionalities. This lack of documents is particularly hindering for large...