Team : APR - Algorithms, Programmes and ResolutionAxes : SSR (👥👥), TMC (👥👥), ASN (👥).
Team leader :
Antoine Miné Campus Pierre et Marie Curie 25-26/311
The APR team works on thematics dealing with algorithms and programming languages, from both theoretical and practical aspects, combining the language approach (design, implementation and program analysis tools) and the algorithmic requirements (modeling, complexity analysis, random generation) in a wide range of applications, such as programing new machine architectures, developing languages for concurrence and mobility, from critical embedded applications to Web development. More generally, in the APR team, we develop formal and mathematically founded methodological approaches, in the domains of semantics and combinatorics, in order to achieve safe and efficient applications by combining programming languages and algorithms through theory (formal approach in semantics and combinatorics) and practice (concrete objectives producing prototyping softwares and industrial applications).
The APR team is based on three axes following a common research theme around concurrency:
- Combinatorics and Analysis of algorithms
- Languages and Tools for Critical Softwares and Web Applications
- Algorithms and Languages for Multicore Processors
APR Web site
Random Sampling, Combinatorial Structures, Analysis of Algorithms, Models and Applications. Design and implementation of Programming Languages, Static analysis, typechecking, Abstract Interpretation, Concurrency, Parallel Programming, Language and Computation.
No event planned at present.Archives
- Ph. Aubry, J. Marrez, A. Valibouze : “Computing real solutions of fuzzy polynomial systems”, Fuzzy Sets and Systems, vol. 399, pp. 55-76, (Elsevier) [Aubry 2020]
- B. Sall, F. Peschanski, E. Chailloux : “A Mechanized Theory of Program Refinement”, ICFEM 2019 - 21st International Conference on Formal Engineering Methods, vol. 11852, Lecture Notes in Computer Science, Shenzhen, China, pp. 305-321, (Springer) [Sall 2019]
- 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]
- V. Botbol, E. Chailloux, T. Le Gall : “Static Analysis of Communicating Processes Using Symbolic Transducers”, International Conference on Verification, Model Checking, and Abstract Interpretation - VMCAI 2017, vol. 10145, Lecture Notes in Computer Science, Paris, France, (Springer International Publishing) [Botbol 2017]
- R. Demangeon, L. Bocchi, N. Yoshida, T.‑Ch. Chen, K. Honda : “Monitoring networks through multiparty session types”, Theoretical Computer Science, vol. 669, pp. 33-58, (Elsevier) [Demangeon 2017]
- A. Darrasse, H.‑K. Hwang, M. Soria : “Shape Measures of Random Increasing k-trees”, Combinatorics, Probability and Computing, vol. 25, pp. 668-699, (Cambridge University Press (CUP)) [Darrasse 2016]
- A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler : “Associative and commutative tree representations for Boolean functions”, Theoretical Computer Science, vol. 570, pp. 70-101, (Elsevier) [Genitrini 2015]
- S. Abbes, J. Mairesse : “Uniform and Bernoulli measures on the boundary of trace monoids”, Journal of Combinatorial Theory, Series A, vol. 135, pp. 201-236, (Elsevier) [Abbes 2015a]
- B. Vaugon, Ph. Wang, E. Chailloux : “Programming Microcontrollers in Ocaml: the OCaPIC Project”, International Symposium on Practical Aspects of Declarative Languages (PADL 2015), vol. 9131, Lecture Notes in Computer Science, Portland, OR, United States, pp. 132-148, (Springer Verlag) [Vaugon 2015]
- M. Bourgoin, E. Chailloux, J.‑L. Lamotte : “Efficient Abstractions for GPGPU Programming”, International Journal of Parallel Programming, vol. 42 (4), pp. 583-600, (Springer Verlag) [Bourgoin 2014c]
Antoine.Mine (at) nulllip6.fr