Mardi 9 Décembre
Heure: 
12:30  13:30 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Complexity aspects of graph convexities 
Description: 
Mitre Dourado In the first half of the talk, I will survey the basic concepts, problems and main known results related to computational complexity aspects of graph convexities. In the second half, I will present some new results on the Radon number in the geodetic convexity, among them a polynomial time algorithm for finding the Radon number of unit interval graphs.
This is a joint work with: Jayme Luiz Szwarcfiter Alexandre Toman 
Heure: 
14:00  17:00 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Asymptotic expansion for random tensor models 
Description: 
Adrian Tanasa Threedimensional random tensor models are a natural generalization ofthe celebrated matrix models. The associated tensor graphs, or 3Dmaps, can be classified with respect to a particular integer orhalfinteger, the degree of the respective graph.I will present in this talk a combinatorial analysis of the generalterm of the asymptotic expansion in N, the size of the tensor, of aparticular random tensor model, the socalled multiorientable model.I will then present some enumerative results and show which are thedominant configurations of a given degree; several examples will alsobe given. 
Jeudi 11 Décembre
Heure: 
16:00  17:00 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
CosyVerif: An Open Source Extensible Verification Environment 
Description: 
Étienne André Over the past two decades, numerous verification tools have been successfully used for verifying complex concurrent systems, modelled using various formalisms. However, it is still hard to coordinate these tools since they rely on such a large number of formalisms. Having a proper syntactical mechanism to interrelate them through variability would increase the capability of eff ective integrated formal methods. Here, we propose a modular approach for defining new formalisms by reusing existing ones and adding new features and/or constraints. Our approach relies on standard XML technologies; their use provides the capability of rapidly and automatically obtaining tools for representing and validating models. It thus enables fast iterations in developing and testing complex formalisms. As a case study, we applied our modular definition approach on families of Petri nets and timed automata. This work is implemented in the CosyVerif platform, a modular framework integrating verification software tools of the Paris regions. This is a joint work with the CosyVerif team. 
Vendredi 12 Décembre
Heure: 
11:00  12:30 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Asynchronous Interaction with Theorem Provers: ProofGeneral's Last March 
Description: 
Carst Tankink This year ProofGeneral, the generic Emacsinterface for proof assistants, celebrates its 20th birthday. The tool is showing its age, however, by only allowing a user to work at a single point at the time, and having to reevaluate an entire proof script in reaction to changes at the beginning. In this talk, I will discuss our recent efforts to changing this situation: based on a previous endeavour in Isabelle, we have adapted the Coq proof assistant to work with the jEdit text editor. This editor has no uservisible notion of "State": the entire proof is always available to the proof assistant, allowing it to react to changes in the document in a more intelligent manner: by scheduling proofs in parallel and by postponing computation that are of no direct interest to the author. I will not go into full technical details in this talk, but give a demo of the current prototype, and discuss the ramifications of such a model in the longer term. 

