Research Days 2015

Research Days 2015

23 mars 2015

Supelec – 91190 Gif Sur Yvette

Organizers :

  • Christine PAULIN (SciLex)
  • Philippe SCHNOEBELEN (SciLex)
  • Pierre DUHAMEL (ComEx)
  • 9h00 Welcome
  • 9h15-10h45 Joint session Scilex/Comex – Amphi Janet, Supélec
    • Gang Feng (Chendu) – Research on architecture and resource management for 5G systems
    • Antoine Dreyer (CASD) – Gestion de données sécurisées dans l’equipeX CASD
  • 10h45 Coffee break
  • 11h15-12h45 Parallel sessions –
    • Scilex – Amphi F3.06A
      • Stefan Göller (CNRS & LSV) VERICONISS: Verification of Concurrent Infinite State Systems
      • Franck Valencia : Distributed Spaces in Concurrent Epistemic Systems
      • Philippe Schnoebelen (LSV): The Digicosme WG SASEFOR (Saclay: Séminaire Méthodes Formelles)
      • Mathieu Jan (CEA LIST): The Digicosme WG OVSTR (Optimisation des systèmes temp-réel)
    • Comex-1 NETWORK INFORMATION THEORY AND CODING – Amphi Janet, Supélec (Chair : Sheng Yang, CentraleSupelec)
      • Iryna Andryanova (ENSEA) Distributed Storage Allocations in Memory-Limited Wireless Caching Networks
      • Selma Belhadjamor (Télécom ParisTech) A New Coding Scheme for Discrete Memoryless MACs with Common Rate-Limited Feedback
      • Chao He (L2S) An Achievable Rate Region of Broadcast Relay Channel with State Feedback
      • Wan Kai (L2S) Index Coding Problem : Recent Advances and Challenges
  • 12h45-14h15 Lunch
  • 14h15-15h45 Parallel sessions –
    • SciLex 2 – Amphi F3.06A
      • Adrien Le Coënt (ENS Cachan) – Guaranteed control of switched control systems using model order reduction and state-space bisection
      • Florian Brandner (ENSTA ParisTech – U2IS) – Profiling Metrics and Techniques for the Optimization of Real-Time Programs / Analysis of Method Cache Extensions
      • Sylvie Boldo (INRIA & LRI) : Vérification formelle de programmes mathématiques: de l’équation des ondes à la méthode des éléments finis
    • Comex-2 NETWORK CENTRIC DESIGN OF DISTRIBUTED ARCHITECTURES – Amphi Janet, Supélec (Chair : Claude Chaudet, TPT)
      • Andrea Giuseppe Araldo (UPsud, Télécom PT) : Cost-Aware Information Centric Networks: optimal planning and caching algorithms
      • Laurent Decreusefond (Télécom PT)- Superposition de processus déterminantaux et application à la modélisation des localisations des stations de base
      • Amine Adouane (UVSQ,PRISM): mécanismes de coordination entre les eNodesB dans LTE
      • T. Toukabri, H.Afifi, M.Marot (Télécom SudParis) Avantages et incovénients des déploiements de systèmes D2D
  • 15h45 Coffee break
  • 16h15-17h45 Parallel sessions
    • Scilex – Amphi F3.06A
      • David Declerk (LRI) Vérification de programmes assembleur concurrents sous le modèle x86-TSO
      • Steven De Oliveira (CEA) : Propriétés temporelles et programmes C
      • David Bühler (CEA LIST) : Improving Static Analyses of C Programs with Conditional Predicates.
    • Comex-3 TERMINAL CENTRIC DESIGN OF NETWORKS – Amphi Janet, Supélec (chair : Mohamad Assaad, CentraleSupelec)
      • Richard Combes (CentraleSupélec/L2S): Unimodal Bandits without Smoothness
      • Jihong Yu (UPSud, LRI) : From Static to Dynamic Tag Population Estimation: An Extended Kalman Filter Perspective
      • Megumi Kaneko (Université de Kyoto) – Distributed resource allocation schemes based on CSI overhearing and scheduling prediction in OFDMA heterogeneous networks
      • Ejder Bastug (CentraleSupélec): A Transfer Learning Approach for Cache-Enabled Wireless Networks

Proposed Talks with abstracts

  • Adrien Le Coënt (ENS Cachan) – Guaranteed control of switched control systems using model order reduction and state-space bisection
  • Florian Brandner (ENSTA ParisTech – U2IS) – Profiling Metrics and Techniques for the Optimization of Real-Time Programs / Analysis of Method Cache Extensions
  • Steven De Oliveira (CEA) : Propriétés temporelles et programmes C
  • David Bühler (CEA LIST) Improving Static Analyses of C Programs with Conditional Predicates

trade-off between precision and complexity. Notably, dataflow analyses often perform overly wide approximations when two control-flow paths meet, by merging states from each path. This talk presents a generic abstract interpretation based framework to enhance the precision of such analyses on join points. It relies on predicated domains, that preserve and reuse information valid only inside some branches of the code. Our predicates are derived from conditional statements, and postpone the loss of information.
The work has been integrated into Frama-C, a C source code analysis platform. Experiments on real code show that our approach scales, and improves significantly the precision of the existing analyses of Frama-C.

Location

Supélec, Plateau du Moulon, 3 rue Joliot-Curie, Gif-sur-Yvette (going there).

  • Joint sessions : Amphi Janet
  • Comex session : Amphi Janet
  • SciLex sessions : Amphi F3.06A
  • Lunches : Salle des cocktails