Date: Friday, June 23rd 2023 – 14h00Place: C103Title: The TPTP World – Infrastructure for Automated Reasoning The TPTP World is a well known and established infrastructure that supports research, development, and deployment of Automated Theorem Proving (ATP) systems for classical logics. The data, standards, and services provided by the TPTP World…
Title : Computable Functions in Anonymous NetworksDate: Tuesday, May 23rd 2023 – 14h00Place: C103 Abstract: In this talk, we present several computability results in anonymous networks with broadcast communications. First, we recall the characterization, given by Boldi and Vigna, of the computable functions when agents have no information on their outgoing neighborhoods. Then we…
Title : Guaranteed properties of dynamical systems under perturbations.Date: Wednesday, May 3rd, 2023 – 14h00.Place: B013 Abstract : Since dynamical systems has a major impact on human development, especially critical systems that can put human lives at risk if something goes wrong. Hence, the need of studying the behavior of these systems in order to…
Date: Wednesday, April 5th, 2023 – 10h00. Place: to be announced. Title: Towards End-to-End Formal Verification of Voting Protocols.
Date: June 17, 2022 Place: Alice and Bob (B11-B13) Chair: Emmanuel Jeandel 9h30-10h00 Welcome 10h00-10h30 Dylan Marinho Guaranteeing Timed Opacity using Parametric Timed Model Checking Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal…
Arnaud Spiwack (Tweag) Date: Thursday, May 12 2022 – 11h00 Place: B013 Title: Linear Haskell Since 2016, I’ve been leading the effort to supplement the functional programming language Haskell with linear typing (in the sense of linear logic). That is you can write a type of functions which are allowed…
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…
