[www] r358269 - [EuroLLVM'19] Prepare the slides and videos landing.

Arnaud A. de Grandmaison via llvm-commits llvm-commits at lists.llvm.org
Fri Apr 12 02:07:18 PDT 2019


Author: aadg
Date: Fri Apr 12 02:07:17 2019
New Revision: 358269

URL: http://llvm.org/viewvc/llvm-project?rev=358269&view=rev
Log:
[EuroLLVM'19] Prepare the slides and videos landing.

Modified:
    www/trunk/devmtg/2019-04/index.html
    www/trunk/devmtg/2019-04/talks.html

Modified: www/trunk/devmtg/2019-04/index.html
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2019-04/index.html?rev=358269&r1=358268&r2=358269&view=diff
==============================================================================
--- www/trunk/devmtg/2019-04/index.html (original)
+++ www/trunk/devmtg/2019-04/index.html Fri Apr 12 02:07:17 2019
@@ -142,6 +142,7 @@ There is a separate schedule for the <a
 <ul>
 <li><a href="talks.html#Keynote_1">
   MLIR: Multi-Level Intermediate Representation for Compiler Infrastructure</a>
+  [ Video ] [ Slides ]
   <i>Tatiana Shpeisman (Google), Chris Lattner (Google)</i>
 </li>
 </ul>
@@ -150,98 +151,122 @@ There is a separate schedule for the <a
 <ul>
 <li><a href="talks.html#Talk_1">
   Switching a Linux distribution's main toolchains to LLVM/Clang</a>
+  [ Video ] [ Slides ]
   <i>Bernhard Rosenkränzer (Linaro, OpenMandriva, LinDev)</i>
 </li>
 <li><a href="talks.html#Talk_2">
   Just compile it: High-level programming on the GPU with Julia</a>
+  [ Video ] [ Slides ]
   <i>Tim Besard (Ghent University)</i>
 </li>
 <li><a href="talks.html#Talk_3">
   The Future of AST Matcher-based Refactoring</a>
+  [ Video ] [ Slides ]
   <i>Stephen Kelly</i>
 </li>
 <li><a href="talks.html#Talk_4">
   A compiler approach to Cyber-Security</a>
+  [ Video ] [ Slides ]
   <i>François de Ferrière (STMicroelectronics)</i>
 </li>
 <li><a href="talks.html#Talk_5">
   Compiler Optimizations for (OpenMP) Target Offloading to GPUs</a>
+  [ Video ] [ Slides ]
   <i>Johannes Doerfert (Argonne National Laboratory), Hal Finkel (Argonne National Laboratory)</i>
 </li>
 <li><a href="talks.html#Talk_6">
   Handling massive concurrency: Development of a programming model for GPU and CPU</a>
+  [ Video ] [ Slides ]
   <i>Matthias Liedtke (SAP)</i>
 </li>
 <li><a href="talks.html#Talk_7">
   Automated GPU Kernel Fusion with XLA</a>
+  [ Video ] [ Slides ]
   <i>Thomas Joerg (Google)</i>
 </li>
 <li><a href="talks.html#Talk_8">
   The Helium Haskell compiler and its new LLVM backend</a>
+  [ Video ] [ Slides ]
   <i>Ivo Gabe de Wolff (University of Utrecht)</i>
 </li>
 <li><a href="talks.html#Talk_9">
   Testing and Qualification of Optimizing Compilers for Functional Safety</a>
+  [ Video ] [ Slides ]
   <i>José Luis March Cabrelles (Solid Sands)</i>
 </li>
 <li><a href="talks.html#Talk_10">
   Improving Debug Information in LLVM to Recover Optimized-out Function Parameters</a>
+  [ Video ] [ Slides ]
   <i>Nikola Prica (RT-RK), Djordje Todorovic (RT-RK), Ananthakrishna Sowda (CISCO), Ivan Baev (CISCO)</i>
 </li>
 <li><a href="talks.html#Talk_11">
   LLVM IR in GraalVM: Multi-Level, Polyglot Debugging with Sulong</a>
+  [ Video ] [ Slides ]
   <i>Jacob Kreindl (Johannes Kepler University Linz)</i>
 </li>
 <li><a href="talks.html#Talk_12">
   LLDB Reproducers</a>
+  [ Video ] [ Slides ]
   <i>Jonas Devlieghere (Apple)</i>
 </li>
 <li><a href="talks.html#Talk_13">
   Sulong: An experience report of using the "other end" of LLVM in GraalVM.</a>
+  [ Video ] [ Slides ]
   <i>Roland Schatz (Oracle Labs), Josef Eisl (Oracle Labs)</i>
 </li>
 <li><a href="talks.html#Talk_14">
   SYCL compiler: zero-cost abstraction and type safety for heterogeneous computing</a>
+  [ Video ] [ Slides ]
   <i>Andrew Savonichev (Intel)</i>
 </li>
 <li><a href="talks.html#Talk_15">
   Handling all Facebook requests with JITed C++ code</a>
+  [ Video ] [ Slides ]
   <i>Huapeng Zhou (Facebook), Yuhan Guo (Facebook)</i>
 </li>
 <li><a href="talks.html#Talk_16">
   clang-scan-deps: Fast dependency scanning for explicit modules</a>
+  [ Video ] [ Slides ]
   <i>Alex Lorenz (Apple), Michael Spencer (Apple)</i>
 </li>
 <li><a href="talks.html#Talk_17">
   Clang tools for implementing cryptographic protocols like OTRv4</a>
+  [ Video ] [ Slides ]
   <i>Sofia Celi (Centro de Autonomia Digital)</i>
 </li>
 <li><a href="talks.html#Talk_18">
   Implementing the C++ Core Guidelines'; Lifetime Safety Profile in Clang</a>
+  [ Video ] [ Slides ]
   <i>Gabor Horvath (Eotvos Lorand University), Matthias Gehre (Silexica GmbH), Herb Sutter (Microsoft)</i>
 </li>
 <li><a href="talks.html#Talk_19">
   Changes to the C++ standard library for C++20</a>
+  [ Video ] [ Slides ]
   <i>Marshall Clow (CppAlliance)</i>
 </li>
 <li><a href="talks.html#Talk_20">
   Adventures with RISC-V Vectors and LLVM</a>
+  [ Video ] [ Slides ]
   <i>Robin Kruppe (TU Darmstadt), Roger Espasa (Esperanto Technologies)</i>
 </li>
 <li><a href="talks.html#Talk_21">
   A Tale of Two ABIs: ILP32 on AArch64</a>
+  [ Video ] [ Slides ]
   <i>Tim Northover (Apple)</i>
 </li>
 <li><a href="talks.html#Talk_22">
   LLVM Numerics Improvements</a>
+  [ Video ] [ Slides ]
   <i>Michael Berg (Apple), Steve Canon (Apple)</i>
 </li>
 <li><a href="talks.html#Talk_23">
   DOE Proxy Apps: Compiler Performance Analysis and Optimistic Annotation Exploration</a>
+  [ Video ] [ Slides ]
   <i>Brian Homerding (Argonne National Laboratory), Johannes Doerfert (Argonne National Laboratory)</i>
 </li>
 <li><a href="talks.html#Talk_24">
-    Loop Fusion, Loop Distribution and their Place in the Loop Optimization Pipeline</a>
+  Loop Fusion, Loop Distribution and their Place in the Loop Optimization Pipeline</a>
+  [ Video ] [ Slides ]
   <i>Kit Barton (IBM), Johannes Doerfert (Argonne National Lab), Hal Finkel (Argonne National Lab), Michael Kruse (Argonne National Lab)</i>
 </li>
 </ul>
@@ -250,14 +275,17 @@ There is a separate schedule for the <a
 <ul>
 <li><a href="talks.html#Tutorial_1">
   Tutorial: Building a Compiler with MLIR</a>
+  [ Video ] [ Slides ]
   <i>Amini Mehdi (Google), Jacques Pienaar (Google), Nicolas Vasilache (Google), Alex Zinenko (Google)</i>
 </li>
 <li><a href="talks.html#Tutorial_2">
   Building an LLVM-based tool: lessons learned</a>
+  [ Video ] [ Slides ]
   <i>Alex Denisov</i>
 </li>
 <li><a href="talks.html#Tutorial_3">
   LLVM IR Tutorial - Phis, GEPs and other things, oh my!</a>
+  [ Video ] [ Slides ]
   <i>Vince Bridgers (Intel Corporation), Felipe de Azevedo Piovezan (Intel Corporation)</i>
 </li>
 </ul>
@@ -266,34 +294,35 @@ There is a separate schedule for the <a
 <ul>
 <li><a href="talks.html#SRC_1">
   Safely Optimizing Casts between Pointers and Integers</a>
-  <i>Juneyoung Lee (Seoul National University, Korea), Chung-Kil Hur (Seoul National University, Korea), Ralf Jung (MPI-SWS, Germany), Zhengyang Liu (University of Utah, USA), John Regehr (University of Utah, USA), Nuno P. Lopes (Microsoft Research, UK)</i>
   [ Video ] [ <a href="slides/SRC-Lee-Safely_optimizing_casts_between_pointers_and_integers.pdf">Slides</a> ]
+  <i>Juneyoung Lee (Seoul National University, Korea), Chung-Kil Hur (Seoul National University, Korea), Ralf Jung (MPI-SWS, Germany), Zhengyang Liu (University of Utah, USA), John Regehr (University of Utah, USA), Nuno P. Lopes (Microsoft Research, UK)</i>
 </li>
 <li><a href="talks.html#SRC_2">
   An alternative OpenMP Backend for Polly</a>
-  <i>Michael Halkenhäuser (TU Darmstadt)</i>
   [ Video ] [ <a href="slides/SRC-Halkenhauser-An_alternative_OpenMP_backend_for_Polly.pdf">Slides</a> ]
+  <i>Michael Halkenhäuser (TU Darmstadt)</i>
 </li>
 <li><a href="talks.html#SRC_3">
   Implementing SPMD control flow in LLVM using reconverging CFGs</a>
+  [ Video ] [ <a href="slides/SRC-Wahlster-Implementing_SPMD_control_flow_in_LLVM_using_reconverging_CFGs.pdf">Slides</a> ]
   <i>Fabian Wahlster (Technische Universität München), Nicolai
   Hähnle (Advanced Micro Devices)</i>
-  [ Video ] [ <a href="slides/SRC-Wahlster-Implementing_SPMD_control_flow_in_LLVM_using_reconverging_CFGs.pdf">Slides</a> ]
 </li>
 <li><a href="talks.html#SRC_4">
   Function Merging by Sequence Alignment</a>
+  [ Video ] [ Slides ]
   <i>Rodrigo Rocha (University of Edinburgh), Pavlos Petoumenos (University of Edinburgh), Zheng Wang (Lancaster University), Murray Cole (University of Edinburgh), Hugh Leather (University of Edinburgh)</i>
 </li>
 <li><a href="talks.html#SRC_5">
   Compilation and optimization with security annotations</a>
-  <i>Son Tuan Vu (LIP6), Karine Heydemann (LIP6), Arnaud de Grandmaison (ARM), Albert Cohen (Google)</i>
   [ Video ] [ <a href="slides/SRC-TuanVu-Compilation_and_optimization_with_security_annotations.pdf">Slides</a> ]
+  <i>Son Tuan Vu (LIP6), Karine Heydemann (LIP6), Arnaud de Grandmaison (ARM), Albert Cohen (Google)</i>
 </li>
 <li><a href="talks.html#SRC_6">
   Adding support for C++ contracts to Clang</a>
+  [ Video ] [ <a href="slides/SRC-Lopez-Gomez-Adding_support_for_C++_contracts_to_clang.pdf">Slides</a> ]
   <i>Javier López-Gómez (University Carlos III of Madrid), J.
     Daniel García (University Carlos III of Madrid)</i>
-  [ Video ] [ <a href="slides/SRC-Lopez-Gomez-Adding_support_for_C++_contracts_to_clang.pdf">Slides</a> ]
 </li>
 </ul>
 
@@ -301,58 +330,72 @@ There is a separate schedule for the <a
 <ul>
 <li><a href="talks.html#LightningTalk_1">
   LLVM IR Timing Predictions: Fast Explorations via lli</a>
+  [ Video ] [ Slides ]
   <i>Alessandro Cornaglia (FZI - Research Center for Information Technology)</i>
 </li>
 <li><a href="talks.html#LightningTalk_2">
   Simple Outer-Loop-Vectorization == LoopUnroll-And-Jam + SLP</a>
+  [ Video ] [ Slides ]
   <i>Dibyendu Das (AMD)</i>
 </li>
 <li><a href="talks.html#LightningTalk_3">
   Clacc 2019: An Update on OpenACC Support for Clang and LLVM</a>
+  [ Video ] [ Slides ]
   <i>Joel E. Denny (Oak Ridge National Laboratory), Seyong Lee (Oak Ridge National Laboratory), Jeffrey S. Vetter (Oak Ridge National Laboratory)</i>
 </li>
 <li><a href="talks.html#LightningTalk_4">
   Targeting a statically compiled program repository with LLVM</a>
+  [ Video ] [ Slides ]
   <i>Phil Camp (SN Systems (Sony Interactive Entertainment)), Russell Gallop (SN Systems (Sony Interactive Entertainment))</i>
 </li>
 <li><a href="talks.html#LightningTalk_5">
   Does the win32 clang compiler executable really need to be over 21MB in size?</a>
+  [ Video ] [ Slides ]
   <i>Russell Gallop (SN Systems), Greg Bedwell (SN Systems)</i>
 </li>
 <li><a href="talks.html#LightningTalk_6">
   Resolving the almost decade old checker dependency issue in the Clang Static Analyzer</a>
+  [ Video ] [ Slides ]
   <i>Kristóf Umann (Ericsson Hungary, Eötvös Loránd University)</i>
 </li>
 <li><a href="talks.html#LightningTalk_7">
   Adopting LLVM Binary Utilities in Toolchains</a>
+  [ Video ] [ Slides ]
   <i>Jordan Rupprecht (Google)</i>
 </li>
 <li><a href="talks.html#LightningTalk_8">
   Multiplication and Division in the Range-Based Constraint Manager</a>
+  [ Video ] [ Slides ]
   <i>Ádám Balogh (Ericsson Hungary Ltd.)</i>
 </li>
 <li><a href="talks.html#LightningTalk_9">
   Statistics Based Checkers in the Clang Static Analyzer</a>
+  [ Video ] [ Slides ]
   <i>Ádám Balogh (Ericsson Hungary Ltd.)</i>
 </li>
 <li><a href="talks.html#LightningTalk_10">
   Flang Update</a>
+  [ Video ] [ Slides ]
   <i>Steve Scalpone (NVIDA / PGI / Flang)</i>
 </li>
 <li><a href="talks.html#LightningTalk_11">
   Swinging Modulo Scheduling together with Register Allocation</a>
+  [ Video ] [ Slides ]
   <i>Lama Saba (Intel)</i>
 </li>
 <li><a href="talks.html#LightningTalk_12">
   LLVM for the Apollo Guidance Computer</a>
+  [ Video ] [ Slides ]
   <i>Lewis Revill (University of Bath)</i>
 </li>
 <li><a href="talks.html#LightningTalk_13">
   Catch dangling inner pointers with the Clang Static Analyzer</a>
+  [ Video ] [ Slides ]
   <i>Réka Kovács (Eötvös Loränd University)</i>
 </li>
 <li><a href="talks.html#LightningTalk_14">
   Cross translation unit test case reduction</a>
+  [ Video ] [ Slides ]
   <i>Réka Kovács (Eötvös Loränd University)</i>
 </li>
 </ul>
@@ -396,75 +439,93 @@ There is a separate schedule for the <a
 <ul>
 <li><a href="talks.html#Poster_1">
   Clava: C/C++ source-to-source from CMake using LARA</a>
+  [ Poster ]
   <i>João Bispo (FEUP/INESCTEC)</i>
 </li>
 <li><a href="talks.html#Poster_2">
   Safely Optimizing Casts between Pointers and Integers</a>
+  [ Poster ]
   <i>Juneyoung Lee (Seoul National University, Korea), Chung-Kil Hur (Seoul National University, Korea), Ralf Jung (MPI-SWS, Germany), Zhengyang Liu (University of Utah, USA), John Regehr (University of Utah, USA), Nuno P. Lopes (Microsoft Research, UK)</i>
 </li>
 <li><a href="talks.html#Poster_3">
   Scalar Evolution Canon: Click! Canonicalize SCEV and validate it by Z3 SMT solver!</a>
+  [ Poster ]
   <i>Lin-Ya Yu (Xilinx), Alexandre Isoard (Xilinx)</i>
 </li>
 <li><a href="talks.html#Poster_4">
   Splendid GVN: Partial Redundancy Elimination for Algebraic Simplification</a>
+  [ Poster ]
   <i>Li-An Her (National Tsing Hua University), Jenq-Kuen Lee (National Tsing Hua University)</i>
 </li>
 <li><a href="talks.html#Poster_5">
   An alternative OpenMP Backend for Polly</a>
+  [ Poster ]
   <i>Michael Halkenhäuser (TU Darmstadt)</i>
 </li>
 <li><a href="talks.html#Poster_6">
   Does the win32 clang compiler executable really need to be over 21MB in size?</a>
+  [ Poster ]
   <i>Russell Gallop (SN Systems), G Bedwell (SN Systems)</i>
 </li>
 <li><a href="talks.html#Poster_7">
   Enabling Multi- and Cross-Language Verification with LLVM</a>
+  [ Poster ]
   <i>Jack J. Garzella (University of Utah), Marek Baranowski (University of Utah),
     Shaobo He (University of Utah), Zvonimir Rakamaric (University of Utah)</i>
 </li>
 <li><a href="talks.html#Poster_8">
   Instruction Tracing and dynamic codegen analysis to identify unique llvm performance issues.</a>
+  [ Poster ]
   <i>Biplob (IBM)</i>
 </li>
 <li><a href="talks.html#Poster_9">
   Handling all Facebook requests with JITed C++ code</a>
+  [ Poster ]
   <i>Huapeng Zhou (Facebook), Yuhan Guo (Facebook)</i>
 </li>
 <li><a href="talks.html#Poster_10">
   Implementing SPMD control flow in LLVM using reconverging CFGs</a>
+  [ Poster ]
   <i>Fabian Wahlster (Technische Universität München), Nicolai Hähnle (Advanced Micro Devices)</i>
 </li>
 <li><a href="talks.html#Poster_11">
   LLVM for the Apollo Guidance Computer</a>
+  [ Poster ]
   <i>Lewis Revill (University of Bath)</i>
 </li>
 <li><a href="talks.html#Poster_12">
   LLVM Miner: Text Analytics based Static Knowledge Extractor</a>
+  [ Poster ]
   <i>Hameeza Ahmed (NED University of Engineering and Technology), Muhammad Ali Ismail (NED University of Engineering and Technology)</i>
 </li>
 <li><a href="talks.html#Poster_13">
   Function Merging by Sequence Alignment</a>
+  [ Poster ]
   <i>Rodrigo Rocha (University of Edinburgh), Pavlos Petoumenos (University of Edinburgh), Zheng Wang (Lancaster University), Murray Cole (University of Edinburgh), Hugh Leather (University of Edinburgh)</i>
 </li>
 <li><a href="talks.html#Poster_14">
   Compilation and optimization with security annotations</a>
+  [ Poster ]
   <i>Son Tuan Vu (LIP6), Karine Heydemann (LIP6), Arnaud de Grandmaison (ARM), Albert Cohen (Google)</i>
 </li>
 <li><a href="talks.html#Poster_15">
   Cross translation unit test case reduction</a>
+  [ Poster ]
   <i>Réka Kovács (Eötvös Loränd University)</i>
 </li>
 <li><a href="talks.html#Poster_16">
   Leveraging Polyhedral Compilation in Chapel Compiler</a>
+  [ Poster ]
   <i>Sahil Yerawar (IIT Hyderabad), Siddharth Bhat (IIIT Hyderabad), Michael Ferguson (Cray Inc.), Philip Pfaffe (Karlsruhe Institute of Technology), Ramakrishna Upadrasta (IIT Hyderabad)</i>
 </li>
 <li><a href="talks.html#Poster_17">
   LLVM on AVR - textual IR as a powerful tool for making "impossible" compilers</a>
+  [ Poster ]
   <i>Carl Peto (Swift for Arduino/Petosoft)</i>
 </li>
 <li><a href="talks.html#Poster_18">
   Vectorizing Add/Sub Expressions with SLP</a>
+  [ Poster ]
   <i>Vasileios Porpodas (Intel Corporation, USA), Rodrigo C. O. Rocha (University
   of Edinburgh, UK), Evgueni Brevnov (Intel Corporation, USA), Luís F.
   W. Góes (PUC Minas, Brazil), Timothy Mattson (Intel Corporation,
@@ -472,11 +533,13 @@ USA)</i>
 </li>
 <li><a href="talks.html#Poster_19">
   Adding support for C++ contracts to Clang</a>
+  [ Poster ]
   <i>Javier López-Gómez (University Carlos III of Madrid), J.
   Daniel García (University Carlos III of Madrid)</i>
 </li>
 <li><a href="talks.html#Poster_20">
   Optimizing Nondeterminacy: Exploiting Race Conditions in Parallel Programs</a>
+  [ Poster ]
   <i>William S. Moses (MIT CSAIL)</i>
 </li>
 </ul>

Modified: www/trunk/devmtg/2019-04/talks.html
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2019-04/talks.html?rev=358269&r1=358268&r2=358269&view=diff
==============================================================================
--- www/trunk/devmtg/2019-04/talks.html (original)
+++ www/trunk/devmtg/2019-04/talks.html Fri Apr 12 02:07:17 2019
@@ -34,7 +34,8 @@ ideas about LLVM and its (potential) app
 <table cellpadding="10">
 
 <tr><td valign="top" id="Keynote_1">
-<b>MLIR: Multi-Level Intermediate Representation for Compiler Infrastructure</b><br>
+<b>MLIR: Multi-Level Intermediate Representation for Compiler Infrastructure</b>
+ [ Video ] [ Slides ]<br>
 <i>Tatiana Shpeisman (Google), Chris Lattner (Google)</i>
 <p>This talk will give an overview of Multi-Level Intermediate Representation -
 a new intermediate representation designed to provide a unified, flexible and
@@ -67,7 +68,8 @@ especially in machine learning and other
 <table cellpadding="10">
 
 <tr><td valign="top" id="Talk_1">
-<b>Switching a Linux distribution's main toolchains to LLVM/Clang</b><br>
+<b>Switching a Linux distribution's main toolchains to LLVM/Clang</b>
+ [ Video ] [ Slides ]<br>
 <i>Bernhard Rosenkränzer (Linaro, OpenMandriva, LinDev)</i>
 <p>OpenMandriva is the first general-purpose Linux distribution that has
 switched its primary toolchain to Clang -- this talk will give an overview of
@@ -76,7 +78,8 @@ problems (usually worked around by using
 </td></tr>
 
 <tr><td valign="top" id="Talk_2">
-<b>Just compile it: High-level programming on the GPU with Julia</b><br>
+<b>Just compile it: High-level programming on the GPU with Julia</b>
+ [ Video ] [ Slides ]<br>
 <i>Tim Besard (Ghent University)</i>
 <p>High-level programming languages often rely on interpretation or compilation
 schemes that are ill-suited for hardware accelerators like GPUs: These devices
@@ -93,7 +96,8 @@ top of this infrastructure.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_3">
-<b>The Future of AST Matcher-based Refactoring</b><br>
+<b>The Future of AST Matcher-based Refactoring</b>
+ [ Video ] [ Slides ]<br>
 <i>Stephen Kelly</i>
 <p>In the last few years, Clang has opened up new possibilities in C++ tooling
 for the masses. Tools such as clang-tidy and clazy offer ready-to-use
@@ -121,7 +125,8 @@ creating working refactorings.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_4">
-<b>A compiler approach to Cyber-Security</b><br>
+<b>A compiler approach to Cyber-Security</b>
+ [ Video ] [ Slides ]<br>
 <i>François de Ferrière (STMicroelectronics)</i>
 <p>STMicroelectronics is developing LLVM-based compilation tools for its
 proprietary processors and also for the ARM cores. Applications, among which an
@@ -138,7 +143,8 @@ constraints on performance and code size
 </td></tr>
 
 <tr><td valign="top" id="Talk_5">
-<b>Compiler Optimizations for (OpenMP) Target Offloading to GPUs</b><br>
+<b>Compiler Optimizations for (OpenMP) Target Offloading to GPUs</b>
+ [ Video ] [ Slides ]<br>
 <i>Johannes Doerfert (Argonne National Laboratory), Hal Finkel (Argonne National Laboratory)</i>
 <p>The support of OpenMP target offloading in Clang is steadily increasing.
 However, when it comes to the optimization of such codes, LLVM is still doing a
@@ -157,7 +163,8 @@ discussion on the LLVM mailing list and
 </td></tr>
 
 <tr><td valign="top" id="Talk_6">
-<b>Handling massive concurrency: Development of a programming model for GPU and CPU</b><br>
+<b>Handling massive concurrency: Development of a programming model for GPU and CPU</b>
+ [ Video ] [ Slides ]<br>
 <i>Matthias Liedtke (SAP)</i>
 <p>For efficient parallel execution it is necessary to write massively
 concurrent algorithms and to optimize memory access.  In this session we show
@@ -170,7 +177,8 @@ reach a performance comparable to OpenCL
 </td></tr>
 
 <tr><td valign="top" id="Talk_7">
-<b>Automated GPU Kernel Fusion with XLA</b><br>
+<b>Automated GPU Kernel Fusion with XLA</b>
+ [ Video ] [ Slides ]<br>
 <i>Thomas Joerg (Google)</i>
 <p>XLA (Accelerated Linear Algebra) is an optimizing compiler for linear
 algebra that accelerates TensorFlow computations. The XLA compiler lowers to
@@ -187,7 +195,8 @@ kernels.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_8">
-<b>The Helium Haskell compiler and its new LLVM backend</b><br>
+<b>The Helium Haskell compiler and its new LLVM backend</b>
+ [ Video ] [ Slides ]<br>
 <i>Ivo Gabe de Wolff (University of Utrecht)</i>
 <p>Helium, developed at the University of Utrecht, is a compiler for the
 functional, lazy language Haskell. It is used for research on error diagnosis
@@ -198,7 +207,8 @@ level optimizations which cannot be done
 </td></tr>
 
 <tr><td valign="top" id="Talk_9">
-<b>Testing and Qualification of Optimizing Compilers for Functional Safety</b><br>
+<b>Testing and Qualification of Optimizing Compilers for Functional Safety</b>
+ [ Video ] [ Slides ]<br>
 <i>José Luis March Cabrelles (Solid Sands)</i>
 <p>In the development of embedded applications, the compiler plays a crucial
 role in the translation from source to machine code. If the application is
@@ -223,7 +233,8 @@ through.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_10">
-<b>Improving Debug Information in LLVM to Recover Optimized-out Function Parameters</b><br>
+<b>Improving Debug Information in LLVM to Recover Optimized-out Function Parameters</b>
+ [ Video ] [ Slides ]<br>
 <i>Nikola Prica (RT-RK), Djordje Todorovic (RT-RK), Ananthakrishna Sowda (CISCO), Ivan Baev (CISCO)</i>
 <p>Software release products are compiled with optimization level -O2 and
 higher. Such products might produce a core-file that is used for investigating
@@ -244,7 +255,8 @@ function parameters.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_11">
-<b>LLVM IR in GraalVM: Multi-Level, Polyglot Debugging with Sulong</b><br>
+<b>LLVM IR in GraalVM: Multi-Level, Polyglot Debugging with Sulong</b>
+ [ Video ] [ Slides ]<br>
 <i>Jacob Kreindl (Johannes Kepler University Linz)</i>
 <p>Sulong is an execution engine for LLVM bitcode that has support for
 debugging programs at the level of source code as well as textual LLVM IR. It
@@ -266,7 +278,8 @@ Sulong's support for debugging progr
 </td></tr>
 
 <tr><td valign="top" id="Talk_12">
-<b>LLDB Reproducers</b><br>
+<b>LLDB Reproducers</b>
+ [ Video ] [ Slides ]<br>
 <i>Jonas Devlieghere (Apple)</i>
 <p>The debugger, like the compiler, is a complex piece of software where bugs
 are inevitable. When a bug is reported, one of the first steps in its life
@@ -289,7 +302,8 @@ what is possible and what isn't.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_13">
-<b>Sulong: An experience report of using the "other end" of LLVM in GraalVM.</b><br>
+<b>Sulong: An experience report of using the "other end" of LLVM in GraalVM.</b>
+ [ Video ] [ Slides ]<br>
 <i>Roland Schatz (Oracle Labs), Josef Eisl (Oracle Labs)</i>
 <p>The most common use-case for LLVM is to re-use its back-end to implement a
 compiler for new programming languages. In project Sulong, we are going a
@@ -310,7 +324,8 @@ challenging and where we think we can co
 </td></tr>
 
 <tr><td valign="top" id="Talk_14">
-<b>SYCL compiler: zero-cost abstraction and type safety for heterogeneous computing</b><br>
+<b>SYCL compiler: zero-cost abstraction and type safety for heterogeneous computing</b>
+ [ Video ] [ Slides ]<br>
 <i>Andrew Savonichev (Intel)</i>
 <p>SYCL is an abstraction layer for C++, that allows a developer to write
 heterogeneous programs in a "single source" model, where host and
@@ -331,7 +346,8 @@ LLVM and Clang as described in the RFC:
 </td></tr>
 
 <tr><td valign="top" id="Talk_15">
-<b>Handling all Facebook requests with JITed C++ code</b><br>
+<b>Handling all Facebook requests with JITed C++ code</b>
+ [ Video ] [ Slides ]<br>
 <i>Huapeng Zhou (Facebook), Yuhan Guo (Facebook)</i>
 <p>Facebook needs an efficient scripting framework to enable fast iteration of
 HTTP request handling logic in our L7 reverse proxy. A C++ scripting engine and
@@ -352,7 +368,8 @@ change.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_16">
-<b>clang-scan-deps: Fast dependency scanning for explicit modules</b><br>
+<b>clang-scan-deps: Fast dependency scanning for explicit modules</b>
+ [ Video ] [ Slides ]<br>
 <i>Alex Lorenz (Apple), Michael Spencer (Apple)</i>
 <p>The dependency information that's provided by Clang can be used to
 implement a pre-scanning phase for a build system that uses Clang modules in an
@@ -367,7 +384,8 @@ implement a fast pre-scanning phase for
 </td></tr>
 
 <tr><td valign="top" id="Talk_17">
-<b>Clang tools for implementing cryptographic protocols like OTRv4</b><br>
+<b>Clang tools for implementing cryptographic protocols like OTRv4</b>
+ [ Video ] [ Slides ]<br>
 <i>Sofia Celi (Centro de Autonomia Digital)</i>
 <p>OTRv4 is the newest version of the Off-The-Record protocol. It is a protocol
 where the newest academic research intertwines with real-world implementations:
@@ -389,7 +407,8 @@ aim to provide the best security propert
 </td></tr>
 
 <tr><td valign="top" id="Talk_18">
-<b>Implementing the C++ Core Guidelines' Lifetime Safety Profile in Clang</b><br>
+<b>Implementing the C++ Core Guidelines' Lifetime Safety Profile in Clang</b>
+ [ Video ] [ Slides ]<br>
 <i>Gabor Horvath (Eotvos Lorand University), Matthias Gehre (Silexica GmbH),
   Herb Sutter (Microsoft)</i>
 <p>This is an experience report of the Clang-based implementation of Herb
@@ -406,7 +425,8 @@ the checker.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_19">
-<b>Changes to the C++ standard library for C++20</b><br>
+<b>Changes to the C++ standard library for C++20</b>
+ [ Video ] [ Slides ]<br>
 <i>Marshall Clow (CppAlliance)</i>
 <p>The next version of the C++ standard will almost certainly be approved next
 year, and be called C++20.   There will be many new features in the standard
@@ -416,7 +436,8 @@ update on the status of their implementa
 </td></tr>
 
 <tr><td valign="top" id="Talk_20">
-<b>Adventures with RISC-V Vectors and LLVM</b><br>
+<b>Adventures with RISC-V Vectors and LLVM</b>
+ [ Video ] [ Slides ]<br>
 <i>Robin Kruppe (TU Darmstadt), Roger Espasa (Esperanto Technologies)</i>
 <p>RISC-V is a free and open instruction set architecture (ISA) with an
 established LLVM backend and numerous open-source and proprietary hardware
@@ -432,7 +453,8 @@ dynamically reconfigured for increased e
 </td></tr>
 
 <tr><td valign="top" id="Talk_21">
-<b>A Tale of Two ABIs: ILP32 on AArch64</b><br>
+<b>A Tale of Two ABIs: ILP32 on AArch64</b>
+ [ Video ] [ Slides ]<br>
 <i>Tim Northover (Apple)</i>
 <p>We faced the challenge of seamlessly running 32b application binaries on a
 new 64b S4 chip, which has no hardware support to run 32b binaries. Translating
@@ -446,7 +468,8 @@ compatible to the original 32b applicati
 </td></tr>
 
 <tr><td valign="top" id="Talk_22">
-<b>LLVM Numerics Improvements</b><br>
+<b>LLVM Numerics Improvements</b>
+ [ Video ] [ Slides ]<br>
 <i>Michael Berg (Apple), Steve Canon (Apple)</i>
 <p>Some LLVM based compilers currently provide two modes of floating point code
 generation. The first mode, called fast-math, is where performance is the
@@ -477,7 +500,8 @@ implications for front-ends and backends
 </td></tr>
 
 <tr><td valign="top" id="Talk_23">
-<b>DOE Proxy Apps: Compiler Performance Analysis and Optimistic Annotation Exploration</b><br>
+<b>DOE Proxy Apps: Compiler Performance Analysis and Optimistic Annotation Exploration</b>
+ [ Video ] [ Slides ]<br>
 <i>Brian Homerding (Argonne National Laboratory), Johannes Doerfert (Argonne National Laboratory)</i>
 <p>The US Department of Energy proxy applications are simplified models of the
 key components of various scientific computing workloads.  These proxy
@@ -494,7 +518,8 @@ make use of this information.</p>
 </td></tr>
 
 <tr><td valign="top" id="Talk_24">
-<b>Loop Fusion, Loop Distribution and their Place in the Loop Optimization Pipeline</b><br>
+<b>Loop Fusion, Loop Distribution and their Place in the Loop Optimization Pipeline</b>
+ [ Video ] [ Slides ]<br>
 <i>Kit Barton (IBM), Johannes Doerfert (Argonne National Lab), Hal Finkel
   (Argonne National Lab), Michael Kruse (Argonne National Lab)</i>
 <p>Loop fusion and loop distribution are two key optimizations that typically
@@ -535,7 +560,8 @@ LLVM.</p>
 <table cellpadding="10">
 
 <tr><td valign="top" id="Tutorial_1">
-<b>Tutorial: Building a Compiler with MLIR</b><br>
+<b>Tutorial: Building a Compiler with MLIR</b>
+ [ Video ] [ Slides ]<br>
 <i>Amini Mehdi (Google), Jacques Pienaar (Google), Nicolas Vasilache (Google)</i>
 <p>This tutorial will complement the technical talk about MLIR. We will
 implement a custom DSL for numerical processing and walk the audience
@@ -545,7 +571,8 @@ code generation or JIT execution.</p>
 </td></tr>
 
 <tr><td valign="top" id="Tutorial_2">
-<b>Building an LLVM-based tool: lessons learned</b><br>
+<b>Building an LLVM-based tool: lessons learned</b>
+ [ Video ] [ Slides ]<br>
 <i>Alex Denisov</i>
 <p>In this talk, I want to share my experience in building an LLVM-based tool.</p>
 <p>For the last three years, I work on a tool for mutation testing. Currently,
@@ -563,7 +590,8 @@ it works on Linux, macOS, and FreeBSD an
 </td></tr>
 
 <tr><td valign="top" id="Tutorial_3">
-<b>LLVM IR Tutorial - Phis, GEPs and other things, oh my!</b><br>
+<b>LLVM IR Tutorial - Phis, GEPs and other things, oh my!</b>
+ [ Video ] [ Slides ]<br>
 <i>Vince Bridgers (Intel Corporation), Felipe de Azevedo Piovezan (Intel Corporation)</i>
 <p>LLVM intermediate representation (IR) is the abstract description machine
 operations used to translate LLVM front ends to a form that's executable by
@@ -581,7 +609,7 @@ presentation, and for offline review.</p
 
 <tr><td valign="top" id="SRC_1">
 <b>Safely Optimizing Casts between Pointers and Integers</b>
-[ Video ] [ <a href="slides/SRC-Lee-Safely_optimizing_casts_between_pointers_and_integers.pdf">Slides</a> ]<br>
+ [ Video ] [ <a href="slides/SRC-Lee-Safely_optimizing_casts_between_pointers_and_integers.pdf">Slides</a> ]<br>
 <i>Juneyoung Lee (Seoul National University, Korea), Chung-Kil Hur (Seoul
   National University, Korea), Ralf Jung (MPI-SWS, Germany), Zhengyang Liu
   (University of Utah, USA), John Regehr (University of Utah, USA), Nuno P.
@@ -603,7 +631,7 @@ updates, the performance is still compar
 
 <tr><td valign="top" id="SRC_2">
 <b>An alternative OpenMP Backend for Polly</b>
-[ Video ] [ <a href="slides/SRC-Halkenhauser-An_alternative_OpenMP_backend_for_Polly.pdf">Slides</a> ]<br>
+ [ Video ] [ <a href="slides/SRC-Halkenhauser-An_alternative_OpenMP_backend_for_Polly.pdf">Slides</a> ]<br>
 <i>Michael Halkenhäuser (TU Darmstadt)</i>
 <p>LLVM's polyhedral infrastructure framework Polly may automatically
 exploit thread-level parallelism through OpenMP. Currently, the user can only
@@ -620,7 +648,7 @@ backend.</p>
 
 <tr><td valign="top" id="SRC_3">
 <b>Implementing SPMD control flow in LLVM using reconverging CFGs</b>
-[ Video ] [ <a href="slides/SRC-Wahlster-Implementing_SPMD_control_flow_in_LLVM_using_reconverging_CFGs.pdf">Slides</a> ]<br>
+ [ Video ] [ <a href="slides/SRC-Wahlster-Implementing_SPMD_control_flow_in_LLVM_using_reconverging_CFGs.pdf">Slides</a> ]<br>
 <i>Fabian Wahlster (Technische Universität München), Nicolai
   Hähnle (Advanced Micro Devices)</i>
 <p>Compiling programs for an SPMD execution model, e.g. for GPUs or for whole
@@ -674,7 +702,7 @@ significant impact on the performance of
 
 <tr><td valign="top" id="SRC_5">
 <b>Compilation and optimization with security annotations</b>
-[ Video ] [ <a href="slides/SRC-TuanVu-Compilation_and_optimization_with_security_annotations.pdf">Slides</a> ]<br>
+ [ Video ] [ <a href="slides/SRC-TuanVu-Compilation_and_optimization_with_security_annotations.pdf">Slides</a> ]<br>
 <i>Son Tuan Vu (LIP6), Karine Heydemann (LIP6), Arnaud de Grandmaison (ARM),
   Albert Cohen (Google)</i>
 <p>Program analysis and program transformation systems need to express
@@ -700,7 +728,7 @@ binary, so that binary-level analysis to
 
 <tr><td valign="top" id="SRC_6">
 <b>Adding support for C++ contracts to Clang</b>
-[ Video ] [ <a href="slides/SRC-Lopez-Gomez-Adding_support_for_C++_contracts_to_clang.pdf">Slides</a> ]<br>
+ [ Video ] [ <a href="slides/SRC-Lopez-Gomez-Adding_support_for_C++_contracts_to_clang.pdf">Slides</a> ]<br>
 <i>Javier López-Gómez (University Carlos III of Madrid), J.
   Daniel García (University Carlos III of Madrid)</i>
 <p>A language supporting contract-checking allows to detect programming errors.
@@ -1144,7 +1172,8 @@ implications for front-ends and backends
 <table cellpadding="10">
 
 <tr><td valign="top" id="Poster_1">
-<b>Clava: C/C++ source-to-source from CMake using LARA</b><br>
+<b>Clava: C/C++ source-to-source from CMake using LARA</b>
+ [ Poster ]<br>
 <i>João Bispo (FEUP/INESCTEC)</i>
 <p>Clava is a Clang-based source-to-source compiler that executes scripts
 written in LARA, a superset of JavaScript with additional syntax for AST
@@ -1158,7 +1187,8 @@ Clava is open-source and runs on Linux,
 </td></tr>
 
 <tr><td valign="top" id="Poster_2">
-<b>Safely Optimizing Casts between Pointers and Integers</b><br>
+<b>Safely Optimizing Casts between Pointers and Integers</b>
+ [ Poster ]<br>
 <i>Juneyoung Lee (Seoul National University, Korea), Chung-Kil Hur (Seoul
   National University, Korea), Ralf Jung (MPI-SWS, Germany), Zhengyang Liu
   (University of Utah, USA), John Regehr (University of Utah, USA), Nuno P.
@@ -1179,7 +1209,8 @@ updates, the performance is still compar
 </td></tr>
 
 <tr><td valign="top" id="Poster_3">
-<b>Scalar Evolution Canon: Click! Canonicalize SCEV and validate it by Z3 SMT solver!</b><br>
+<b>Scalar Evolution Canon: Click! Canonicalize SCEV and validate it by Z3 SMT solver!</b>
+ [ Poster ]<br>
 <i>Lin-Ya Yu (Xilinx), Alexandre Isoard (Xilinx)</i>
 <p>A scalar evolution(SCEV) is an analyzed expression. It represents how the
 value of scalar variables changes in a program when we execute the code[0]. It
@@ -1201,7 +1232,8 @@ about some simplification that can be do
 </td></tr>
 
 <tr><td valign="top" id="Poster_4">
-<b>Splendid GVN: Partial Redundancy Elimination for Algebraic Simplification</b><br>
+<b>Splendid GVN: Partial Redundancy Elimination for Algebraic Simplification</b>
+ [ Poster ]<br>
 <i>Li-An Her (National Tsing Hua University), Jenq-Kuen Lee (National Tsing Hua University)</i>
 <p>Modern computation of Neural Network, signal processing of GPS and Wifi,
 image processing, etc, highly depends on enormous linear algebra operations.
@@ -1233,7 +1265,8 @@ and New GVN results.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_5">
-<b>An alternative OpenMP Backend for Polly</b><br>
+<b>An alternative OpenMP Backend for Polly</b>
+ [ Poster ]<br>
 <i>Michael Halkenhäuser (TU Darmstadt)</i>
 <p>LLVM's polyhedral infrastructure framework Polly may automatically
 exploit thread-level parallelism through OpenMP. Currently, the user can only
@@ -1249,7 +1282,8 @@ backend.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_6">
-<b>Does the win32 clang compiler executable really need to be over 21MB in size?</b><br>
+<b>Does the win32 clang compiler executable really need to be over 21MB in size?</b>
+ [ Poster ]<br>
 <i>Russell Gallop (SN System), Greg Bedwell (SN Systems)</i>
 <p>The title of this lighting talk is from a bug filed in the early days of the
 PS4 compiler. It noted that the LLVM-based PS4 compiler was more than 3 times
@@ -1262,7 +1296,8 @@ be managed.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_7">
-<b>Enabling Multi- and Cross-Language Verification with LLVM</b><br>
+<b>Enabling Multi- and Cross-Language Verification with LLVM</b>
+ [ Poster ]<br>
 <i>Jack J. Garzella (University of Utah), Marek Baranowski (University of Utah),
 Shaobo He (University of Utah), Zvonimir Rakamaric (University of Utah)</i>
 <p>Developers nowadays regularly use numerous programming languages with
@@ -1289,7 +1324,8 @@ process.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_8">
-<b>Instruction Tracing and dynamic codegen analysis to identify unique llvm performance issues.</b><br>
+<b>Instruction Tracing and dynamic codegen analysis to identify unique llvm performance issues.</b>
+ [ Poster ]<br>
 <i>Biplob (IBM)</i>
 <p>Performance analysis of the machine code generated by a compiler can be
 carried out in different ways and can also be based on application in question.
@@ -1309,7 +1345,8 @@ code sections on IBM Power9 processor.</
 </td></tr>
 
 <tr><td valign="top" id="Poster_9">
-<b>Handling all Facebook requests with JITed C++ code</b><br>
+<b>Handling all Facebook requests with JITed C++ code</b>
+ [ Poster ]<br>
 <i>Huapeng Zhou (Facebook), Yuhan Guo (Facebook)</i>
 <p>Facebook needs an efficient scripting framework to enable fast iteration of
 HTTP request handling logic in our L7 reverse proxy. A C++ scripting engine and
@@ -1330,7 +1367,8 @@ change.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_10">
-<b>Implementing SPMD control flow in LLVM using reconverging CFGs</b><br>
+<b>Implementing SPMD control flow in LLVM using reconverging CFGs</b>
+ [ Poster ]<br>
 <i>Fabian Wahlster (Technische Universität München), Nicolai Hähnle (Advanced Micro Devices)</i>
 <p>Compiling programs for an SPMD execution model, e.g. for GPUs or for whole
 program vectorization on CPUs, requires a transform from the thread-level input
@@ -1355,7 +1393,8 @@ at divergent branches will be able to re
 </td></tr>
 
 <tr><td valign="top" id="Poster_11">
-<b>LLVM for the Apollo Guidance Computer</b><br>
+<b>LLVM for the Apollo Guidance Computer</b>
+ [ Poster ]<br>
 <i>Lewis Revill (University of Bath)</i>
 <p>Nearly 50 years ago on the 20th of July 1969 humans set foot on the moon for
 the first time. Among the many extraordinary engineering feats that made this
@@ -1371,7 +1410,8 @@ to overcome them.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_12">
-<b>LLVM Miner: Text Analytics based Static Knowledge Extractor</b><br>
+<b>LLVM Miner: Text Analytics based Static Knowledge Extractor</b>
+ [ Poster ]<br>
 <i>Hameeza Ahmed (NED University of Engineering and Technology), Muhammad Ali
   Ismail (NED University of Engineering and Technology)</i>
 <p>Compiler converts high level language code into assembly language by
@@ -1414,7 +1454,8 @@ conventional LLVM analysis passes.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_13">
-<b>Function Merging by Sequence Alignment</b><br>
+<b>Function Merging by Sequence Alignment</b>
+ [ Poster ]<br>
 <i>Rodrigo Rocha (University of Edinburgh), Pavlos Petoumenos (University of Edinburgh), Zheng Wang (Lancaster University), Murray Cole (University of Edinburgh), Hugh Leather (University of Edinburgh)</i>
 <p>Resource-constrained devices for embedded systems are becoming increasingly
 important. In such systems, memory is highly restrictive, making code size in
@@ -1439,7 +1480,8 @@ significant impact on the performance of
 </td></tr>
 
 <tr><td valign="top" id="Poster_14">
-<b>Compilation and optimization with security annotations</b><br>
+<b>Compilation and optimization with security annotations</b>
+ [ Poster ]<br>
 <i>Son Tuan Vu (LIP6), Karine Heydemann (LIP6), Arnaud de Grandmaison (ARM),
   Albert Cohen (Google)</i>
 <p>Program analysis and program transformation systems need to express
@@ -1464,7 +1506,8 @@ binary, so that binary-level analysis to
 </td></tr>
 
 <tr><td valign="top" id="Poster_15">
-<b>Cross translation unit test case reduction</b><br>
+<b>Cross translation unit test case reduction</b>
+ [ Poster ]<br>
 <i>Réka Kovács (Eötvös Loränd University)</i>
 <p>C-Reduce, released by Regehr et al. in 2012, is an excellent tool designed
 to generate a minimal test case from a C/C++ file that has some specific
@@ -1484,7 +1527,8 @@ reduction.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_16">
-<b>Leveraging Polyhedral Compilation in Chapel Compiler</b><br>
+<b>Leveraging Polyhedral Compilation in Chapel Compiler</b>
+ [ Poster ]<br>
 <i>Sahil Yerawar (IIT Hyderabad), Siddharth Bhat (IIIT Hyderabad), Michael Ferguson (Cray Inc.), Philip Pfaffe (Karlsruhe Institute of Technology), Ramakrishna Upadrasta (IIT Hyderabad)</i>
 <p>Chapel is an emerging parallel programming language developed with the aim
 of providing better performance in High-Performance Computing as well as
@@ -1498,7 +1542,8 @@ generation.</p>
 </td></tr>
 
 <tr><td valign="top" id="Poster_17">
-<b>LLVM on AVR - textual IR as a powerful tool for making "impossible" compilers</b><br>
+<b>LLVM on AVR - textual IR as a powerful tool for making "impossible" compilers</b>
+ [ Poster ]<br>
 <i>Carl Peto (Swift for Arduino/Petosoft)</i>
 <p>To be demonstrated on stage and available to use and test, I have built a
 prototype compiler for the a subset of the Swift language onto the Arduino UNO
@@ -1514,7 +1559,8 @@ compilers such as Swift to WebAssembly,
 </td></tr>
 
 <tr><td valign="top" id="Poster_18">
-<b>Vectorizing Add/Sub Expressions with SLP</b><br>
+<b>Vectorizing Add/Sub Expressions with SLP</b>
+ [ Poster ]<br>
 <i>Vasileios Porpodas (Intel Corporation, USA), Rodrigo C. O. Rocha (University
   of Edinburgh, UK), Evgueni Brevnov (Intel Corporation, USA), Luís F.
   W. Góes (PUC Minas, Brazil), Timothy Mattson (Intel Corporation,
@@ -1533,7 +1579,8 @@ upstreaming the bulk of this work in a s
 </td></tr>
 
 <tr><td valign="top" id="Poster_19">
-<b>Adding support for C++ contracts to Clang</b><br>
+<b>Adding support for C++ contracts to Clang</b>
+ [ Poster ]<br>
 <i>Javier López-Gómez (University Carlos III of Madrid), J.
   Daniel García (University Carlos III of Madrid)</i>
 <p>A language supporting contract-checking allows to detect programming errors.
@@ -1544,7 +1591,8 @@ specification (now part of the C++20 wor
 </td></tr>
 
 <tr><td valign="top" id="Poster_20">
-<b>Optimizing Nondeterminacy: Exploiting Race Conditions in Parallel Programs</b><br>
+<b>Optimizing Nondeterminacy: Exploiting Race Conditions in Parallel Programs</b>
+ [ Poster ]<br>
 <i>William S. Moses (MIT CSAIL)</i>
 <p>As computation moves towards parallel programming models, writing efficient
 parallel programs becomes paramount. As a result, there have been several




More information about the llvm-commits mailing list