EN FR
EN FR


Bibliography

Major publications by the team in recent years
  • 1J. C. Beyler, P. Clauss.

    Performance driven data cache prefetching in a dynamic software optimization system, in: ICS '07: Proceedings of the 21st annual international conference on Supercomputing, New York, NY, USA, ACM, 2007, p. 202–209.

    http://doi.acm.org/10.1145/1274971.1275000
  • 2J. C. Beyler, M. Klemm, P. Clauss, M. Philippsen.

    A meta-predictor framework for prefetching in object-based DSMs, in: Concurr. Comput. : Pract. Exper., September 2009, vol. 21, p. 1789–1803.

    http://dx.doi.org/10.1002/cpe.v21:14
  • 3P. Clauss.

    Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs, in: ICS '96: Proceedings of the 10th international conference on Supercomputing, New York, NY, USA, ACM, 1996, p. 278–285.

    http://doi.acm.org/10.1145/237578.237617
  • 4P. Clauss, F. J. Fernández, D. Garbervetsky, S. Verdoolaege.

    Symbolic polynomial maximization over convex sets and its application to memory requirement estimation, in: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Aug 2009, vol. 17, no 8, p. 983-996.

    http://hal.inria.fr/inria-00504617
  • 5P. Clauss, V. Loechner.

    Parametric Analysis of Polyhedral Iteration Spaces, in: J. VLSI Signal Process. Syst., 1998, vol. 19, no 2, p. 179–194.

    http://dx.doi.org/10.1023/A:1008069920230
  • 6P. Clauss, I. Tchoupaeva.

    A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization, LNCS, Springer, April 2004, vol. 2985, p. 120-133.
  • 7A. 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, États-Unis Boston, ACM, April 2008, p. 94-103.

    http://dx.doi.org/10.1145/1356058.1356071, http://hal.inria.fr/inria-00504597/en
  • 8V. Loechner, B. Meister, P. Clauss.

    Precise data locality optimization of nested loops, in: Journal of Supercomputing, January 2002, vol. 21, no 1, p. 37–76, Kluwer Academic Pub..
  • 9V. Loechner, D. K. Wilde.

    Parameterized Polyhedra and their Vertices, in: International Journal of Parallel Programming, December 1997, vol. 25, no 6.
  • 10S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, M. Bruynooghe.

    Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, in: Algorithmica, 2007, vol. 48, no 1, p. 37–66.

    http://dx.doi.org/10.1007/s00453-006-1231-0
  • 11É. Violard.

    A Semantic Framework to Address Data Locality in Data Parallel Languages, in: Parallel Computing, 2004, vol. 30, no 1, p. 139-161.
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 13A. Ketterlin, P. Clauss.

    Recovering memory access patterns of executable programs, in: Science of Computer Programming, 2012, (in press). [ DOI : 10.1016/j.scico.2012.08.002 ]

    http://www.sciencedirect.com/science/article/pii/S0167642312001505
  • 14B. Pradelle, A. Ketterlin, P. Clauss.

    Polyhedral parallelization of binary code, in: ACM Transactions on Architecture and Code Optimization, January 2012, vol. 8, no 4, p. 39:1–39:21. [ DOI : 10.1145/2086696.2086718 ]

    http://hal.inria.fr/hal-00664370
  • 15R. 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, no 2, p. 8.1-8.27. [ DOI : 10.1145/2207222.2207224 ]

    http://hal.inria.fr/inria-00582388

International Conferences with Proceedings

  • 16A. Jimborean, P. Clauss, B. Pradelle, L. Mastrangelo, V. Loechner.

    Adapting the Polyhedral Model as a Framework for Efficient Speculative Parallelization, in: PPoPP - 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, New Orleans, United States, ACM Press, February 2012.

    http://hal.inria.fr/hal-00664353
  • 17A. Jimborean, L. Mastrangelo, V. Loechner, P. Clauss.

    VMAD: an Advanced Dynamic Program Analysis & Instrumentation Framework, in: CC - 21st International Conference on Compiler Construction, Tallinn, Estonia, M. F. P. O'Boyle (editor), Lecture Notes in Computer Science, Springer, March 2012, vol. 7210, p. 220-237.

    http://hal.inria.fr/hal-00664345
  • 18A. 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, (in press).

Conferences without Proceedings

  • 19P. Clauss, A. Jimborean.

    Does dynamic and speculative parallelization enable advanced parallelizing and optimizing code transformations?, in: DCE - 1st International Workshop on Dynamic compilation from SoC to Web Browser via HPC, in conjonction with HiPEAC 2012, Paris, France, Henri-Pierre Charles and Philippe Clauss and Frédéric Pétrot, January 2012.

    http://hal.inria.fr/hal-00664339
  • 20B. Cuervo Parrino, J. Narboux, É. Violard, N. Magaud.

    Dealing with arithmetic overflows in the polyhedral model, in: IMPACT 2012 - 2nd International Workshop on Polyhedral Compilation Techniques, Paris, France, U. Bondhugula, V. Loechner (editors), Louis-Noel Pouchet, January 2012.

    http://hal.inria.fr/hal-00655485
References in notes
  • 21F. Agakov, E. Bonilla, J. Cavazos, B. Franke, G. Fursin, M. F. P. O'Boyle, J. Thomson, M. Toussaint, C. K. I. Williams.

    Using Machine Learning to Focus Iterative Optimization, in: CGO '06: Proceedings of the International Symposium on Code Generation and Optimization, Washington, DC, USA, IEEE Computer Society, 2006, p. 295–305.

    http://dx.doi.org/10.1109/CGO.2006.37
  • 22R. Back.

    On the Correctness of Refinement Steps in Program Development, University of Helsinki, 1978.
  • 23J.-P. Banâtre, D. Le Métayer.

    The Gamma Model and its Discipline of Programming, in: Science of Computer Programming, 1990, vol. 15, no 1, p. 55-79.
  • 24B. Barras, S. Boutin, C. Cornes, J. Courant, J.-C. Filliatre, E. Gimenez, H. Herbelin, G. Huet, C. Munoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saibi, B. Werner.

    The Coq Proof Assistant Reference Manual : Version 6.1, 1997.
  • 25M. M. Baskaran, U. Bondhugula, S. Krishnamoorthy, J. Ramanujam, A. Rountev, P. Sadayappan.

    A compiler framework for optimization of affine loop nests for GPGPUs, in: ICS '08: Proceedings of the 22nd annual international conference on Supercomputing, New York, NY, USA, ACM, 2008, p. 225–234.

    http://doi.acm.org/10.1145/1375527.1375562
  • 26C. 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, p. 7–16.

    http://hal.ccsd.cnrs.fr/ccsd-00017260
  • 27Y. Bertot, B. Grégoire, X. Leroy.

    A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis, in: TYPES 2004, 2004, p. 66-81.
  • 28L. Bougé, Y. Le Guyadec, G. Utard, B. Virot.

    A Proof System for a Simple Data-Parallel Programming Language, in: IFIP WG 10.3, Applications in Parallel and Distributed Computing, Caracas (Venezuela), North-Holland, April 1994.
  • 29M. Bridges, N. Vachharajani, Y. Zhang, T. Jablin, D. I. August.

    Revisiting the Sequential Programming Model for Multi-Core, in: MICRO '07: Proceedings of the 40th Annual IEEE/ACM International Symposium on Microarchitecture, Washington, DC, USA, IEEE Computer Society, 2007, p. 69–84.

    http://dx.doi.org/10.1109/MICRO.2007.35
  • 30M. Burtscher, I. Ganusov, S. J. Jackson, J. Ke, P. Ratanaworabhan, N. B. Sam.

    The VPC Trace-Compression Algorithms, in: IEEE Trans. Comput., 2005, vol. 54, no 11, p. 1329–1344.
  • 31D. Cachera, D. Pichardie.

    Embedding of Systems of Affine Recurrence Equations in Coq, in: Proc. of 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'03), Lecture Notes in Computer Science, Springer-Verlag, 2003, no 2758, p. 155–170.
  • 32K. Chandy, J. Misra.

    Parallel Program Design: A Foundation, Addison Wesley, 1988.
  • 33M. Cintra, D. R. Llanos.

    Design Space Exploration of a Software Speculative Parallelization Scheme, in: IEEE Trans. Parallel Distrib. Syst., 2005, vol. 16, no 6, p. 562–576.

    http://dx.doi.org/10.1109/tpds.2005.69
  • 34P. Feautrier.

    Dataflow analysis of scalar and array references, in: International Journal of Parallel Programming, 1991, vol. 20, no 1, p. 23–53.
  • 35P. Feautrier.

    Some efficient solutions to the affine scheduling problem, Part 1 : one dimensional time, in: International Journal of Parallel Programming, 1992, vol. 21, no 5, p. 313–348.
  • 36P. Feautrier.

    Some efficient solutions to the affine scheduling problem, Part 2 : multidimensional time, in: International Journal of Parallel Programming, 1992, vol. 21, no 6.
  • 37P. Feautrier.

    Automatic Parallelization in the Polytope Model, in: The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications, Springer-Verlag, 1996, p. 79–103.
  • 38X. Feng, Z. Shao, Y. Dong, Y. Guo.

    Certifying low-level programs with hardware interrupts and preemptive threads, in: SIGPLAN Not., 2008, vol. 43, no 6, p. 170–182.

    http://dx.doi.org/10.1145/1379022.1375603
  • 39C. Flanagan, S. N. Freund, J. Yi.

    Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs, in: PLDI '08: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, New York, NY, USA, ACM, 2008, p. 293–303.

    http://dx.doi.org/10.1145/1375581.1375618
  • 40P. Gerner.

    La sémantique des directives au compilateur : application au parallélisme de données, Université Louis Pasteur, 2002.
  • 41P. Gerner, É. Violard.

    A Theoretical Framework of Data Parallelism and Its Operational Semantics, in: Euro-Par 2000, LNCS, Springer, 2001, vol. 1900, p. 668–677.
  • 42E. P. Gribomont.

    Stepwise refinement and concurrency: the finite-state case, in: Sci. Comput. Program., 1990, vol. 14, no 2-3, p. 185–228.

    http://dx.doi.org/10.1016/0167-6423(90)90020-E
  • 43M. Hall, D. Padua, K. Pingali.

    Compiler research: the next 50 years, in: Commun. ACM, 2009, vol. 52, no 2, p. 60–67.

    http://doi.acm.org/10.1145/1461928.1461946
  • 44A. Hobor, A. W. Appel, F. Z. Nardelli.

    Oracle Semantics for Concurrent Separation Logic, in: ESOP, 2008, p. 353-367.
  • 45A. Ketterlin, P. Clauss.

    Recovering the Memory Behavior of Executable Programs, in: 10th IEEE Working Conference on Source Code Analysis and Manipulation, SCAM, Roumanie Timisoara, IEEE Computer Society Press, Sep 2010.

    http://hal.inria.fr/inria-00502813
  • 46M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, L. P. Chew.

    Optimistic parallelism requires abstractions, in: PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, New York, NY, USA, ACM, 2007, p. 211–222.

    http://doi.acm.org/10.1145/1250734.1250759
  • 47J. Larus, C. Kozyrakis.

    Transactional memory, in: Commun. ACM, 2008, vol. 51, no 7, p. 80–88.
  • 48E. A. Lee.

    The Problem with Threads, in: Computer, 2006, vol. 39, no 5, p. 33–42.

    http://dx.doi.org/10.1109/MC.2006.180
  • 49C. Lengauer.

    Loop Parallelization in the Polytope Model, in: Parallel Processing Letters, 1994, vol. 4, no 3.
  • 50X. Leroy.

    Formal verification of a realistic compiler, in: Communications of the ACM, July 2009, To appear.
  • 51X. Leroy.

    The Compcert verified compiler, software and commented proof, January 2010.

    http://compcert.inria.fr
  • 52S.-W. Liao, A. Diwan, R. P. Bosch, A. Ghuloum, M. S. Lam.

    SUIF Explorer: an interactive and interprocedural parallelizer, in: PPoPP '99: Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming, New York, NY, USA, ACM, 1999, p. 37–48.

    http://doi.acm.org/10.1145/301104.301108
  • 53V. Loechner, B. Meister, P. Clauss.

    Data Sequence Locality: a Generalization of Temporal Locality, in: Euro-Par 2001, Manchester, UK, Springer, 2001.
  • 54V. Loechner, C. Mongenet.

    Communication Optimization for Affine Recurrence Equations using Broadcast and Locality, in: International Journal of Parallel Programming, 2000, vol. 28, no 1.
  • 55C.-K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V. J. Reddi, K. Hazelwood.

    Pin: building customized program analysis tools with dynamic instrumentation, in: PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, New York, NY, USA, ACM, 2005, p. 190–200.

    http://doi.acm.org/10.1145/1065010.1065034
  • 56K. F. Moore, D. Grossman.

    High-level small-step operational semantics for transactions, in: POPL '08: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, New York, NY, USA, ACM, 2008, p. 51–62.

    http://dx.doi.org/10.1145/1328438.1328448
  • 57T. Moseley, D. A. Connors, D. Grunwald, R. Peri.

    Identifying potential parallelism via loop-centric profiling, in: CF '07: Proceedings of the 4th international conference on Computing frontiers, ACM, 2007, p. 143–152.
  • 58G. C. Necula.

    Translation validation for an optimizing compiler, in: SIGPLAN Not., 2000, vol. 35, no 5, p. 83–94.

    http://doi.acm.org/10.1145/358438.349314
  • 59A. Pnueli, O. Shtrichman, M. Siegel.

    The Code Validation Tool (CVT) - Automatic verification of code generated from synchronous languages, in: Software Tools for Technology Transfer, 1998, vol. 2.
  • 60L.-N. Pouchet, C. Bastoul, A. Cohen, J. Cavazos.

    Iterative optimization in the polyhedral model: part II, multidimensional time, in: PLDI '08: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, New York, NY, USA, ACM, 2008, p. 90–100.

    http://doi.acm.org/10.1145/1375581.1375594
  • 61L.-N. Pouchet, C. Bastoul, A. Cohen, N. Vasilache.

    Iterative Optimization in the Polyhedral Model: part I, One-Dimensional Time, in: CGO '07: Proceedings of the International Symposium on Code Generation and Optimization, Washington, DC, USA, IEEE Computer Society, 2007, p. 144–156.

    http://dx.doi.org/10.1109/CGO.2007.21
  • 62G. D. Price, J. Giacomoni, M. Vachharajani.

    Visualizing potential parallelism in sequential programs, in: PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniques, New York, NY, USA, ACM, 2008, p. 82–90.

    http://doi.acm.org/10.1145/1454115.1454129
  • 63E. Raman, N. Vachharajani, R. Rangan, D. I. August.

    Spice: speculative parallel iteration chunk execution, in: CGO '08: Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization, New York, NY, USA, ACM, 2008, p. 175–184.

    http://doi.acm.org/10.1145/1356058.1356082
  • 64L. Rauchwerger, D. Padua.

    The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization, in: IEEE Trans. Parallel Distrib. Syst., 1999, vol. 10, no 2, p. 160–180.

    http://dx.doi.org/10.1109/71.752782
  • 65R. Seghir.

    Méthodes de dénombrement de points entiers de polyèdres et applications à l'optimisation de programmes, Université de Strasbourg, December 2006.
  • 66T. Sherwood, E. Perelman, G. Hamerly, B. Calder.

    Automatically characterizing large scale program behavior, in: ASPLOS-X: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems, New York, NY, USA, ACM, 2002, p. 45–57.

    http://doi.acm.org/10.1145/605397.605403
  • 67J. Smith, R. Nair.

    Virtual Machines: Versatile Platforms for Systems and Processes (The Morgan Kaufmann Series in Computer Architecture and Design), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2005.
  • 68C. Tian, M. Feng, V. Nagarajan, R. Gupta.

    Copy or Discard Execution Model For Speculative Parallelization On Multicores, in: IEEE/ACM 41st International Symposium on Microarchitecture, MICRO 41, November 2008, p. 330-341.
  • 69J.-B. Tristan, X. Leroy.

    Formal verification of translation validators: a case study on instruction scheduling optimizations, in: SIGPLAN Not., 2008, vol. 43, no 1, p. 17–27.

    http://dx.doi.org/10.1145/1328897.1328444
  • 70J.-B. Tristan, X. Leroy.

    Verified Validation of Lazy Code Motion, in: Programming Language Design and Implementation 2009, ACM Press, 2009, To appear.
  • 71É. Violard, S. Genaud, G.-R. Perrin.

    Refinement of Data Parallel Programs in PEI, in: Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi, London, UK, UK, Chapman & Hall, Ltd., 1997, p. 107–131.
  • 72A. Welc, S. Jagannathan, A. Hosking.

    Safe futures for Java, in: OOPSLA '05: Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, New York, NY, USA, ACM, 2005, p. 439–453.

    http://doi.acm.org/10.1145/1094811.1094845
  • 73Q. Wu, O. Mencer.

    Evaluating Sampling Based Hotspot Detection, in: International Conference on Architecture of Computing Systems, ARCS, March 2009.
  • 74B. Xin, W. N. Sumner, X. Zhang.

    Efficient program execution indexing, in: PLDI '08: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, New York, NY, USA, ACM, 2008, p. 238–248.

    http://doi.acm.org/10.1145/1375581.1375611