Team APR

User Tools

Site Tools

research

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
research [2018/01/03 10:48] – [Research activity] emmanuelresearch [2025/06/30 13:57] (current) – [Research activity] mine
Line 2: Line 2:
 ====== Research activity ====== ====== Research activity ======
  
-The scientific activity of APR mainly develops around Algorithms and Languages and several projects exist, with many collaborations+The scientific activity of APR mainly develops around Algorithms and Languages and several projects exist, with many collaborations. We follow a dual approach to achieving safe and efficient applications by combining programming languages (design, implementation and program analysis tools) and algorithms (modeling, complexity analysis,random generation) through theory (formal approach in semantics and combinatorics) and practice (concrete objectives producing prototyping softwares and industrial applications).
  
 <html><table style='border:none;'><tr style='border:none;'></html> <html><table style='border:none;'><tr style='border:none;'></html>
 <html><td style='border:none;width:40%;'><div style='margin:1em'></html> <html><td style='border:none;width:40%;'><div style='margin:1em'></html>
-<html><h3><a href='/actionGA/'>Random Generation Action</a></h3></html> +The APR team is based on three axes following a common research theme around concurrency: 
-In the field of random generation of structures, Boltzmann model, which +  - Combinatorics and Analysis of algorithms 
-comes from analytic combinatorics, shows to be particularly efficient for +  - Languages and Tools for Critical Softwares and Web Applications 
-generating objects obeying complex constraints. The goal of the action "Random Generation" is to develop Boltzmann methods for the automatic generation of tests for intensive and large scale applications, particularly in the context of testing and checking software.+  - Algorithms and Languages for Multicore Processors 
 + 
 +<html><h3>Combinatorics and Analysis of algorithms</h3></html> 
 +In the APR team, we develop combinatorial me- thods for analysing the performances of algorithms and randomly sampling complex structures. Our methods allow to quantify the complexity of algorithms and efficiently generate combinatorial objects. Our research both aims at extending the expressiveness of the models, and adapting the methods to real application domains : information retrieval in massive data, robustness tests or software validation, modeling of graphs, quantita- tive study of concurrency. We lead several ambitious projects such as non-uniform sampling, sampling with multi-parameter specifications, graph computing with GPU programming as well as quantitative analysis of programming languages. 
  
 ------------- -------------
  
-<html><h3>Web, Languages and Coherence Action</h3></html>+<html><h3>Languages and tools for Critical Softwares and Web Applications</h3></html> 
 + 
 +The APR team works also on design and implementation of programming languages from the point of view of expressiveness, reliability and efficiency. We aim at building a complete chain from computation models (processes calculus, type systems, static analysis, ...) to actual implementations. Theses works focus on two different application domains. On the one hand we are interested in the development of tools for the certification of critical systems (tests and static analysis by abstract interpretation). On the other hand, web-based technologies offers an excellent laboratory for new ideas, such as computational migration and synchronous-reactive programming for multi-tier applications. Both domains revolve around component-based systems which strongly benefit from a top-down vision (global control, type system, monitors, multi-tier design)
  
-The goal of this action is to design and implement multitarget langages for the Web, compiled for client-server and database, with an objective of coherence. We both develop formal semantics for concurrent and distributed computing, and implement languages using these extensions to design Web applications.  
  
 ------------- -------------
  
-<html><h3>Seminars and working groups</h3></html> +<html><h3>Algorithms and Languages for Multicore Processors</h3></html>
- +
-  * [[http://www-apr.lip6.fr/sem-comb-anal-enum.html|Combinatorics Seminar]], animated by M. Soria and S. Corteel +
-  * [[http://www-apr.lip6.fr/~chaillou/Public/programmation/|"Programming" working group]], animated by E. Chailloux {{rss>http://gdtprog.blogspot.com/feeds/posts/default 3 date 1h }} +
-  * [[https://www.lip6.fr/recherche/organise-archive.php?acronyme=APR|APR Seminar, animated by R. Demangeon & J. Baste (previously by B-M Bui-Xuan & A. Genitrini)]] +
-  * [[http://wiki.sagemath.org/GroupeUtilisateursParis|Sage User Group in Paris region]], animated by F. Hivert, N. Thiéry (LRI, Paris-Sud), A. Valibouze, ...+
  
 +A real need for abstraction arose out of the democratization of parallelism and concurrency. These abstractions should facilitate parallel composition while allowing a compiler to generate efficient code for a given target architecture. These abstractions must also be clearly specified and allow the static analysis of a number of properties to ensure the safe execution of the programs created. The great strength of our team on this research theme is the complementarity of the work we have carried out in recent years. On the one hand, we have a recognized expertise concerning advanced algorithmics and parallel programming techniques, particularly in the shared memory model and data-parallelism. This concerns, on the one hand, the abstraction of the hardware, CPU and GPU, and the algorithms adaptation for these specific hardware and on the other hand the tools of static analysis by abstract interpretation for concurrent programs for shared memory models as well as for communicating processes. In a complementary way, we have studied concurrency and mobility based on π-calculus.
  
 ------------- -------------
 +
  
 <html></td></html> <html></td></html>
Line 36: Line 38:
 <html><h3>Projects in collaboration</h3></html> <html><h3>Projects in collaboration</h3></html>
  
-  * ERC Consolidator project [[https://www-apr.lip6.fr/~mine/mopsa/index.html | MOPSA]] (2015-2020) +  * ERC  project [[https://perso.lip6.fr/Antoine.Mine/mopsa/index.html | MOPSA]] (2016-21) 
-  * Systematic project LCHIP (2017-2020) +  * Systematic project LCHIP (2017-20)
-  * ANR project [[http://www.anr-coverif.fr|COVERIF]] (2015-2019) +
-  * ITEA3 project [[https://itea3.org/project/assume.html | ASSUME]] (2015-2018)+
   * PEPS APRES (2017)   * PEPS APRES (2017)
-  * PEPS GraphGPU (2016-2017) +  * PEPS GraphGPU (2016-17) 
-  * Systematic project UCF (2014-2017) +  * GDRI [[http://aleanetwork.net/ | ALEA NETWORK ]] (2015-19) 
-  * ANR network CHRONOS (2014-2016) +  * ANR project [[http://www.anr-coverif.fr|COVERIF]] (2015-19) 
-  * ANR project [[http://www.algo-prog.info/cercles/|CERCLES]] (2011-2014) +  * ANR project [[http://metaconc.stat.sinica.edu.tw|MOST]] (2015-19) 
-  * ANR project [[http://www-apr.lip6.fr/anrMagnum/|MAGNUM]] (2010-2015)+  * ITEA3 project [[http://assume-project.eu | ASSUME]] (2015-18) 
 + 
 + 
 +  * SU-FAPERJ project PSwmsGpu (2015-16) 
 +  * Systematic project UCF (2014-17) 
 +  * ANR network CHRONOS (2014-16) 
 +  * ANR project [[http://www.algo-prog.info/cercles/|CERCLES]] (2011-14) 
 +  * ANR project [[https://apr.team.lip6.fr/attic/anrMagnum/|MAGNUM]] (2010-15)
   * ANR project [[http://www-sop.inria.fr/indes/pwd/|PWD]] (2010-14)   * ANR project [[http://www-sop.inria.fr/indes/pwd/|PWD]] (2010-14)
   * Systematic project [[http://opengpu.net/|OpenGPU]] (2010-12)   * Systematic project [[http://opengpu.net/|OpenGPU]] (2010-12)
-  * ANR project [[http://www-apr.lip6.fr/anrGamma/|GAMMA]] (2007-10)+  * ANR project [[https://apr.team.lip6.fr/attic/anrGamma/|GAMMA]] (2007-10)
   * System@tic project [[http://www.projet-couverture.com/|COUVERTURE]] (2008-10)   * System@tic project [[http://www.projet-couverture.com/|COUVERTURE]] (2008-10)
   * PEPS project STOCHASFLIP (2008-10)   * PEPS project STOCHASFLIP (2008-10)
Line 57: Line 64:
 <html><h3>LIP6 Projects</h3></html> <html><h3>LIP6 Projects</h3></html>
  
-  * PART (2017-) : Conception d'algorithmes de tracking efficace sur architectures hétérogène+  * PART (2017-) : Conception d'algorithmes de tracking efficace sur architectures hétérogène (with ALSOC)
   * LinkThreads (2014-) : Link flow analysis of dynamic graphs from traces of multithreaded programs  (with Complex networks and MOVE)   * LinkThreads (2014-) : Link flow analysis of dynamic graphs from traces of multithreaded programs  (with Complex networks and MOVE)
   * Z3 (2010-12): Implantation of the ZAM functional machine in the VMkit virtual  machine  (with  REGAL)   * Z3 (2010-12): Implantation of the ZAM functional machine in the VMkit virtual  machine  (with  REGAL)
Line 63: Line 70:
   * PAME  (2008-10): Programming Emerging  Multicore Architectures (with PEQUAN and ALSOC)   * PAME  (2008-10): Programming Emerging  Multicore Architectures (with PEQUAN and ALSOC)
   * SYNUS (2007-09): Symbolic-Numeric Algorithms for Solving Polynomial Systems (with PEQUAN and SALSA)   * SYNUS (2007-09): Symbolic-Numeric Algorithms for Solving Polynomial Systems (with PEQUAN and SALSA)
 +
 +-------------
 +
 +<html><h3>Seminars and working groups</h3></html>
 +
 +  * [[https://apr.team.lip6.fr/attic/sem-comb-anal-enum.html|Combinatorics Seminar]], animated by M. Soria and S. Corteel
 +  * [[http://www-apr.lip6.fr/~chaillou/Public/programmation/|"Programming" working group]], animated by E. Chailloux {{rss>http://gdtprog.blogspot.com/feeds/posts/default 1 date 1h }}
 +  * [[https://www.lip6.fr/recherche/organise-archive.php?acronyme=APR|APR Seminar, animated by R. Demangeon  (previously by B-M Bui-Xuan & A. Genitrini & J. Baste)]]
 +  * [[http://wiki.sagemath.org/GroupeUtilisateursParis|Sage User Group in Paris region]], animated by F. Hivert, N. Thiéry (LRI, Paris-Sud), A. Valibouze, ...
 +
  
  
Line 69: Line 86:
  <html><h3>APR days</h3></html>  <html><h3>APR days</h3></html>
  
-    * May 2016: [[http://www-apr.lip6.fr/journeeAPR2016.pdf|APR-2016]], organized by E. Chailloux +    * Mai 2024: [[apr:journees:ete2024|Summer-APR-2024]], organized by A. Miné 
-    * June 2014 :  [[http://www-apr.lip6.fr/journeeAPR2014.pdf|APR-2014]], organized by E. Chailloux +    * June 2023: [[apr:journees:ete2023|Summer-APR-2023]], organized by A. Miné 
-    * June 2013 : [[http://www-apr.lip6.fr/journeeAPRjune2013.pdf|APR-2013]], organized by E. Chailloux, P. Trébuchet +    * June 2022: [[https://apr.team.lip6.fr/attic/APR/journeeAPR2022f.pdf|Summer-APR-2022]], organized by E. Chailloux 
-    * Feb 2012 [[http://www-apr.lip6.fr/journeeAPRfev2012.pdf|APR-2012]], organized by E. Chailloux +    * July 2019: [[apr:journees:ete2019|Summer-APR-2019]], organized by A. Miné 
-    * June 2010 [[http://www-apr.lip6.fr/Seminaire-2010/programme-seminaire-apr.html|APR-2010]], organized by F. Peschanski, P. Trebuchet, A. Valibouze+    * June 2018: [[https://apr.team.lip6.fr/attic/APR/journeeAPR2018.pdf|APR-2018]], organized by E. Chailloux 
 +    * May 2016: [[https://apr.team.lip6.fr/attic/journeesAPR2016.pdf|APR-2016]], organized by E. Chailloux 
 +    * June 2014 :  [[https://apr.team.lip6.fr/attic/journeeAPR2014.pdf|APR-2014]], organized by E. Chailloux 
 +    * June 2013 : [[https://apr.team.lip6.fr/attic/journeeAPR2013.pdf|APR-2013]], organized by E. Chailloux, P. Trébuchet 
 +    * Feb 2012 [[https://apr.team.lip6.fr/attic/journeeAPRfev2012.pdf|APR-2012]], organized by E. Chailloux 
 +    * June 2010 [[https://apr.team.lip6.fr/attic/Seminaire-2010/programme-seminaire-apr.html|APR-2010]], organized by F. Peschanski, P. Trebuchet, A. Valibouze
  
 ------------- -------------
 +
  
 <html></td></tr></table></html> <html></td></tr></table></html>
research.1514972928.txt.gz · Last modified: by emmanuel