Online-Kostenrechnung für die CIM-Planung: prozessorientierte Kostenrechnung zur Ablaufplanung flexibler Fertigungssysteme. - Jens Knoop (Erich Schmidt, 1986)

The Value Flow Graph: A Program Representation for Optimal Program Transformations. - Bernhard Steffen; Jens Knoop; Oliver Rüthing (ESOP, 1990)

Efficient Code Motion and an Adaption to Strength Reduction. - Bernhard Steffen; Jens Knoop; Oliver Rüthing (TAPSOFT, Vol.2, 1991)

Finite Constants: Characterizations of a New Decidable Set of Constants. - Bernhard Steffen; Jens Knoop (Theor. Comput. Sci., 1991)

The Interprocedural Coincidence Theorem. - Jens Knoop; Bernhard Steffen (CC, 1992)

Lazy Code Motion. - Jens Knoop; Oliver Rüthing; Bernhard Steffen (PLDI, 1992)

Lazy code motion (with retrospective) - Jens Knoop; Oliver Rüthing; Bernhard Steffen (Best of PLDI, 1992)

Partial Dead Code Elimination. - Jens Knoop; Oliver Rüthing; Bernhard Steffen (PLDI, 1994)

Optimal Code Motion: Theory and Practice. - Jens Knoop; Oliver Rüthing; Bernhard Steffen (ACM Trans. Program. Lang. Syst., 1994)

The Fixpoint-Analysis Machine. - Bernhard Steffen; Andreas Claßen; Marion Klein; Jens Knoop; Tiziana Margaria (CONCUR, 1995)

The Power of Assignment Motion. - Jens Knoop; Oliver Rüthing; Bernhard Steffen (PLDI, 1995)

Parallelism for Free: Bitvector Analyses -> No State Explosion! - Jens Knoop; Bernhard Steffen; Jürgen Vollmer 001 (TACAS, 1995)

Non-monotone Fixpoint Iterations to Resolve Second Order Effects. - Alfons Geser; Jens Knoop; Gerald Lüttgen; Oliver Rüthing; Bernhard Steffen (CC, 1996)

Partial Dead Code Elimination for Parallel Programs. - Jens Knoop (Euro-Par, Vol. I, 1996)

DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation. - Marion Klein; Jens Knoop; Dirk Koschützki; Bernhard Steffen (TACAS, 1996)

Towards a tool kit for the automatic generation of interprocedural data flow analyses. - Jens Knoop; Oliver Rüthing; Bernhard Steffen (J. Program. Lang., 1996)

Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs. - Jens Knoop; Bernhard Steffen; Jürgen Vollmer 001 (ACM Trans. Program. Lang. Syst., 1996)

Interprocedural Distribution Assignment Placement: More than Just Enhancing Intraprocedural Placing Techniques. - Jens Knoop; Eduard Mehofer (IEEE PACT, 1997)

Optimal Distribution Assignment Placement. - Jens Knoop; Eduard Mehofer (Euro-Par, 1997)

Optimal Interprocedural Program Optimization, A New Framework and Its Application - Jens Knoop (Springer, 1998)

Cool: A Control-Flow Generator for System Analysis. - Volker Braun; Jens Knoop; Dirk Koschützki (CC, 1998)

Basic-Block Graphs: Living Dinosaurs? - Jens Knoop; Dirk Koschützki; Bernhard Steffen (CC, 1998)

Code Motion and Code Placement: Just Synonyms? - Jens Knoop; Oliver Rüthing; Bernhard Steffen (ESOP, 1998)

Parallel Constant Propagation. - Jens Knoop (Euro-Par, 1998)

Formal Callability and Its Relevance and Application to Interprocedural Data-Flow Analysis. - Jens Knoop (ICCL, 1998)

Eliminating Partially Dead Code in Explicitly Parallel Programs. - Jens Knoop (Theor. Comput. Sci., 1998)

Demand-Driven Model Checking for Context-Free Processes. - Jens Knoop (ASIAN, 1999)

Optimization Under the Perspective of Soundness, Completeness, and Reusability. - Jens Knoop; Oliver Rüthing (Correct System Design, 1999)

Expansion-Based Removal of Semantic Partial Redundancies. - Jens Knoop; Oliver Rüthing; Bernhard Steffen (CC, 1999)

Parallel Data-Flow Analysis of Explicitly Parallel Programs. - Jens Knoop (Euro-Par, 1999)

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. - Javier Esparza; Jens Knoop (FoSSaCS, 1999)

Code Motion for Explicitly Parallel Programs. - Jens Knoop; Bernhard Steffen (PPoPP, 1999)

Detecting Equalities of Variables: Combining Efficiency with Precision. - Oliver Rüthing; Jens Knoop; Bernhard Steffen (SAS, 1999)

From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach. - Jens Knoop (TACAS, 1999)

Constant Propagation on the Value Graph: Simple Constants and Beyond. - Jens Knoop; Oliver Rüthing (CC, 2000)

Compilers for High Performance. - Samuel P. Midkiff; Barbara M. Chapman; Jean-Francois Collard; Jens Knoop (Euro-Par, 2000)

Sparse Code Motion. - Oliver Rüthing; Jens Knoop; Bernhard Steffen (POPL, 2000)

Partial Redundancy Elimination on Predicated Code. - Jens Knoop; Jean-Francois Collard; Roy Dz-Ching Ju (SAS, 2000)

Topic 04: Compilers for High Performance. - Jens Knoop; Manish Gupta; Keshav Pingali; Michael F. P. O'Boyle (Euro-Par, 2001)

Preface. - Jens Knoop; Wolf Zimmermann (COCV@ETAPS, 2002)

Distribution Assignment Placement: Effective Optimization of Redistribution Costs. - Jens Knoop; Eduard Mehofer (IEEE Trans. Parallel Distributed Syst., 2002)

Constant Propagation on Predicated Code. - Jens Knoop; Oliver Rüthing (J. Univers. Comput. Sci., 2003)

Optimizing for space and time usage with speculative partial redundancy elimination. - Bernhard Scholz; R. Nigel Horspool; Jens Knoop (LCTES, 2004)

05101 Executive Summary - Scheduling for Parallel Architectures: Theory, Applications, Challenges. - Erik R. Altman; James C. Dehnert; Christoph W. Kessler; Jens Knoop (Scheduling for Parallel Architectures, 2005)

05101 Abstracts Collection - Scheduling for Parallel Architectures: Theory, Applications, Challenges. - Erik R. Altman; James C. Dehnert; Christoph W. Kessler; Jens Knoop (Scheduling for Parallel Architectures, 2005)

A Fresh Look at PRE as a Maximum Flow Problem. - Jingling Xue; Jens Knoop (CC, 2006)

Preface. - Jens Knoop; George C. Necula; Wolf Zimmermann (COCV@ETAPS, 2006)

A Fresh Look at Partial Redundancy Elimination as a Maximum Flow Problem. - Jingling Xue; Jens Knoop (Softwaretechnik-Trends, 2006)

WCET Analysis: The Annotation Language Challenge. - Raimund Kirner; Jens Knoop; Adrian Prantl; Markus Schordan; Ingomar Wenzel (WCET, 2007)

Preface. - Sabine Glesner; Jens Knoop; Rolf Drechsler (COCV@ETAPS, 2007)

08441 Final Report - Emerging Uses and Paradigms for Dynamic Binary Translation. - Erik R. Altman; Bruce R. Childers; Robert S. Cohn; Jack W. Davidson; Koen De Bosschere; Bjorn De Sutter; M. Anton Ertl; Michael Franz; Yuan Xiang Gu; Matthias Hauswirth; Thomas Heinz 001; Wei-Chung Hsu; et al. (Emerging Uses and Paradigms for Dynamic Binary Translation, 2008)

Data-Flow Analysis for Multi-Core Computing Systems: A Reminder to Reverse Data-Flow Analysis. - Jens Knoop (Scalable Program Analysis, 2008)

WCET 2008 - Report from the Tool Challenge 2008 – 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis. - Niklas Holsti; Jan Gustafsson; Guillem Bernat; Clément Ballabriga; Armelle Bonenfant; Roman Bourgade; Hugues Cassé; Daniel Cordes; Albrecht Kadlec; Raimund Kirner; Jens Knoop; Paul Lokuciejewski; et al. (WCET, 2008)

Towards a Common WCET Annotation Language: Essential Ingredients. - Raimund Kirner; Albrecht Kadlec; Adrian Prantl; Markus Schordan; Jens Knoop (WCET, 2008)

TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis. - Adrian Prantl; Markus Schordan; Jens Knoop (WCET, 2008)

Adding Timing-Awareness to AUTOSAR Basic-Software – A Component Based Approach. - Dietmar Schreiner; Markus Schordan; Jens Knoop (ISORC, 2009)

From Trusted Annotations to Verified Knowledge. - Adrian Prantl; Jens Knoop; Raimund Kirner; Albrecht Kadlec; Markus Schordan (WCET, 2009)

Constraint solving for high-level WCET analysis - Adrian Prantl; Jens Knoop; Markus Schordan; Markus Triska (CoRR, 2009)

On the Role of Non-functional Properties in Compiler Verification. - Jens Knoop; Wolf Zimmermann (ISoLA (2), 2010)

Practical Experiences of Applying Source-Level WCET Flow Analysis on Industrial Code. - Björn Lisper; Andreas Ermedahl; Dietmar Schreiner; Jens Knoop; Peter Gliwa (ISoLA (2), 2010)

Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs. - Lian Li 002; Jingling Xue; Jens Knoop (ACM Trans. Embed. Comput. Syst., 2010)

Symbolic Loop Bound Computation for WCET Analysis. - Jens Knoop; Laura Kovács; Jakob Zwirchmayr (Ershov Memorial Conference, 2011)

Beyond loop bounds: comparing annotation languages for worst-case execution time analysis. - Raimund Kirner; Jens Knoop; Adrian Prantl; Markus Schordan; Albrecht Kadlec (Softw. Syst. Model., 2011)

Software Aspects of Robotic Systems. - Jens Knoop; Dietmar Schreiner (ISoLA (2), 2012)

r-TuBound: Loop Bounds for WCET Analysis (Tool Paper). - Jens Knoop; Laura Kovács; Jakob Zwirchmayr (LPAR, 2012)

FFX: a portable WCET annotation language. - Armelle Bonenfant; Hugues Cassé; Marianne De Michiel; Jens Knoop; Laura Kovács; Jakob Zwirchmayr (RTNS, 2012)

Guest Editorial: Parallel Systems and Compilers. - Valentina Salapura; Michael Gschwind; Jens Knoop (Int. J. Parallel Program., 2012)

SmacC: A Retargetable Symbolic Execution Engine. - Armin Biere; Jens Knoop; Laura Kovács; Jakob Zwirchmayr (ATVA, 2013)

The T-CREST approach of compiler and WCET-analysis integration. - Peter P. Puschner; Daniel Prokesch; Benedikt Huber; Jens Knoop; Stefan Hepp; Gernot Gebhard (ISORC, 2013)

WCET squeezing: on-demand feasibility refinement for proven precise WCET-bounds. - Jens Knoop; Laura Kovács; Jakob Zwirchmayr (RTNS, 2013)

6. Arbeitstagung Programmiersprachen (ATPS 2013). - Jens Knoop; Janis Voigtländer (Software Engineering, 2013)

Vorwort zur 6. Arbeitstagung Programmiersprachen (ATPS 2013). - Jens Knoop; Janis Voigtländer (Software Engineering (Workshops), 2013)

The Auspicious Couple: Symbolic Execution and WCET Analysis. - Armin Biere; Jens Knoop; Laura Kovács; Jakob Zwirchmayr (WCET, 2013)

Practical experiences of applying source-level WCET flow analysis to industrial code. - Björn Lisper; Andreas Ermedahl; Dietmar Schreiner; Jens Knoop; Peter Gliwa (Int. J. Softw. Tools Technol. Transf., 2013)

Comparison of type-based and alias-based component recognition for embedded systems software. - Dietmar Schreiner; Gergö Barany; Markus Schordan; Jens Knoop (Int. J. Softw. Tools Technol. Transf., 2013)

Model-Based Code-Generators and Compilers - Track Introduction. - Uwe Aßmann; Jens Knoop; Wolf Zimmermann (ISoLA (1), 2014)

T-CREST: Time-predictable multi-core architecture for embedded systems. - Martin Schoeberl; Sahar Abbaspour; Benny Akesson; Neil C. Audsley; Raffaele Capasso; Jamie Garside; Kees Goossens; Sven Goossens; Scott Hansen; Reinhold Heckmann; Stefan Hepp; Benedikt Huber; et al. (J. Syst. Archit., 2015)

Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution. - Jens Knoop; Laura Kovács; Jakob Zwirchmayr (J. Symb. Comput., 2017)

The Platin Multi-Target Worst-Case Analysis Tool. - Emad Jacob Maroun; Eva Dengler; Christian Dietrich 001; Stefan Hepp; Henriette Herzog; Benedikt Huber; Jens Knoop; Daniel Wiltsche-Prokesch; Peter P. Puschner; Phillip Raffeck; Martin Schoeberl; Simon Schuster; et al. (WCET, 2024)