Bibliography

Major publications by the team in recent years

• 1P.-N. Clauss, J. Gustedt.
  
  Iterative Computations with Ordered Read-Write Locks, in: Journal of Parallel and Distributed Computing, 2010, vol. 70, n^o 5, pp. 496–504. [ DOI : 10.1016/j.jpdc.2009.09.002 ]
  
  https://hal.inria.fr/inria-00330024
• 2J. Gustedt.
  
  Futex based locks for C11's generic atomics, Inria Nancy, December 2015, n^o RR-8818.
  
  https://hal.inria.fr/hal-01236734
• 3A. Jimborean, P. Clauss, J.-F. Dollinger, V. Loechner, M. Juan Manuel.
  
  Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons, in: International Journal of Parallel Programming, August 2014, vol. 42, n^o 4, pp. 529-545.
  
  https://hal.inria.fr/hal-01003744
• 4A. Ketterlin, P. Clauss.
  
  Prediction and trace compression of data access addresses through nested loop recognition, in: 6th annual IEEE/ACM international symposium on Code generation and optimization, Boston, USA, ACM, April 2008, pp. 94-103.
  
  http://dx.doi.org/10.1145/1356058.1356071
• 5A. Ketterlin, P. Clauss.
  
  Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization, in: MICRO-45 – Proceedings of the 2012 IEEE/ACM 45th International Symposium on Microarchitecture, Vancouver, Canada, December 2012.
• 6B. Pradelle, A. Ketterlin, P. Clauss.
  
  Polyhedral parallelization of binary code, in: ACM Transactions on Architecture and Code Optimization, January 2012, vol. 8, n^o 4, pp. 39:1–39:21. [ DOI : 10.1145/2086696.2086718 ]
  
  http://hal.inria.fr/hal-00664370
• 7R. Seghir, V. Loechner, B. Meister.
  
  Integer Affine Transformations of Parametric Z-polytopes and Applications to Loop Nest Optimization, in: ACM Transactions on Architecture and Code Optimization, June 2012, vol. 9, n^o 2, pp. 8.1-8.27. [ DOI : 10.1145/2207222.2207224 ]
  
  http://hal.inria.fr/inria-00582388

Publications of the year

Articles in International Peer-Reviewed Journals

• 8T. Baroudi, R. Seghir, V. Loechner.
  
  Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts, in: ACM Transactions on Architecture and Code Optimization (TACO) , December 2017.
  
  https://hal.inria.fr/hal-01633724
• 9A. Charguéraud, F. Pottier.
  
  Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, in: Journal of Automated Reasoning, September 2017. [ DOI : 10.1007/s10817-017-9431-7 ]
  
  https://hal.inria.fr/hal-01652785
• 10N. Hallou, E. Rohou, P. Clauss.
  
  Runtime Vectorization Transformations of Binary Code, in: International Journal of Parallel Programming, June 2017, vol. 8, n^o 6, pp. 1536 - 1565. [ DOI : 10.1007/s10766-016-0480-z ]
  
  https://hal.inria.fr/hal-01593216
• 11J. M. Martinez Caamaño, M. Selva, P. Clauss, A. Baloian, W. Wolff.
  
  Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones, in: Concurrency and Computation: Practice and Experience, June 2017, vol. 29, n^o 15. [ DOI : 10.1002/cpe.4192 ]
  
  https://hal.inria.fr/hal-01581093

International Conferences with Proceedings

• 12Y. A. Barsamian, A. Charguéraud, A. Ketterlin.
  
  A Space and Bandwidth Efficient Multicore Algorithm for the Particle-in-Cell Method, in: PPAM 2017 - 12th International Conference on Parallel Processing and Applied Mathematics, Lublin, Poland, September 2017, pp. 1-12.
  
  https://hal.inria.fr/hal-01649172
• 13Y. A. Barsamian, S. A. Hirstoaga, E. Violard.
  
  Efficient Data Structures for a Hybrid Parallel and Vectorized Particle-in-Cell Code, in: IPDPSW 2017 - IEEE International Parallel and Distributed Processing Symposium Workshops, Lake Buena Vista, FL, United States, May 2017, pp. 1168-1177. [ DOI : 10.1109/IPDPSW.2017.74 ]
  
  https://hal.inria.fr/hal-01504645
• 14A. Charguéraud, F. Pottier.
  
  Temporary Read-Only Permissions for Separation Logic, in: Proceedings of the 26th European Symposium on Programming (ESOP 2017), Uppsala, Sweden, April 2017.
  
  https://hal.inria.fr/hal-01408657
• 15P. Clauss, E. Altıntas, M. Kuhn.
  
  Automatic Collapsing of Non-Rectangular Loops, in: Parallel and Distributed Processing Symposium (IPDPS), 2017, Orlando, United States, I. International (editor), May 2017, pp. 778 - 787. [ DOI : 10.1109/IPDPS.2017.34 ]
  
  https://hal.inria.fr/hal-01581081
• 16J. Gustedt, E. Jeannot, F. Mansouri.
  
  Automatic, Abstracted and Portable Topology-Aware Thread Placement, in: IEEE Cluster, Hawaï, United States, Cluster Computing (CLUSTER), 2017 IEEE International Conference on, September 2017, pp. 389 - 399. [ DOI : 10.1109/CLUSTER.2017.71 ]
  
  https://hal.archives-ouvertes.fr/hal-01621936
• 17N. Magaud.
  
  Transferring Arithmetic Decision Procedures (on Z) to Alternative Representations, in: CoqPL 2017: The Third International Workshop on Coq for Programming Languages, Paris, France, January 2017.
  
  https://hal.inria.fr/hal-01518660
• 18L. Morel, M. Selva, K. Marquet, C. Saysset, T. Risset.
  
  CalMAR -a Multi-Application Dataflow Runtime, in: Thirteenth ACM International Conference on Embedded Software 2017, EMSOFT'17, Seoul, South Korea, October 2017. [ DOI : 10.1145/3125503.3125562 ]
  
  https://hal.inria.fr/hal-01631691
• 19H. Razanajato, C. Bastoul, V. Loechner.
  
  Lifting Barriers Using Parallel Polyhedral Regions, in: HiPC 2017 - 24th International Conference on High Performance Computing, Data, and Analytics, Jaipur, India, IEEE, December 2017.
  
  https://hal.inria.fr/hal-01633839
• 20M. Schmitt, P. Helluy, C. Bastoul.
  
  Adaptive Code Refinement: A Compiler Technique and Extensions to Generate Self-Tuning Applications, in: HiPC 2017 - 24th International Conference on High Performance Computing, Data, and Analytics, Jaipur, India, December 2017.
  
  https://hal.inria.fr/hal-01655459

Conferences without Proceedings

• 21J. M. Martinez Caamaño, A. Sukumaran-Rajam, A. Baloian, M. Selva, P. Clauss.
  
  APOLLO: Automatic speculative POLyhedral Loop Optimizer, in: IMPACT 2017 - 7th International Workshop on Polyhedral Compilation Techniques, Stockholm, Sweden, January 2017, 8 p.
  
  https://hal.inria.fr/hal-01533692
• 22H. Razanajato, V. Loechner, C. Bastoul.
  
  Splitting Polyhedra to Generate More Efficient Code: Efficient Code Generation in the Polyhedral Model is Harder Than We Thought, in: IMPACT 2017, 7th International Workshop on Polyhedral Compilation Techniques, Stockholm, Sweden, January 2017.
  
  https://hal.inria.fr/hal-01505764
• 23M. Schmitt, C. Sabater, C. Bastoul.
  
  Semi-Automatic Generation of Adaptive Codes, in: IMPACT 2017 - 7th International Workshop on Polyhedral Compilation Techniques, Stockholm, Sweden, January 2017, pp. 1-7.
  
  https://hal.inria.fr/hal-01655456

Internal Reports

• 24I. Charpentier, J. Gustedt.
  
  Arbogast: Higher order AD for special functions with Modular C, Inria Nancy - Grand Est (Villers-lès-Nancy, France), August 2017, n^o RR-8907, 20 p.
  
  https://hal.inria.fr/hal-01307750

Other Publications

• 25Y. A. Barsamian, J. Bernier, S. A. Hirstoaga, M. Mehrenberger.
  
  Verification of 2D × 2D and two-species Vlasov-Poisson solvers, December 2017, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01668744
• 26Y. A. Barsamian, S. A. Hirstoaga, E. Violard.
  
  Efficient Data Layouts for a Three-Dimensional Electrostatic Particle-in-Cell Code, 2017, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01664207
• 27A. Charguéraud, J.-C. Filliâtre, M. Pereira, F. Pottier.
  
  VOCAL – A Verified OCAml Library, September 2017, ML Family Workshop 2017.
  
  https://hal.inria.fr/hal-01561094
• 28A. Charguéraud, M. Rainey.
  
  Efficient Representations for Large Dynamic Sequences in ML, September 2017, ML Family Workshop, Poster.
  
  https://hal.inria.fr/hal-01669407

References in notes

• 29U. A. Acar, A. Charguéraud, M. Rainey.
  
  Oracle-Guided Scheduling for Controlling Granularity in Implicitly Parallel Languages, in: Journal of Functional Programming, November 2016, vol. 26. [ DOI : 10.1017/S0956796816000101 ]
  
  https://hal.inria.fr/hal-01409069
• 30C. Bastoul.
  
  Code Generation in the Polyhedral Model Is Easier Than You Think, in: PACT'13 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, France, 2004, pp. 7–16.
  
  https://hal.archives-ouvertes.fr/ccsd-00017260
• 31M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith.
  
  A Trusted Mechanised JavaScript Specification, in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, USA, ACM Press, January 2014.
  
  http://hal.inria.fr/hal-00910135
• 32M. Hall, D. Padua, K. Pingali.
  
  Compiler research: the next 50 years, in: Commun. ACM, 2009, vol. 52, n^o 2, pp. 60–67.
  
  http://doi.acm.org/10.1145/1461928.1461946
• 33A. Hobor, A. W. Appel, F. Z. Nardelli.
  
  Oracle Semantics for Concurrent Separation Logic, in: ESOP, 2008, pp. 353-367.