Section: Other Grants and Activities
National Initiatives
We participate in the “Logic and Complexity” part of the GDR–IM (CNRS Research Group on Mathematical Computer Science), in the projects “Logic, Algebra and Computation” (mixing algebraic and logical systems) and “Geometry of Computation” (using geometrical and topological methods in computer science).
We participate and co-animate the “Transformation” group of the GDR–GPL (CNRS Research Group on Software Engineering).
ANR Complice (2009-2012)
Participant : Yves Guiraud.
The ANR project “Complexité implicite, concurrence et extraction” (Complice), headed by Patrick Baillot (CNRS, LIP Lyon), federates researchers from Lyon (LIP), Nancy (LORIA) and Villetaneuse (LCR). The coordinator for the LORIA site is Guillaume Bonfante (Carte). The project held a meeting in Nancy on October 23.
ANR Infer (2007-2009)
Participants : Guillaume Burel, Claude Kirchner.
This ANR project is a grouping of three teams through their common interest for a new approach to proof theory, called “deep inference”. The project aims at refining its potential and at applying it to problems related to the foundations of logic and to more practical questions in the algorithmic of deductive systems, such as identity of proofs, Curry-Howard isomorphism, complexity of proofs, formulation of “exotic” logical systems, links with other paradigms like deduction modulo, etc. For more information, see the Infer website at http://www.lix.polytechnique.fr/~lutz/orgs/infer.html .
ANR Ravaj (2007-2009)
Participants : Emilie Balland, Pierre-Etienne Moreau.
Ravaj (Réécriture et Approximation pour la Vérification d'Applications Java) is an ANR project coordinated by Thomas Genet (Irisa). The goal is to model Java bytecode programs using term rewriting and to use completion techniques to compute the set of reachable terms. Then, it is possible to check some properties related to reachability (in particular safety and security properties) on the modeled system using tree automata intersection algorithms.
ANR SSURF (2007-2009)
Participants : Tony Bourdier, Horatiu Cirstea.
“SSURF: Safety and Security under FOCAL” is an ANR project coordinated by Mathieu Jaume (LIP6). The SSURF project consists in characterizing and studying the required features that an Integrated Development Environment (IDE) must provide in order not only to obtain software systems in conformance with high Evaluation Assurance Levels (EAL-5, 6 and 7), but also to ease the evaluation process according to various standards (e.g. IEC61508, CC, ...). Moreover we aim at developing a formal generic framework describing various security properties, e.g. access control policies, together with their implementations using such an IDE.
ARC CORiAS(2009-2010)
Participants : Paul Brauner, Guillaume Burel, Horatiu Cirstea, Clément Houtmann, Claude Kirchner, Cody Roux.
The INRIA ARC "Conception et réalisation d'assistants à la preuve fondés sur la surdéduction modulo" (CORiAS), headed by Germain Faure (INRIA, Saclay), federates researchers from Nancy (LORIA) and Saclay (LIX). The coordinator for the LORIA site is Horatiu Cirstea. A detailed presentation is available at http://www.lix.polytechnique.fr/corias/ .
ARC REDO (2009-2010)
Participant : Yves Guiraud.
The INRIA ARC "Redesigning logical syntax" (REDO), headed by Lutz Straßburger (INRIA, LIX Saclay), federates researchers from Bath (Department of Computer Science), Nancy (LORIA) and Saclay (LIX). The coordinator for the LORIA site is François Lamarche (Calligramme). The ARC held a meeting in Nancy on November 16-18.
FRAE QUARTEFT (2009-2012)
Participants : Jean-Christophe Bach, Horatiu Cirstea, Pierre-Etienne Moreau.
“QUARTEFT: QUAlifiable Real TimE Fiacre Transformations” is a research project founder by the FRAE (Fondation de Recherche pour l'Aéronautique et l'Espace). A first goal is to develop an extension of the Fiacre intermediate language to support real-time constructs. A second goal is to develop new model transformation techniques to translate this extended language, Fiacre-RT, into core Fiacre. A main difficulty consists in proposing transformation techniques that could be verified in a formal way.
