default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Leopoldseder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Florian Huemer, David Leopoldseder, Aleksandar Prokopec, Raphael Mosaner, Hanspeter Mössenböck:
Taking a Closer Look: An Outlier-Driven Approach to Compilation-Time Optimization. ECOOP 2024: 20:1-20:28- 2023
- [j2]Raphael Mosaner, David Leopoldseder, Wolfgang Kisling, Lukas Stadler, Hanspeter Mössenböck:
Compilation Forking: A Fast and Flexible Way of Generating Data for Compiler-Internal Machine Learning Tasks. Art Sci. Eng. Program. 7(1): 3 (2023) - [j1]Sebastian Kloibhofer, Lukas Makor, David Leopoldseder, Daniele Bonetta, Lukas Stadler, Hanspeter Mössenböck:
Control Flow Duplication for Columnar Arrays in a Dynamic Compiler. Art Sci. Eng. Program. 7(3) (2023) - [c27]Andrej Pecimuth
, David Leopoldseder, Petr Tuma:
Diagnosing Compiler Performance by Comparing Optimization Decisions. MPLR 2023: 47-61 - [c26]Andrej Pecimuth, David Leopoldseder, Petr Tuma:
Diagnosing Compiler Performance by Comparing Optimization Decisions (Poster Abstract). MPLR 2023: 179 - [c25]Lubomír Bulej, Vojtech Horký, Michele Tucci, Petr Tuma, François Farquet, David Leopoldseder, Aleksandar Prokopec:
GraalVM Compiler Benchmark Results Dataset (Data Artifact). ICPE (Companion) 2023: 65-69 - [i4]Sebastian Kloibhofer, Lukas Makor, David Leopoldseder, Daniele Bonetta, Lukas Stadler, Hanspeter Mössenböck:
Control Flow Duplication for Columnar Arrays in a Dynamic Compiler. CoRR abs/2302.10098 (2023) - 2022
- [c24]Raphael Mosaner, Gergö Barany, David Leopoldseder, Hanspeter Mössenböck:
Improving Vectorization Heuristics in a Dynamic Compiler with Machine Learning Models. VMIL@SPLASH 2022: 36-47 - [c23]Lukas Makor, Sebastian Kloibhofer, David Leopoldseder, Daniele Bonetta, Lukas Stadler, Hanspeter Mössenböck:
Automatic Array Transformation to Columnar Storage at Run Time. MPLR 2022: 16-28 - [c22]Jacob Kreindl, Daniele Bonetta, Lukas Stadler, David Leopoldseder, Hanspeter Mössenböck:
Dynamic Taint Analysis with Label-Defined Semantics. MPLR 2022: 64-84 - [c21]Raphael Mosaner, David Leopoldseder, Wolfgang Kisling, Lukas Stadler, Hanspeter Mössenböck:
Machine-Learning-Based Self-Optimizing Compiler Heuristics✱. MPLR 2022: 98-111 - [c20]Sebastian Kloibhofer, Lukas Makor, David Leopoldseder, Daniele Bonetta, Lukas Stadler, Hanspeter Mössenböck:
Automatically Transforming Arrays to Columnar Storage at Run Time✱. MPLR 2022: 141-143 - [c19]Jacob Kreindl, Daniele Bonetta, David Leopoldseder, Lukas Stadler, Hanspeter Mössenböck:
Polyglot, Label-Defined Dynamic Taint Analysis in TruffleTaint. MPLR 2022: 152-153 - [i3]Raphael Mosaner, David Leopoldseder, Wolfgang Kisling, Lukas Stadler, Hanspeter Mössenböck:
Compilation Forking: A Fast and Flexible Way of Generating Data for Compiler-Internal Machine Learning Tasks. CoRR abs/2206.14091 (2022) - 2021
- [c18]Florian Latifi, David Leopoldseder, Christian Wimmer, Hanspeter Mössenböck:
CompGen: generation of fast JIT compilers in a multi-language VM. DLS 2021: 35-47 - [c17]Jacob Kreindl, Daniele Bonetta, Lukas Stadler, David Leopoldseder, Hanspeter Mössenböck:
Low-overhead multi-language dynamic taint analysis on managed runtimes through speculative optimization. MPLR 2021: 70-87 - [c16]Raphael Mosaner, David Leopoldseder, Lukas Stadler, Hanspeter Mössenböck:
Using machine learning to predict the code size impact of duplication heuristics in a dynamic compiler. MPLR 2021: 127-135 - 2020
- [c15]Jacob Kreindl, Daniele Bonetta, Lukas Stadler, David Leopoldseder, Hanspeter Mössenböck:
Multi-language dynamic taint analysis in a polyglot virtual machine. MPLR 2020: 15-29 - [c14]Sebastian Kloibhofer, Thomas Pointhuber, Maximilian Heisinger, Hanspeter Mössenböck, Lukas Stadler, David Leopoldseder:
SymJEx: symbolic execution on the GraalVM. MPLR 2020: 63-72 - [c13]Aleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder:
Renaissance: Benchmarking Suite for Parallel Applications on the JVM. SE 2020: 145-146
2010 – 2019
- 2019
- [c12]Aleksandar Prokopec, Gilles Duboscq, David Leopoldseder, Thomas Würthinger:
An Optimization-Driven Incremental Inline Substitution Algorithm for Just-in-Time Compilers. CGO 2019: 164-179 - [c11]Aleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder:
Renaissance: a modern benchmark suite for parallel applications on the JVM. SPLASH (Companion Volume) 2019: 11-12 - [c10]Aleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder:
Renaissance: benchmarking suite for parallel applications on the JVM. PLDI 2019: 31-47 - [c9]Raphael Mosaner, David Leopoldseder, Manuel Rigger, Roland Schatz, Hanspeter Mössenböck:
Supporting on-stack replacement in unstructured languages by loop reconstruction and extraction. MPLR 2019: 1-13 - [i2]Aleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder:
On Evaluating the Renaissance Benchmarking Suite: Variety, Performance, and Complexity. CoRR abs/1903.10267 (2019) - [i1]Raphael Mosaner, David Leopoldseder, Manuel Rigger, Roland Schatz, Hanspeter Mössenböck:
Supporting On-Stack Replacement in Unstructured Languages by Loop Reconstruction and Extraction. CoRR abs/1909.08815 (2019) - 2018
- [c8]David Leopoldseder, Lukas Stadler, Thomas Würthinger, Josef Eisl, Doug Simon, Hanspeter Mössenböck:
Dominance-based duplication simulation (DBDS): code duplication to enable compiler optimizations. CGO 2018: 126-137 - [c7]David Leopoldseder, Lukas Stadler, Manuel Rigger, Thomas Würthinger, Hanspeter Mössenböck:
A cost model for a graph-based intermediate-representation in a dynamic compiler. VMIL@SPLASH 2018: 26-35 - [c6]David Leopoldseder, Roland Schatz, Lukas Stadler, Manuel Rigger, Thomas Würthinger, Hanspeter Mössenböck:
Fast-path loop unrolling of non-counted loops to enable subsequent compiler optimizations. ManLang 2018: 2:1-2:13 - [c5]Josef Eisl, David Leopoldseder, Hanspeter Mössenböck:
Parallel trace register allocation. ManLang 2018: 7:1-7:7 - [c4]Manuel Rigger, Stefan Marr, Stephen Kell, David Leopoldseder, Hanspeter Mössenböck:
An Analysis of x86-64 Inline Assembly in C Programs. VEE 2018: 84-99 - 2017
- [c3]David Leopoldseder:
Simulation-based code duplication for enhancing compiler optimizations. SPLASH (Companion Volume) 2017: 10-12 - [c2]Aleksandar Prokopec, David Leopoldseder, Gilles Duboscq, Thomas Würthinger:
Making collection operations optimal with aggressive JIT compilation. SCALA@SPLASH 2017: 29-40 - 2015
- [c1]David Leopoldseder, Lukas Stadler, Christian Wimmer, Hanspeter Mössenböck:
Java-to-JavaScript translation via structured control flow reconstruction of compiler IR. DLS 2015: 91-103
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 20:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
