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, n^o 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, n^o 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, n^o 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, n^o 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, n^o 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, n^o 1, p. 139-161.

Publications of the year

Doctoral Dissertations and Habilitation Theses

12B. Pradelle.

Static and Dynamic Polyhedral Compilation Methods for the Execution in Multi-core Environments, Université de Strasbourg, December 2011.

Articles in International Peer-Reviewed Journal

13R. 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, 2011, to appear in 2011..

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

International Conferences with Proceedings

14J.-D. Genevaux, J. Narboux, P. Schreck.

Formalization of Wu's simple method in Coq, in: CPP 2011 First International Conference on Certified Programs and Proofs, Kenting, Taiwan, Province Of China, J.-P. Jouannaud, Z. Shao (editors), Lecture Notes in Computer Science, Springer-Verlag, December 2011.

http://hal.inria.fr/inria-00618745/en
15A. Jimborean, M. Herrmann, V. Loechner, P. Clauss.

VMAD: a Virtual Machine for Advanced Dynamic Analysis of Programs, in: IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS, Austin, United States, IEEE, April 2011.

http://hal.inria.fr/inria-00544501/en
16A. Jimborean, V. Loechner, P. Clauss.

Handling Multi-Versioning in LLVM: Code Tracking and Cloning, in: WIR 2011: Workshop on Intermediate Representations, in conjunction with CGO 2011, Chamonix, France, Florent Bouchez, Sebastian Hack, Eelco Visser, April 2011.

http://hal.inria.fr/inria-00572785/en
17A. Ketterlin, P. Clauss.

Efficient Memory Tracing by Program Skeletonization, in: IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS, Austin, United States, IEEE, April 2011.

http://hal.inria.fr/inria-00544497/en
18T. M. Pham, Y. Bertot, J. Narboux.

A Coq-based Library for Interactive and Automated Theorem Proving in Plane Geometry, in: The 11th International Conference on Computational Science and Its Applications (ICCSA 2011), Santander, Spain, Lecture Notes in Computer Science, Springer-Verlag, 2011, vol. 6785, p. 368-383. [ DOI : 10.1007/978-3-642-21898-9_32 ]

http://hal.inria.fr/inria-00584918/en
19B. Pradelle, P. Clauss, V. Loechner.

Adaptive Runtime Selection of Parallel Schedules in the Polytope Model, in: High Performance Computing Symposium, Boston, États-Unis, ACM/SIGSIM, April 2011.

http://hal.inria.fr/inria-00564311/en/
20B. Pradelle, A. Ketterlin, P. Clauss.

Transparent Parallelization of Binary Code, in: First International Workshop on Polyhedral Compilation Techniques, IMPACT 2011, in conjunction with CGO 2011, Chamonix, France, Christophe Alias, Cédric Bastoul, April 2011.

http://hal.inria.fr/inria-00572797/en

Scientific Books (or Scientific Book chapters)

21P. Clauss, D. Garbervetsky, V. Loechner, S. Verdoolaege.

Polyhedral Techniques for Parametric Memory Requirement Estimation, in: Energy-Aware Memory Management for Embedded Multimedia Systems: A Computer-Aided Approach, F. Balasa, D. Pradhan (editors), Taylor & Francis, 2011.

References in notes

22F. 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
23R. Back.

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

The Gamma Model and its Discipline of Programming, in: Science of Computer Programming, 1990, vol. 15, n^o 1, p. 55-79.
25B. 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.
26M. 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
27C. 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
28Y. Bertot, B. Grégoire, X. Leroy.

A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis, in: TYPES 2004, 2004, p. 66-81.
29L. 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.
30M. 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
31M. 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, n^o 11, p. 1329–1344.
32D. 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, n^o 2758, p. 155–170.
33K. Chandy, J. Misra.

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

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

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

Dataflow analysis of scalar and array references, in: International Journal of Parallel Programming, 1991, vol. 20, n^o 1, p. 23–53.
36P. Feautrier.

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

Some efficient solutions to the affine scheduling problem, Part 2 : multidimensional time, in: International Journal of Parallel Programming, 1992, vol. 21, n^o 6.
38P. 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.
39X. Feng, Z. Shao, Y. Dong, Y. Guo.

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

http://dx.doi.org/10.1145/1379022.1375603
40C. 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
41P. Gerner.

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

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

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

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

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

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

Oracle Semantics for Concurrent Separation Logic, in: ESOP, 2008, p. 353-367.
46A. Jimborean, M. Herrmann, V. Loechner, P. Clauss.

A Static-Dynamic Collaborative Framework for Nested Loops Instrumentation and Profiling, Université de Strasbourg, 05 2010.

http://hal.inria.fr/inria-00534745/en/
47A. Jimborean, M. Herrmann, V. Loechner, P. Clauss.

VMAD: a Virtual Machine for Advanced Dynamic Analysis of Programs, Université de Strasbourg, 09 2010.

http://hal.inria.fr/inria-00534748/en/
48A. 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
49M. 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
50J. Larus, C. Kozyrakis.

Transactional memory, in: Commun. ACM, 2008, vol. 51, n^o 7, p. 80–88.
51E. A. Lee.

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

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

Loop Parallelization in the Polytope Model, in: Parallel Processing Letters, 1994, vol. 4, n^o 3.
53X. Leroy.

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

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

http://compcert.inria.fr
55S.-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
56V. Loechner, B. Meister, P. Clauss.

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

Communication Optimization for Affine Recurrence Equations using Broadcast and Locality, in: International Journal of Parallel Programming, 2000, vol. 28, n^o 1.
58C.-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
59K. 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
60T. 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.
61G. C. Necula.

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

http://doi.acm.org/10.1145/358438.349314
62A. 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.
63L.-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
64L.-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
65G. 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
66E. 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
67L. 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, n^o 2, p. 160–180.

http://dx.doi.org/10.1109/71.752782
68R. Seghir.

Méthodes de dénombrement de points entiers de polyèdres et applications à l'optimisation de programmes, Université de Strasbourg, December 2006.
69T. 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
70J. 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.
71C. 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.
72J.-B. Tristan, X. Leroy.

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

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

Verified Validation of Lazy Code Motion, in: Programming Language Design and Implementation 2009, ACM Press, 2009, To appear.
74É. 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.
75A. 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
76Q. Wu, O. Mencer.

Evaluating Sampling Based Hotspot Detection, in: International Conference on Architecture of Computing Systems, ARCS, March 2009.
77B. 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

Previous |

Home