Preliminary Program

Tuesday May 17
 
18:00 – 20:00 Registration
Wednesday May 18
   
08:00 – 09:00 Registration
09:00 – 09:30 Opening Session
09:30 – 10:30 Keynote Talk I -
A Hierarchy of Thread-Modular Proof Systems,
Andreas Podelski, University of Freiburg, Germany
10:30 – 11:00 Coffee Break
11:00 – 13:00 Session 1: Concurrent Systems
13:00 – 14:30 Lunch
14:30 – 16:00 Session 2: Security
16:00 – 16:30 Coffee Break
16:30 – 18:00 Session 3: Networking
Thursday May 19
 
08:00 – 09:00 Registration
09:00 – 10:00 Keynote talk II –
Finding the Root Cause for Concurrency Bugs,
Luis Rodrigues, INESC-ID, Universidade de Lisboa, Portugal
10:00 – 10:30 Coffee Break
10:30 – 12:00 Session 4: Fault Tolerance
12:00 – 13:00 Poster Session
13:00 – 14:30 Lunch
14:30 – 16:00 Session 5: Data Structures
16:00 – 16:30 Coffee Break
16:30 – 18:00 Session 6: Protocols
20:30 Gala Diner
Friday May 20
 
09:00 – 10:00 Keynote talk III –
Probabilistic Programming: Semantics, Termination, and Run Time Analysis,
Joost-Pieter Katoen, RWTH Aachen University, Germany
10:00 – 10:30 Coffee Break
10:30 – 11:45 Session 7: Efficiency and Optimization
11:45 – 13:00 Session 8: Predictability
13:00 – 15:00 Lunch
15:00 – 16:00 Session 9: Models and Proofs
16:00 – 16:15 Closing Session

Details:

Session 1: Concurrent Systems

  • - Raphaël Barazzutti, Yaroslav Hayduk, Pascal Felber and Etienne Rivière. Exploiting Concurrency in Domain-Specific Data Structures: A Concurrent Order Book and Workload Generator for Online Trading.
  • - Gadi Taubenfeld. Waiting in Concurrent Algorithms.
  • - Carole Delporte-Gallet and Hugues Fauconnier. Asynchronous Consensus with Bounded Memory.
  • - Suha Orhun Mutluergil and Serdar Tasiran. A Mechanized Refinement Proof of the Chase-Lev Deque Using a Proof System.

Session 2: Security

  • - Muqeet Ali, Rezwana Reaz and Mohamed Gouda. Nonrepudiation Protocols without a Trusted Party.
  • - Ahmed Khoumsi, Mohammed Erradi, Meryeme Ayache and Wadie Krombi. An Approach to Resolve NP-Hard Problems of Firewalls.
  • - Oliver Jensen, Tyler O’Meara and Mohamed Gouda. Securing NFC Credit Card Payments against Malicious Retailers.

Session 3: Networking

  • - Yahya Benkaouz, Mohammed Erradi and Anne-Marie Kermarrec. Nearest Neighbors Graph Construction: Peer Sampling to the rescue.
  • - Ruma Paul, Peter Van Roy and Vladimir Vlassov. Reversible Phase Transitions in a Structured Overlay Network with Churn.
  • - Maroua Drissi, Oumsis Mohammed and Driss Aboutajdine. A Fuzzy AHP Approach to Network Selection Improvement in Heterogeneous Wireless Networks.

Session 4: Fault Tolerance

  • - Achour Mostéfaoui and Michel Raynal. Time-Efficient Read/Write Operations in Crash-prone Message-Passing Systems.
  • - Khaled Ben Hafaiedh, Gregor Bochmann, Guy-Vincent Jourdan and Iosif Viorel Onut. Fault Tolerant P2P RIA Crawling.
  • - Niklas Ekström and Seif Haridi. A Fault-Tolerant Sequentially Consistent DSM With a Compositional Correctness Proof.

Session 5: Data Structures

  • - Evgenia Christoforou, Antonio Fernandez Anta, Chryssis Georgiou and Miguel A. Mosteiro. Internet Computing: Using Reputation to Select Workers from a Pool.
  • - Maria Carpen-Amarie, Dave Dice, Gaël Thomas and Pascal Felber. Transactional Pointers: Experiences with HTM-based Reference Counting in C++.
  • - (short) Fouad Yakoubi and Mohamed El Marraki. Number of Spanning Trees in Corona Product of Planar Graph and S-chain Graph.
  • - (short) Zouheir Labbi, Ahmed Maarof, Mohamed Senhadji and Mostafa Belkasmi. Hybrid Encryption Approach Using Dynamic Key Generation and Symmetric Key Algorithm for RFID systems.

Session 6: Protocols

  • - Quentin Bramas and Sebastien Tixeuil. Benchmarking Energy-Efficient Broadcast Protocols in Wireless Sensor Networks.
  • - Alami Chaibrassou and Ahmed Mouhsen. A Multi-Channel Energy Efficient Cooperative MIMO Routing Protocol for Clustered WSNs.
  • - (short) Imane Zaimi, Zineb Squalli Houssaini, Abdelali Boushaba, Mohammed Oumsis and Driss Aboutajdine. Vehicular Ad-hoc Network: Evaluation of QoS and QoE for Multimedia Application.
  • - (short) Maitri Chakraborty, Alessia Milani and Miguel A. Mosteiro. Counting in Practical Anonymous Dynamic Networks is Polynomial.

Session 7: Efficiency and Optimization

  • - Elgarej Mouhcine, Mansouri Khalifa and Youssfi Mohamed. Traffic Lights Optimization with Distributed Ant Colony Optimization Based on Multi-Agent System.
  • - Javier Olivares, Nitin Chiluka and Anne-Marie Kermarrec. The Out-of-core KNN awakens: The light side of computation force on large datasets.
  • - (short) Nada Sbihi and Mounir Ghogho. Is Youtube popularity prediction a good way to improve caching efficiency?

Session 8: Predictability

  • - Antoine Blin, Cedric Courtaud, Julien Sopena, Julia Lawall and Gilles Muller. Understanding the memory consumption of the MiBench embedded benchmark.
  • - Sara El Aouad, Christophe Dupuy, Renata Teixeira, Francis Bach and Christophe Diot. Exploiting crowd sourced reviews to explain movie recommendation.
  • - (short) Anass Rachdi, Abdeslam Ennouaary and Mohamed Dahchour. Verification of Common Business Rules in BPMN Process Models.

Session 9: Models and Proofs

  • - (short) Asma El Hamzaoui, Hicham Bensaid and Abdeslam En-Nouaary. A formal model for WebRTC signaling using SDL.
  • - (short) Rachid Oucheikh, Ismail Berrada and Outman Elhichami. The 4-Octahedron Abstract Domain.
  • - (short) Sanae El Mimouni and Bouhdadi Mohamed. An Incremental Proof-Based Process of the NetBill Electronic Commerce Protocol.
  • - (short) Aissam Berrahou. Accurate Optimization Method for Allocation of Heterogeneous Resources in Embedded Systems.
Dates

These are firm deadlines

January 12, 2016

Abstract submission deadline

January 23, 2016

Paper submission deadline

March 15, 2016

Acceptance notification

April 05, 2016

Camera ready copy due

Proceedings

SpringerLNCS

The proceedings of the conference will be published in Springer’s Lecture Notes in Computer Science

Partners & Sponsors

SponsorsNETYS28