Souheib BAARIR (Sorbonne Université – LIP6) Date: Friday, April 29 2022 – 13h00 Title: Contributions to the analysis of discrete systems through proportional satisfiability Despite its NP-Completeness, propositional satisfiability (SAT) covers a broad spectrum of applications. Nowadays, it is an active research area finding its applications in many contexts: planning…
============================================================================= ** ** Final Call for Papers: FACS 2021 ** ** 17th International Conference on Formal Aspects of Component Software ** ** Virtual Event ** ** https://facs2021.inria.fr ** ============================================================================= ## OVERVIEW Component-based software development proposes sound engineering principles and techniques to cope with the complexity of present-day software systems. However,…
CALL FOR PARTICIPATION Sixth International Conference on Formal Structures for Computation and Deduction (FSCD 2021) July 17 – July 24, 2021, Buenos Aires, Argentina https://fscd2021.github.io/ In-cooperation with ACM SIGLOG and SIGPLAN The 2021 edition of FSCD and of its satellite workshops will be held online. Participation will, a priori, be…
Date: November 19, 2019 Place: Alice and Bob (B11-B13) Chairs: Emmanuel Jeandel 9h15-9h30 Welcome Session 1 : 9h30-10h30 Pierre Lermusiaux Pattern Eliminating Transformation #T1 Program transformation is a common practice in computer science, and its many applications can have a range of different objectives. For example, a program written in…
Date: November 20, 2018 Place: A008 Chairs: Emmanuel Jeandel 9h15-9h30 Welcome Session 1 : 9h30-10h30 Joseph Lallemand Voting: You Can’t Have Privacy without Individual Verifiability #T5 Electronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national…
Date: November 7 Place: A008 Chairs: Emmanuel Jeandel 09h00 – 09h30 Welcome 09h30 – 10h00 : Joseph Lallemand A Type System for Privacy Properties Mature push button tools have emerged for checking trace properties (e.g. secrecy or authentication) of security protocols. The case of indistinguishability-based privacy properties (e.g. ballot privacy…
Date: October 16 Place: A008 Chairs: Emmanuel Jeandel Session 1 : 8h30-10h 8h30-9h00 : Hubert Godfroy A theory of reflexive computation based on soft intuitionistic logic Computational Reflection is a paradigm in which the computational mechanisms controls the different levels of data interpretation. It can be decomposed into two processes:…
Date: October 20 Place: A008 Chairs: Emmanuel Jeandel Session 1 : 9h-10h Eric Le Morvan Secure refinements of communication channels It is a common practice when designing security protocols to assume that they already unspecified secure channels. Then the secure channels are implemented using any standard protocol, e.g. TLS. However…
Date: Tuesday, October 14 Place: B013 Chairs: Emmanuel Jeandel 14h00-14h35 : Hubert Godfroy (Carte) Self Modifying Machines We describe a new framework for self-modifying programs. Our goal is to show how to extract program abstraction focusing on self-modifications. On the first hand, we use a abstract machine which makes explicit…
Date: Tuesday, October 22 Place: A008 Chair: Michael Rusinowitch (morning) & Emmanuel Jeandel (afternoon) 9h30-10h : Jean-Christophe Bach (Pareo) Langage et outil pour la transformation de modèles 10h-10h30 : Houari Mahfoud (Cassis) Secure and Valid Manipulation of XML Data It is increasingly common to find XML views used to enforce…
