| 2007 |
|---|
| 52 | EE | Raimund Kirner,
Jens Knoop,
Adrian Prantl,
Markus Schordan,
Ingomar Wenzel:
WCET Analysis: The Annotation Language Challenge.
WCET 2007 |
| 51 | EE | Jens Knoop,
George C. Necula,
Wolf Zimmermann:
Preface.
Electr. Notes Theor. Comput. Sci. 176(3): 1-2 (2007) |
| 50 | EE | Sabine Glesner,
Jens Knoop,
Rolf Drechsler:
Preface.
Electr. Notes Theor. Comput. Sci. 190(4): 1-2 (2007) |
| 2006 |
|---|
| 49 | EE | Jingling Xue,
Jens Knoop:
A Fresh Look at PRE as a Maximum Flow Problem.
CC 2006: 139-154 |
| 2005 |
|---|
| 48 | | Erik R. Altman,
James C. Dehnert,
Christoph W. Kessler,
Jens Knoop:
Scheduling for Parallel Architectures: Theory, Applications, Challenges
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 |
| 47 | EE | Erik R. Altman,
James C. Dehnert,
Christoph W. Kessler,
Jens Knoop:
05101 Abstracts Collection - Scheduling for Parallel Architectures: Theory, Applications, Challenges.
Scheduling for Parallel Architectures 2005 |
| 46 | EE | Erik R. Altman,
James C. Dehnert,
Christoph W. Kessler,
Jens Knoop:
05101 Executive Summary - Scheduling for Parallel Architectures: Theory, Applications, Challenges.
Scheduling for Parallel Architectures 2005 |
| 45 | EE | Jens Knoop,
George C. Necula,
Wolf Zimmermann:
Preface.
Electr. Notes Theor. Comput. Sci. 132(1): 1-3 (2005) |
| 44 | EE | Jens Knoop,
George C. Necula,
Wolf Zimmermann:
Preface.
Electr. Notes Theor. Comput. Sci. 141(2): 1-3 (2005) |
| 2004 |
|---|
| 43 | EE | Bernhard Scholz,
R. Nigel Horspool,
Jens Knoop:
Optimizing for space and time usage with speculative partial redundancy elimination.
LCTES 2004: 221-230 |
| 2003 |
|---|
| 42 | EE | Jens Knoop,
Oliver Rüthing:
Constant Propagation on Predicated Code.
J. UCS 9(8): 829-872 (2003) |
| 2002 |
|---|
| 41 | EE | Jens Knoop,
Wolf Zimmermann:
Preface.
Electr. Notes Theor. Comput. Sci. 65(2): (2002) |
| 40 | EE | Jens Knoop,
Eduard Mehofer:
Distribution Assignment Placement: Effective Optimization of Redistribution Costs.
IEEE Trans. Parallel Distrib. Syst. 13(6): 628-647 (2002) |
| 2001 |
|---|
| 39 | EE | Jens Knoop,
Manish Gupta,
Keshav Pingali,
Michael F. P. O'Boyle:
Topic 04: Compilers for High Performance.
Euro-Par 2001: 204-206 |
| 2000 |
|---|
| 38 | EE | Jens Knoop,
Oliver Rüthing:
Constant Propagation on the Value Graph: Simple Constants and Beyond.
CC 2000: 94-109 |
| 37 | EE | Samuel P. Midkiff,
Barbara M. Chapman,
Jean-Francois Collard,
Jens Knoop:
Compilers for High Performance.
Euro-Par 2000: 329-330 |
| 36 | EE | Oliver Rüthing,
Jens Knoop,
Bernhard Steffen:
Sparse Code Motion.
POPL 2000: 170-183 |
| 35 | | Jens Knoop,
Jean-Francois Collard,
Roy Dz-Ching Ju:
Partial Redundancy Elimination on Predicated Code.
SAS 2000: 260-279 |
| 1999 |
|---|
| 34 | EE | Jens Knoop:
Demand-Driven Model Checking for Context-Free Processes.
ASIAN 1999: 201-213 |
| 33 | | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Expansion-Based Removal of Semantic Partial Redundancies.
CC 1999: 91-106 |
| 32 | EE | Jens Knoop,
Oliver Rüthing:
Optimization Under the Perspective of Soundness, Completeness, and Reusability.
Correct System Design 1999: 288-315 |
| 31 | EE | Jens Knoop:
Parallel Data-Flow Analysis of Explicitly Parallel Programs.
Euro-Par 1999: 391-400 |
| 30 | | Javier Esparza,
Jens Knoop:
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.
FoSSaCS 1999: 14-30 |
| 29 | EE | Jens Knoop,
Bernhard Steffen:
Code Motion for Explicitly Parallel Programs.
PPOPP 1999: 13-24 |
| 28 | EE | Oliver Rüthing,
Jens Knoop,
Bernhard Steffen:
Detecting Equalities of Variables: Combining Efficiency with Precision.
SAS 1999: 232-247 |
| 27 | EE | Jens Knoop:
From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach.
TACAS 1999: 360-374 |
| 1998 |
|---|
| 26 | | Jens Knoop:
Optimal Interprocedural Program Optimization, A New Framework and Its Application
Springer 1998 |
| 25 | | Volker Braun,
Jens Knoop,
Dirk Koschützki:
Cool: A Control-Flow Generator for System Analysis.
CC 1998: 306-309 |
| 24 | | Jens Knoop,
Dirk Koschützki,
Bernhard Steffen:
Basic-Block Graphs: Living Dinosaurs?
CC 1998: 65-79 |
| 23 | EE | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Code Motion and Code Placement: Just Synonyms?
ESOP 1998: 154-169 |
| 22 | EE | Jens Knoop:
Parallel Constant Propagation.
Euro-Par 1998: 445-455 |
| 21 | EE | Jens Knoop:
Formal Callability and Its Relevance and Application to Interprocedural Data-Flow Analysis.
ICCL 1998: 252-261 |
| 20 | EE | Jens Knoop:
Eliminating Partially Dead Code in Explicitly Parallel Programs.
Theor. Comput. Sci. 196(1-2): 365-393 (1998) |
| 1997 |
|---|
| 19 | | Jens Knoop,
Eduard Mehofer:
Optimal Distribution Assignment Placement.
Euro-Par 1997: 364-373 |
| 18 | EE | Jens Knoop,
Eduard Mehofer:
Interprocedural Distribution Assignment Placement: More than Just Enhancing Intraprocedural Placing Techniques.
IEEE PACT 1997: 26- |
| 1996 |
|---|
| 17 | | Alfons Geser,
Jens Knoop,
Gerald Lüttgen,
Oliver Rüthing,
Bernhard Steffen:
Non-monotone Fixpoint Iterations to Resolve Second Order Effects.
CC 1996: 106-120 |
| 16 | | Jens Knoop:
Partial Dead Code Elimination for Parallel Programs.
Euro-Par, Vol. I 1996: 441-450 |
| 15 | | Marion Klein,
Jens Knoop,
Dirk Koschützki,
Bernhard Steffen:
DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation.
TACAS 1996: 422-426 |
| 14 | EE | Jens Knoop,
Bernhard Steffen,
Jürgen Vollmer:
Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs.
ACM Trans. Program. Lang. Syst. 18(3): 268-299 (1996) |
| 13 | EE | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Towards a tool kit for the automatic generation of interprocedural data flow analyses.
J. Prog. Lang. 4(4): 211-246 (1996) |
| 1995 |
|---|
| 12 | | Bernhard Steffen,
Andreas Claßen,
Marion Klein,
Jens Knoop,
Tiziana Margaria:
The Fixpoint-Analysis Machine.
CONCUR 1995: 72-87 |
| 11 | | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
The Power of Assignment Motion.
PLDI 1995: 233-245 |
| 10 | | Jens Knoop,
Bernhard Steffen,
Jürgen Vollmer:
Parallelism for Free: Bitvector Analyses -> No State Explosion!
TACAS 1995: 264-289 |
| 1994 |
|---|
| 9 | | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Partial Dead Code Elimination.
PLDI 1994: 147-158 |
| 8 | EE | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Optimal Code Motion: Theory and Practice.
ACM Trans. Program. Lang. Syst. 16(4): 1117-1155 (1994) |
| 1992 |
|---|
| 7 | EE | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Lazy code motion (with retrospective)
Best of PLDI 1992: 460-472 |
| 6 | | Jens Knoop,
Bernhard Steffen:
The Interprocedural Coincidence Theorem.
CC 1992: 125-140 |
| 5 | | Jens Knoop,
Oliver Rüthing,
Bernhard Steffen:
Lazy Code Motion.
PLDI 1992: 224-234 |
| 1991 |
|---|
| 4 | | Bernhard Steffen,
Jens Knoop,
Oliver Rüthing:
Efficient Code Motion and an Adaption to Strength Reduction.
TAPSOFT, Vol.2 1991: 394-415 |
| 3 | | Bernhard Steffen,
Jens Knoop:
Finite Constants: Characterizations of a New Decidable Set of Constants.
Theor. Comput. Sci. 80(2): 303-318 (1991) |
| 1990 |
|---|
| 2 | | Bernhard Steffen,
Jens Knoop,
Oliver Rüthing:
The Value Flow Graph: A Program Representation for Optimal Program Transformations.
ESOP 1990: 389-405 |
| 1989 |
|---|
| 1 | | Bernhard Steffen,
Jens Knoop:
Finite Constants: Characterizations of a New Decidable Set of Constants.
MFCS 1989: 481-491 |
