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

Torbjörn Ekman 0001

dblp:55/5805-1 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0002-3413-191XORCID · corroborated

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

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

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
2 papers
Programming languages and type systems · 36% Software maintenance and evolution · 34% Compilers and program optimization · 15%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › refactoring
identifier renaming
0.112008
Sound and extensible renaming for java · OOPSLA 2008
Software maintenance and evolution
refactoring
0.112008
Sound and extensible renaming for java · OOPSLA 2008
Programming languages and type systems › lambda calculus
variable binding
0.112008
Sound and extensible renaming for java · OOPSLA 2008
Compilers and program optimization › compiler construction
extensible compiler
0.112007
The jastadd extensible java compiler · OOPSLA 2007
Programming languages and type systems › type systems › static typing
pluggable type systems
0.112007
The jastadd extensible java compiler · OOPSLA 2007
Program analysis
static analysis
0.112007
The jastadd extensible java compiler · OOPSLA 2007
Programming languages and type systems › language design
language extension
0.012007
The jastadd extensible java compiler · OOPSLA 2007

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

modular compiler construction · 0.1attribute grammar · 0.1
YearPublicationVenuePosition
2013 Extensible intraprocedural flow analysis at the abstract syntax tree level
Emma Söderberg, Torbjörn Ekman 0001, Görel Hedin, Eva Magnusson
Sci. Comput. Program.2
2010 Implementation of a Modelica compiler using JastAdd attribute grammars
Johan Åkesson, Torbjörn Ekman 0001, Görel Hedin
Sci. Comput. Program.2
2009 Stepping Stones over the Refactoring Rubicon
Max Schäfer, Mathieu Verbaere, Torbjörn Ekman 0001, Oege de Moor
ECOOP3
2009 Formalising and Verifying Reference Attribute Grammars in Coq
Max Schäfer, Torbjörn Ekman 0001, Oege de Moor
ESOP2
2009 Demand-driven evaluation of collection attributes
Eva Magnusson, Torbjörn Ekman 0001, Görel Hedin
Autom. Softw. Eng.2
2008 Sound and extensible renaming for java
abstract
Descriptive names are crucial to understand code. However, good names are notoriously hard to choose and manually changing a globally visible name can be a maintenance nightmare. Hence, tool support for automated renaming is an essential aid for developers and widely supported by popular development environments.
Max Schäfer, Torbjörn Ekman 0001, Oege de Moor
OOPSLA2
2008 Practical Scope Recovery Using Bridge Parsing
Emma Nilsson-Nyman, Torbjörn Ekman 0001, Görel Hedin
SLE2
2007 The jastadd extensible java compiler
abstract
The JastAdd Extensible Java Compiler is a high quality Java compiler that is easy to extend in order to build static analysis tools for Java, and to extend Java with new language constructs. It is built modularly, with a Java 1.4 compiler that is extended to a Java 5 compiler. Example applications that are built as extensions include an alternative backend that generates Jimple, an extension of Java with AspectJ constructs, and the implementation of a pluggable type system for non-null checking and inferenc.
Torbjörn Ekman 0001, Görel Hedin
OOPSLA1
2007 The JastAdd system - modular extensible compiler construction
Torbjörn Ekman 0001, Görel Hedin
Sci. Comput. Program.1
2004 Rewritable Reference Attributed Grammars
Torbjörn Ekman 0001, Görel Hedin
ECOOP1
2002 Real Java for real time - gain and pain
abstract
The Java programming language, being a portable and safe object-oriented language, has gained much interest among embedded and real-time systems developers. However, standard Java implementations exhibit problems with performance, memory footprint, and predictability. The question is then, are these limitations inherent in the technology?Reviewing run-time aspects and the possibility to compile Java to native code, reveals some real limitations as well as common misconceptions. Investigation of the real limitations shows that for implementing real-time Java on small embedded platforms, native compilation via C is an appropriate solution for many platforms and applications.A revised technique for Java-compatible memory management is proposed to reduce latencies, and linkage of externally generated (C) code with natively compiled Java is considered in a prototype that has been implemented. Based on application demands and experimental verification, we find that real-time Java can, and should, retain the standard simple Java memory model to the programmer.
Anders Nilsson 0003, Torbjörn Ekman 0001, Klas Nilsson
CASES2
2001 Deterministic Java in Tiny Embedded Systems
abstract
As embedded systems become more and more complex, and the time to market becomes shorter, there is a need in the embedded systems community to find better programming languages that let the programmers develop correct code faster. The programming languages used today, typically C and/or Assemblers, are just too error-prone. The Java technology has therefore gained a lot of interest from developers of embedded systems in the last few years. We propose an approach based on compiling Java into native machine code via C as an intermediate language. The C code generation process should also add close interaction with a fully pre-emptive incremental garbage collector and a small and efficient real time kernel. Tests performed on a small 8-bit microprocessor show that it is possible to use a modern object oriented language with automatic memory management, such as Java, and yet generate fully predictable code that can be run in very small devices with severe memory constraints.
Anders Nilsson 0003, Torbjörn Ekman 0001
ISORC2