Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lars Ræder Clausen

dblp:c/LarsRClausen · also Lars Clausen · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2005
0000-0002-4883-8748ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 77% Runtime systems and virtual machines · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › code size reduction
code compression
0.012000
Java bytecode compression for low-end embedded systems · ACM Trans. Program. Lang. Syst. 2000
Runtime systems and virtual machines › virtual machine implementation
java virtual machine
0.012000
Java bytecode compression for low-end embedded systems · ACM Trans. Program. Lang. Syst. 2000

Methods — techniques the papers use, named apart from their topics

bytecode factorization · 0.0
YearPublicationVenuePosition
2005 Optimizing Marshalling by Run-Time Program Generation
Baris Aktemur, Joel Jones, Samuel N. Kamin, Lars Ræder Clausen
GPCE4
2003 Jumbo: Run-Time Code Generation for Java and Its Applications
abstract
Run-time code generation is a well-known technique for improving the efficiency of programs by exploiting dynamic information. Unfortunately, the difficulty of constructing run-time code-generators has hampered their widespread use. We describe Jumbo, a tool for easily creating run-time code generators for Java. Jumbo is a compiler for a two-level version of Java, where programs can contain quoted code fragments. The Jumbo API allows the code fragments to be combined at run-time and then executed. We illustrate Jumbo with several examples that show significant speedups over similar code written in plain Java, and argue further that Jumbo is a generalized software component system.
Samuel N. Kamin, Lars Ræder Clausen, Ava Jarvis
CGO2
2000 Java bytecode compression for low-end embedded systems
abstract
A program executing on a low-end embedded system, such as a smart-card, faces scarce memory resources and fixed execution time constraints. We demonstrate that factorization of common instruction sequences in Java bytecode allows the memory footprint to be reduced, on average, to 85% of its original size, with a minimal execution time penalty. While preserving Java compatibility, our solution requires only a few modifications which are straightforward to implement in any JVM used in a low-end embedded system.
Lars Ræder Clausen, Ulrik Pagh Schultz Lundquist, Charles Consel, Gilles Muller
ACM Trans. Program. Lang. Syst.1
1997 A Java Bytecode Optimizer Using Side-Effect Analysis
abstract
This paper describes Cream, an optimizer for Java bytecode using side-effect analysis to improve the optimizations. Dead-code elimination and loop-invariant removal are implemented and tested, as well as several variations of the side-effect analysis. The optimizer is tested on real-world applications such as itself and JavaSoft's Java compiler. Results show that the optimizations benefit well from the side-effect analysis. The best side-effect analysis gives five to ten times as many optimizations as without an analysis, and, in one case, makes a speed increase of 25% possible. © 1997 John Wiley & Sons, Ltd.
Lars Ræder Clausen
Concurr. Pract. Exp.1