APR - Artigos de Conferencia

Pesquisa
Publicações
Research reports

Current teams : ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL

Publicações APR	2021	2022	2023	2024	2025	Total
Livros	1	0	0	0	0	1
Livros Editados	0	0	0	0	0	0
Jornais	5	6	10	5	2	28
Capítulos de livros	2	0	0	0	0	2
Artigos de Conferencia	12	11	7	10	5	45
Habilitações (Livre Docência)	1	0	1	0	0	2
Teses	3	3	2	2	1	11

LIP6

I. Abdeljaoued‑Tej, A. Benkahla, Gh. Haddad, A. Valibouze : “Separators for Polynomial Dynamic Systems with Linear Complexity”, Computational Methods in Systems Biology 17^th International Conference, CMSB 2019, vol. 11773, Lecture Notes in Computer Science, Trieste, Italy, pp. 373-378, (Springer) [Abdeljaoued-Tej 2019]
Ph. Aubry, J. Marrez, A. Valibouze : “The Real Transform: Computing Positive Solutions of Fuzzy Polynomial Systems”, 11^th International Conference on Fuzzy Computation Theory and Applications, vol. 1: FCTA, Proceedings of the 11^th International Joint Conference on Computational Intelligence, Vienna, Austria, pp. 351-359, (SciTePress - Science and Technology Publications) [Aubry 2019]
T. Bin Masood, J. Budin, M. Falk, G. Favelier, Ch. Garth, Ch. Gueunet, P. Guillou, L. Hofmann, P. Hristov, A. Kamakshidasan, Ch. Kappe, P. Klacansky, P. Laurin, J. Levine, J. Lukasczyk, D. Sakurai, M. Soler, P. Steneteg, J. Tierny, W. Usher, J. Vidal, M. Wozniak : “An Overview of the Topology ToolKit”, TopoInVis 2019 - Topological Methods in Data Analysis and Visualization, Nykoping, Sweden [Bin Masood 2019]
O. Bodini, A. Genitrini, M. Naima : “Ranked Schröder Trees”, ANALCO 2019 - 16^th Workshop on Analytic Algorithmics and Combinatorics, San Diego, CA, United States, pp. 13-26, (Society for Industrial and Applied Mathematics) [Bodini 2019a]
O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “The Combinatorics of Barrier Synchronization”, PETRI NETS 2019 - 40^th International Conference on Application and Theory of Petri Nets and Concurrency, vol. 11522, Lecture Notes in Computer Science, Aachen, Germany, pp. 386-405 [Bodini 2019b]
Th. Bridel‑Bertomeu, B. Fovet, J. Tierny, F. Vivodtzev : “Topological Analysis of High Velocity Turbulent Flow”, IEEE Symposium on Large Data Analysis and Visualization, Vancouver, Canada [Bridel-Bertomeu 2019]
D. Delmas, A. Miné : “Analysis of Program Differences with Numerical Abstract Interpretation”, PERR 2019 - 3rd Workshop on Program Equivalence and Relational Reasoning, Prague, Czechia [Delmas 2019a]
D. Delmas, A. Miné : “Analysis of Software Patches Using Numerical Abstract Interpretation”, International Static Analysis Symposium, vol. 11822, Lecture Notes in Computer Science, Porto, Portugal, pp. 225-246, (Springer) [Delmas 2019b]
M. Falk, Ch. Garth, Ch. Gueunet, J. Levine, J. Lukasczyk, J. Tierny, J. Vidal : “Topological Data Analysis Made Easy with the Topology ToolKit, A Sequel”, IEEE VIS Tutorials, Vancouver, Canada [Falk 2019]
Ch. Gueunet, P. Fortin, J. Jomier, J. Tierny : “Task-based Augmented Reeb Graphs with Dynamic ST-Trees”, Eurographics Symposium on Parallel Graphics and Visualization, Porto, Portugal [Gueunet 2019b]
M. Journault, A. Miné, A. Ouadjaout : “An abstract domain for trees with numeric relations”, ESOP 2019 - 28^th European Symposium on Programming, vol. 11423, Lecture Notes in Computer Science, Prague, Czechia, pp. 724-751, (Springer) [Journault 2019a]
M. Journault, A. Miné, R. Monat, A. Ouadjaout : “Combinations of Reusable Abstract Domains for a Multilingual Static Analyzer”, Verified Software. Theories, Tools, and Experiments, vol. 12031, Lecture Notes in Computer Science, New York, United States, pp. 1-18, (Springer) [Journault 2019b]
M. Kontak, J. Vidal, J. Tierny : “Statistical Parameter Selection for Clustering Persistence Diagrams”, SuperComputing Workshop on UrgentHPC, Denver, United States [Kontak 2019]
F. Peschanski : “Verifying Mobile Systems: Take Two: Stateful Observations of Pi-calculus Processes”, Communicating Process Architectures 2018 - WoTUG 40, vol. 70, Concurrent Systems Engineering Series, Dresden, Germany, (IOS Press), (ISBN: 978-1-61499-948-5) [Peschanski 2019]
B. Sall, F. Peschanski, E. Chailloux : “A Mechanized Theory of Program Refinement”, ICFEM 2019 - 21^st International Conference on Formal Engineering Methods, vol. 11852, Lecture Notes in Computer Science, Shenzhen, China, pp. 305-321, (Springer) [Sall 2019]
M. Soler, M. Petitfrere, G. Darche, M. Plainchault, B. Conche, J. Tierny : “Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-aware Matchings”, IEEE Symposium on Large Data Analysis and Visualization, Vancouver, Canada [Soler 2019]
S. Varoumas, T. Crolard : “WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its Formalisation”, 19^th International Workshop on Worst-Case Execution Time Analysis (WCET 2019), vol. 72, OpenAccess Series in Informatics (OASIcs), Stuttgart, Germany, pp. 5:1-5:12, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Varoumas 2019]