Mardi 2 Juin
Heure: |
14:00 - 17:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Explicit forms and combinatorial content of Levy stable distributions |
Description: |
Katarzyna Górska |
Vendredi 5 Juin
Heure: |
11:00 - 12:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Configuration Structures |
Description: |
Clément Aubert A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e. that distinguish the denotation of terms equated by barbed congruence. Hereditary history preserving bisimulation (hhpb) is such a relation. We define a strong back and forth barbed congruence using a reversible process algebra and show that the relation induced by the back and forth congruence is equivalent to hhpb. Hence we give a characterization of hhpb as a contextual equivalence in a reversible process algebra.
Joint work with Ioana Cristescu. |
Mardi 9 Juin
Heure: |
14:00 - 17:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Calculabilité et pavages |
Description: |
Pascal Vanier |
Vendredi 12 Juin
Heure: |
11:00 - 12:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
On the dependencies of logical rules |
Description: |
Alexis Saurin Many correctness criteria have been proposed since linear logic was introduced and it is not clear how they relate to each other. We present proof-nets and their correctness criteria from the perspective of dependency, as introduced by Mogbil and Jacobé de Naurois.
More precisely, we introduce a new correctness criterion, called DepGraph, and show that together with Danos' contractibility criterion and Mogbil and Naurois criterion, they form the three faces of a notion of dependency which is crucial for correctness of proof-structures.
Finally, we extract the logical meaning of the dependency relation and show that it allows to recover and characterize some constraints on the ordering of inferences which are implicit in the proof-net.
Joint work with Marc Bagnol and Amina Doumane. |
Mardi 16 Juin
Heure: |
12:15 - 13:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Évaluation et sélection des collaborateurs en clustering collaboratif |
Description: |
Guénaël Cabanes L'objectif du clustering collaboratif est de révéler la structure commune de données qui sont réparties sur différents sites. Le concept fondamental du clustering collaboratif est d'avoir des algorithmes qui s'exécutent localement mais qui collaborent en échangeant de l'information sur les partitions locales des données obtenues par chaque algorithme. Ce type d'apprentissage collaboratif peut être appliqué à un grand nombre de tâches, y compris le clustering multi-vues, la segmentation de données distribuées, le regroupement et l'analyse multi-échelle et multi-expert, etc.... Cette étude introduit un nouveau cadre de collaboration qui permet à un large éventail d'algorithmes de collaborer ensemble. L'originalité de la méthode proposée est qu'elle rend possible la collaboration entre des algorithmes de différentes familles. Nous avons aussi analysé limpact de la diversité entre les collaborateurs et de la qualité des collaborateurs sur la qualité de la collaboration, afin de définir des pondérations à appliquer à chaque collaborateur. Nous avons testé l'efficacité de notre approche à partir dexpériences sur des jeux de données réels. |
Heure: |
14:00 - 17:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Hopf algebras and towers of monoids |
Description: |
Aladin Virmaux |
Jeudi 18 Juin
Heure: |
14:30 - 15:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Model-checking for efficient malware detection |
Description: |
Tayssir Touili The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different techniques. Many of these well-known obfuscation techniques rely on operations on the stack such as inserting dead code by adding useless push and pop instructions, or hiding calls to the operating system, etc. Thus, it is important for malware detectors to be able to deal with the program's stack. In this talk I will show a new model-checking approach for malware detection that takes into account the behavior of the stack. Our approach consists in : (1) Modeling the program using a Pushdown System (PDS). (2) Introducing new logics, called SCTPL and SLTPL, to represent the malicious behavior. SCTPL (resp. SLTPL) can be seen as an extension of the branching-time temporal logic CTL (resp. the linear-time temporal logic LTL) with variables, quantifiers, and predicates over the stack. (3) Reducing the malware detection problem to the model-checking problem of PDSs against SCTPL/SLTPL formulas. We show how our new logics can be used to precisely express malicious behaviors that could not be specified by existing specification formalisms. We then consider the model-checking problem of PDSs against SCTPL/SLTPL specifications. We provide efficient algorithms to solve these problems. We implemented our techniques in a tool, and we applied it to detect several viruses. Our results are encouraging. In particular, our tool was able to detect more than 800 viruses. Several of these viruses could not be detected by well-known anti-viruses such as Avira, Avast, Norton, Kaspersky and McAfee. |
Mardi 23 Juin
Heure: |
10:30 - 13:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Journée MathStic 'Marches dans le quart de plan' |
Heure: |
14:00 - 17:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Uniform random generation of walks in the quarter-plane |
Description: |
Marni Mishna |
Heure: |
15:00 - 18:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Walks in the quarter plane with arbitrary big jumps |
Description: |
Kilian Raschel |
Mercredi 24 Juin
Heure: |
10:15 - 13:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Accueil de la Journée MathStic 'Combinatoire et probabilités' (! c'est un mercredi) |
Heure: |
10:30 - 13:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Journée MathStic 'Marches dans le quart de plan' (! c'est un mercredi) |
Heure: |
11:30 - 14:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Statistics of the real roots of real random polynomials |
Description: |
Grégory Schehr |
Heure: |
14:00 - 17:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Uniform random generation of walks in the quarter-plane |
Description: |
Marni Mishna |
Heure: |
14:00 - 15:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Uniform random generation of walks in the quarter-plane |
Description: |
Marni Mishna |
Heure: |
15:00 - 18:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Walks in the quarter plane with arbitrary big jumps |
Description: |
Kilian Raschel |
Heure: |
17:00 - 20:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
pot de clôture |
Lundi 29 Juin
Heure: |
12:15 - 13:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
BE-PUM: A tool of Binary Emulation for Pushdown Model generation |
Description: |
Quan Thanh Tho In this talk, we present the tool BE-PUM (Binary Emulation for PUshdown Model generation) for binary analysis. As suggested by its name, BE-PUM generates pushdown model, which is considered as a control flow graph (CFG) combined with a memory execution model. BE-PUM also introduces a concolic approach in order to generate CFG in a more precise manner. As such, BE-PUM is able to handle various popular obfuscation techniques of malwares, such as indirect jump or self- modification code. In experiments, we are able to produce models for around 1700 samples of real malware. Compared to JakStab and IDA Pro, two state-of-the-art tools in this field, BE-PUM shows better tracing ability, sometimes with significant differences. |
Heure: |
14:00 - 15:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Annotation et exploration de textes de spécialité - fragments d'une expérience |
Description: |
François Lévy, Sylvie Szulman Nous avons (ré)écrit un outil de manipulation conjointe d'annotations et de textes annotés, Omtat (One More Textual Annotation Tool) qui permet de visualiser les annotations et d'en ajouter, Les annotations, inspirées de Brat (Brat rapid annotation tool) peuvent porter sur une zone discontinue et qualifier des annotations-arguments. Un moteur de requêtes permet d'extraire et d'exploiter des ensembles de documents, phrases et annotations. Les premiers tests portent sur des textes de biologies et sur des textes juridiques, pour lesquels nous avons créé quelques types d'annotations spécialisées. Nous en profiterons pour dire en quoi spécialiser les annotations en tenant compte du domaine nous parait utile et tenter de convaincre que les résultats peuvent être intéressants. |
Jeudi 2 Juillet
Heure: |
12:30 - 13:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Solving the quadratic shortest path problem |
Description: |
Borzou Rostami Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the combined presence of pairs of arcs in the solution. In this paper we model these situations as a Quadratic Shortest Path Problem, which calls for the minimization of a quadratic objective function subject to shortest-path constraints. We prove strong NP-hardness of the problem and analyze polynomially solvable special cases, obtained by restricting the distance of arc pairs in the graph that appear jointly in a quadratic monomial of the objective function. Based on this special case and problem structure, we devise fast lower bounding procedures for the general problem and show computationally that they clearly outperform other approaches proposed in the literature in terms of their strength. |
Heure: |
14:30 - 15:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Action synthesis for branching time logic: theory and applications |
Description: |
Micha? Knapik Action-Restricted Computation Tree Logic (ARCTL) is a simple extension of CTL, proposed by Pecheur and Raimondi, where the actions allowed along the considered runs can be explicitly indicated by path selectors. ARCTL allows to express properties such as "a safe state is unavoidable for every path built from Forward and Left actions", denoted by AF{Forward,Safe}safe. By replacing the concrete sets of actions with free variables we obtain a parametric version of the logic pmARCTL, where properties such as AF{X}safe are allowed, where X is a parameter. We introduce a fixed-point theory that allows for the exhaustive synthesis of all the valuations of the variables which make the pmARTCL formulae hold in a given model. The theory has been implemented in an open source stand-alone tool and evaluated on scalable examples with promising results. |
Mardi 7 Juillet
Heure: |
14:00 - 17:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Nonlinear dynamics and complex systems [TBC] |
Description: |
Joshua Socolar |
Vendredi 24 Juillet
Heure: |
11:00 - 12:00 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
Monetary Economics Simulation: Stock-Flow Consistent Invariance, Monadic Style |
Description: |
Antoine Kaszczyc |
|
|