Section: Other Grants and Activities
INFER: ANR on the Theory and Application of Deep Inference
The ANR-project Blanc titled “INFER: Theory and Application of Deep Inference” that is coordinated by Lutz Straßburger has been accepted in September 2006. Besides Parsifal, the teams associated with this effort are represented by François Lamarche (INRIA-Loria) and Michel Parigot (CNRS-PPS). Among the list of theoretical problems there is the fundamental need for a theory of correct identification of proofs, and its corollary, the development of a really general and flexible approach to proof nets. A closely related problem is the extension of the Curry-Howard isomorphism to these new representations. Among the list of more practical problems to be consider is the question of strategy and complexity in proof search, in particular for higher order systems. These questions are intimately related to how proofs themselves are formulated in these systems. Given their common grounding in rewriting theory, the proposal plans to deepen the relationship between deep inference and well established techniques like deduction modulo and unification for quantifiers. The proposal also plans to explore the formulation and use of more “exotic” logical systems, for example, non-commutative logics, that have interesting applications, such as in linguistics and quantum computing.
PSI: ANR on Proof Search control in Interaction with domain-specific methods
Participant : Stéphane Lengrand.
Stephane Lengrand is the scientific leader of the ANR-project Jeunes chercheurs entitled “Proof Search control in Interaction with domain-specific methods”, which was accepted in April 2009. Other founding members are among the INRIA project-team “TypiCal” : G. Faure and A. Mahboubi. Since the project started, Ph.D. student has joined the project's research effort, and funding is available for a one-year post-doc and a three-year Ph.D., both starting in September 2010.
CPP: ANR on Confidence, Proofs, and Probabilities
The ANR Blanc titled “CPP: Confidence, Proofs, and Probabilities” has started 1 October 2009. This grant brings together the following institutions and individuals: LSV (Jean Goubault-Larrecq), CEA LIST (Eric Goubault, Olivier Bouissou, and Sylvie Putot), INRIA Saclay (Catuscia Palamidessi, Dale Miller, and Stephane Gaubert), Supelec L2S (Michel Kieffer and Eric Walter), and Supelec SSE (Gilles Fleury and Daniel Poulton). This project proposes to study the joint use of probabilistic and formal (deterministic) semantics and analysis methods, in a way to improve the applicability and precision of static analysis methods on numerical programs. The specific long-term focus is on control programs, e.g., PID (proportional-integral-derivative) controllers or possibly more sophisticated controllers, which are heavy users of floating-point arithmetic and present challenges of their own. To this end, we shall benefit from case studies and counsel from Hispano-Suiza and Dassault Aviation, who will participate in this project, but preferred to remain formally non-members, for administrative reasons.
Panda: ANR on Parallelism and Distribution Analysis
Participant : Dale Miller.
The ANR Blanc titled “Panda: Parallelism and Distribution Analysis” has started 1 October 2009. This project brings together researchers from INRIA Saclay (Comète and Parsifal), CEA LIST, MeASI as well labs in Paris (LIPN, PPS, LSV, LIP, LAMA), and on the Mediterranean (LIF, IML, Airbus). Scientifically, this proposal deals with the validation of concurrent and distributed programs, which is difficult because the number of its accessible states is too large to be enumerated, and even the number of control points, on which any abstract collecting semantics is based, explodes. This is due to the great number of distinct scheduling of actions in legal executions. This adds up to the important size of the codes, which, because they are less critical, are more often bigger. The objective of this project is to develop theories and tools for tackling this combinatorial explosion, in order to validate concurrent and distributed programs by static analysis, in an efficient manner. Our primary interest lies in multithreaded shared memory systems. But we want to consider a number of other paradigms of computations, encompassing most of the classical ones (message-passing for instance as in POSIX or VXWORKS) as well as more recent ones.