Jens Knoop
Institut für Computersprachen
Programmiersprachen und Übersetzer

Publications

Invited Contributions

Book Chapters

• Knoop, J., Rüthing, O., and Steffen, B. Retrospective: Lazy Code Motion. In "20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1979 - 1999): A Selection", ACM SIGPLAN Notices 39, 4 (2004), 460 - 461 & 462-472.

• Knoop, J., and Rüthing, O. Optimization under the perspective of soundness, completeness, and reusability.
  In "Correct System Design - Recent Insights and Advances." Dedicated to Hans Langmaack on the occasion of his retirement from his professorship. Springer-Verlag, Heidelberg, LNCS State-of-the-Art Survey 1710 (1999), 288 - 315. (Invited contribution)

Conference Articles

• Esparza, J., and Knoop, J. An automata-theoretic approach to interprocedural data-flow analysis.
  In Proceedings of the 2nd International Conference on Foundations of Software Sciences and Computation Structures (FoSSaCS'99) (Amsterdam, The Netherlands, March 22 - 26, 1999), Springer-Verlag, Heidelberg, LNCS 1578 (1999), 14 - 30. (Invited contribution).

• Steffen, B., Claßen, A., Klein, M., Knoop, J., and Margaria, T. The fixpoint-analysis machine.
  In Proceedings of the 6th International Conference on Concurrency Theory (CONCUR'95) (Philadelphia, PA, USA, August 21 - 24, 1995 ), Springer-Verlag, Heidelberg, LNCS 962 (1995), 72 - 87. (Invited contribution).

Back to top

Monographs

• Knoop, J. Optimal interprocedural program optimization: A new framework and its application.
  PhD dissertation, Department of Computer Science, University of Kiel, 1993. Springer-Verlag, Heidelberg, LNCS Tutorial 1428 (1998).

Journals

• Knoop, J., and Rüthing, O. Constant propagation on predicated code.
  Journal of Universal Computer Science 9, 8 (2003), 829 - 850. (Special issue devoted to SBLP'03).

• Knoop, J., and Mehofer, E. Distribution assignment placement: Effective optimization of redistribution costs.
  IEEE Transactions on Parallel and Distributed Systems 13, 6 (2002), 628 - 647.

• Knoop, J. Eliminating partially dead code in explicitly parallel programs.
  Theoretical Computer Science 196, 1-2 (1998), 365 - 393. (Special issue devoted to Euro-Par'96).

• Knoop, J., Rüthing, O., and Steffen, B. Towards a tool kit for the automatic generation of interprocedural data flow analyses.
  Journal of Programming Languages 4, 4 (1996), 211 - 246.

• Knoop, J., Steffen, B., and Vollmer, J. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs.
  ACM Transactions on Programming Languages and Systems 18, 3 (1996), 268 - 299.

• Knoop, J., Rüthing, O., and Steffen, B. Optimal code motion: Theory and practice.
  ACM Transactions on Programming Languages and Systems 16, 4 (1994), 1117 - 1155.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy strength reduction.
  Journal of Programming Languages 1, 1 (1993), 71 - 91.

• Steffen, B., and Knoop, J. Finite constants: Characterizations of a new decidable set of constants.
  Theoretical Computer Science 80, 2 (1991), 303 - 318. (Special issue devoted to MFCS'89).

Back to top

Conferences: Refereed Articles and Tool Presentations

Conferences: Refereed Articles

• Scholz, B., Horspool, N. and Knoop, J. Optimizing for Space and Time Usage with Speculative Partial Redundancy Elimination.
  In Proceedings of the ACM SIGPLAN/SIGBED 2004 Conference on Languages, Compilers, and Tools for Embedded Systems LCTES (Washington, DC, June 11 - 13, 2004), ACM SIGPLAN Notices 39, 7 (2004), 221 -230.

• Knoop, J., and Rüthing, O. Constant propagation on predicated code.
  In Proceedings of the 7th Brazilian Symposium on Programming Languages (SBLP 2003) (Ouro Preto, MG, Brazil, May 28 - 30, 2003), 135 - 148

• Knoop, J., and Collard, J.-F., and Ju, R. D. Partial redundancy elimination on predicated code.
  In Proceedings of the 7th International Static Analysis Symposium (SAS 2000) (Santa Barbara, CA, USA, June 29 - July 1, 2000), Springer-Verlag, Heidelberg, LNCS 1824 (2000), 260 - 279

• Knoop, J., and Rüthing, O. Constant propagation on the value graph: Simple constants and beyond.
  In Proceedings of the 9th International Conference on Compiler Construction (CC 2000) (Berlin, Germany, March 25 - April 2, 2000), Springer-Verlag, Heidelberg, LNCS 1781 (2000), 94 - 109

• Rüthing, O., Knoop, J., and Steffen, B. Sparse code motion.
  In Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000) (Boston, MA, USA, January 19 - 21, 2000), ACM New York, (2000), 170 - 183.

• Knoop, J. Demand-driven model checking for context-free processes.
  In Proceedings of the 5th Annual Asian Computing Science Conference (ASIAN'99) (Phuket, Thailand, December 10 - 12, 1999), Springer-Verlag, Heidelberg, LNCS 1742 (1999), 201 - 213.

• Rüthing, O., Knoop, J., and Steffen, B. Detecting equality of variables: Combining efficiency with precision.
  In Proceedings of the 6th International Static Analysis Symposium (SAS'99) (Venezia, Italy, September 22 - 24, 1999), Springer-Verlag, Heidelberg, LNCS 1694 (1999), 232 - 247.

• Knoop, J. Parallel data-flow analysis of explicitly parallel programs.
  In Proceedings of the 5th European Conference on Parallel Processing (Euro-Par'99) (Toulouse, France, August 31 - September 3, 1999), Springer-Verlag, Heidelberg, LNCS 1685 (1999), 391 - 400.

• Knoop, J., and Steffen, B. Code motion for explicitly parallel programs.
  In Proceedings of the 7th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'99) (Atlanta, GA, USA, May 4 - 6, 1999), ACM SIGPLAN Notices 34, 8 (1999), 13 - 24.

• Knoop, J. From DFA-frameworks to DFA-generators: A unifying multiparadigm approach.
  In Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99) (Amsterdam, The Netherlands, March 22 - 26, 1999), Springer-Verlag, Heidelberg, LNCS 1579 (1999), 360 - 374.

• Knoop, J., Rüthing, O., and Steffen, B. Expansion-based removal of semantic partial redundancies.
  In Proceedings of the 8th International Conference on Compiler Construction (CC'99) (Amsterdam, The Netherlands, March 22 - 26, 1999), Springer-Verlag, Heidelberg, LNCS 1575 (1999), 91 - 106.

• Knoop, J. Parallel constant propagation.
  In Proceedings of the 4th European Conference on Parallel Processing (Euro-Par'98) (Southampton, UK, September 1 - 4, 1998), Springer-Verlag, Heidelberg, LNCS 1470 (1998), 445 - 455.

• Knoop, J. Formal callability and its relevance and application to interprocedural data-flow analysis.
  In Proceedings of the 6th IEEE Computer Society 1998 International Conference on Computer Languages (ICCL'98) (Chicago, IL, USA, May 14 - 16, 1998), IEEE Computer Society, Los Alamitos, California, (1998), 252 - 261.

• Knoop, J., Koschützki, D., and Steffen, B. Basic-block graphs: Living dinosaurs?
  In Proceedings of the 7th International Conference on Compiler Construction (CC'98) (Lisbon, Portugal, March 30 - April 3, 1998), Springer-Verlag, Heidelberg, LNCS 1383 (1998), 65 - 79.

• Knoop, J., Rüthing, O., and Steffen, B. Code motion and code placement: Just synonyms?
  In Proceedings of the 7th European Symposium On Programming (ESOP'98) (Lisbon, Portugal, March 30 - April 3, 1998), Springer-Verlag, Heidelberg, LNCS 1381 (1998), 154 - 169.

• Knoop, J., and Mehofer, E. Interprocedural distribution assignment placement: More than just enhancing intraprocedural placing techniques.
  In Proceedings of the 5th IEEE International Conference on Parallel Architectures and Compilation Techniques (PACT'97) (San Francisco, CA, USA, November 11 - 15, 1997), IEEE Computer Society, Los Alamitos, California, (1997), 26 - 37.

• Knoop, J., and Schreiber, F. Analysing and optimizing strongly typed object-oriented languages: A generic approach and its application to Oberon-2.
  In Proceedings of the 2nd International Symposium on Object-Oriented Technology ``The White OO Nights'' (WOON'97) (St. Petersburg, Russia, September 18 - 19, 1997), (1997), 252 - 266.

• Knoop, J., and Mehofer, E. Optimal distribution assignment placement.
  In Proceedings of the 3rd European Conference on Parallel Processing (Euro-Par'97) (Passau, Germany, August 26 - 29, 1997), Springer-Verlag, Heidelberg, LNCS 1300 (1997), 364 - 373.

• Knoop, J. Partial dead code elimination for parallel programs.
  In Proceedings of the 2nd European Conference on Parallel Processing (Euro-Par'96) (Lyon, France, August 26 - 29, 1996), Springer-Verlag, Heidelberg, LNCS 1123 (1996), 441 - 450.

• Knoop, J., and Golubski, W. Abstract interpretation: A uniform framework for type analysis and classical optimization of object-oriented programs.
  In Proceedings of the 1st International Symposium on Object-Oriented Technology ``The White OO Nights'' (WOON'96) (St. Petersburg, Russia, June 20 - 21, 1996), (1996), 126 - 142.

• Geser, A., Knoop, J., Lüttgen, G., Rüthing, O., and Steffen, B. Non-monotone fixpoint iterations to resolve second order effects.
  In Proceedings of the 6th International Conference on Compiler Construction (CC'96) (Linköping, Sweden, April 24 - 26, 1996), Springer-Verlag, Heidelberg, LNCS 1060 (1996), 106 - 120.

• Knoop, J., Steffen, B., and Vollmer, J. Code motion for parallel programs.
  In Proceedings of the Poster Session of the 6th International Symposium on Compiler Construction (CC'96) (Linköping, Sweden, April 24 - 26, 1996), Department of Computer and Information Sciences, Linköping University, Technical Report LiTH-IDA-R-96-12 (1996), 81 - 88.

• Knoop, J., Steffen, B., and Vollmer, J. Parallelism for free: Bitvector analyses ==> No state explosion!
  In Proceedings of the 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95) (Aarhus, Denmark, May 19 - 20, 1995), Springer-Verlag, Heidelberg, LNCS 1019 (1995), 264 - 289.

• Knoop, J., Steffen, B., and Vollmer, J. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs.
  In Preliminary Proceedings of the 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95) (Aarhus, Denmark, May 19 - 20, 1995), BRICS Notes Series NS-95-2 (1995), 319 - 333.

• Knoop, J., Rüthing, O., and Steffen, B. The power of assignment motion.
  In Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation (PLDI'95) (La Jolla, CA, USA, June 18 - 21, 1995), ACM SIGPLAN Notices 30, 6 (1995), 233 - 245.

• Knoop, J., Rüthing, O., and Steffen, B. Partial dead code elimination.
  In Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI'94) (Orlando, FL, USA, June 20 - 24, 1994), ACM SIGPLAN Notices 29, 6 (1994), 147 - 158.

• Knoop, J., and Steffen, B. The interprocedural coincidence theorem.
  In Proceedings of the 4th International Conference on Compiler Construction (CC'92) (Paderborn, Germany, October 5 - 7, 1992), Springer-Verlag, Heidelberg, LNCS 641 (1992), 125 - 140.

• Knoop, J., and Steffen, B. Optimal interprocedural partial redundancy elimination.
  In Proceedings of the Poster Session of the 4th International Conference on Compiler Construction (CC'92) (Paderborn, Germany, October 5 - 7, 1992), Department of Computer Science, University of Paderborn, Technical Report 103 (1992), 36 - 39.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy code motion.
  In Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation (PLDI'92) (San Francisco, CA, USA, June 17 - 19, 1992), ACM SIGPLAN Notices 27, 7 (1992), 224 - 234.

  Recorded in 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1979 - 1999): A Selection, ACM SIGPLAN Notices 39, 4 (2004), 460 - 461 & 462-472.

• Steffen, B., Knoop, J., and Rüthing, O. Efficient code motion and an adaption to strength reduction.
  In Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development (TAPSOFT'91) (Brighton, United Kingdom, April 8 - 12, 1991), Springer-Verlag, Heidelberg, LNCS 494 (1991), 394 - 415.

• Steffen, B., Knoop, J., and Rüthing, O. The value flow graph: A program representation for optimal program transformations.
  In Proceedings of the 3rd European Symposium on Programming (ESOP'90) (Copenhagen, Denmark, May 15 - 18, 1990), Springer-Verlag, Heidelberg, LNCS 432 (1990), 389 - 405.

• Steffen, B., and Knoop, J. Finite constants: Characterizations of a new decidable set of constants.
  In Proceedings of the 14th International Symposium on Mathematical Foundations of Computer Science (MFCS'89) (Porabka-Kozubnik, Poland, August 28 - September 1, 1989), Springer-Verlag, Heidelberg, LNCS 379 (1989), 481 - 491.

Back to top

Conferences: Refereed Tool Demonstrations

• Braun, V., Knoop, J., and Koschützki, D. Cool: A control-flow generator for system analysis.
  In Proceedings of the 7th International Conference on Compiler Construction (CC'98) (Lisbon, Portugal, March 30 - April 3, 1998), Springer-Verlag, Heidelberg, LNCS 1383 (1998), 306 - 309.

• Klein, M., Knoop, J., Koschützki, D., and Steffen, B. DFA&OPT-METAFrame: A tool kit for program analysis and optimization.
  In Proceedings of the 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96) (Passau, Germany, March 27 - 29, 1996), Springer-Verlag, Heidelberg, LNCS 1055 (1996), 422 - 426.

Back to top

Workshops: Technical Reports as Proceedings

• Knoop, J., and Rüthing, O. Simple Constants and Beyond: The Elegance of Value Graphs for Constant Propagation.
  To appear in Proceedings of the 20th Annual Workshop of the GI-FG 2.1.4 ``Programmiersprachen und Rechenkonzepte'' (Physikzentrum Bad Honnef, Germany, May 7 - 9, 2003).

• Knoop, J. Demand-driven analysis of explicitly parallel programs: An approach based on reverse data-flow analysis.
  In Proceedings of the 9th International Workshop on Compilers for Parallel Computers (CPC 2001) (Edinburgh, Scotland UK, June 27 - 29, 2001), 151 - 162.

• Rüthing, O., Knoop, J., and Steffen, B. Code-Size Sensitive Partial Redundancy Elimination.
  In Proceedings of the 17th Annual Workshop of the GI-FG 2.1.4 ``Programmiersprachen und Rechenkonzepte'' (Physikzentrum Bad Honnef, Germany, May 8 - 10, 2000), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 2007 (2000), 25 - 35.

• Knoop, J. Demand-driven data-flow analysis of explicitly parallel programs.
  In Proceedings of the 10th Biennial Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programming Languages and Fundamentals of Programming'' (Kirchhundem-Heinsberg, Germany, September 26 - 30, 1999), FernUniversität Hagen, Germany, Informatik Berichte 263 - 1/2000 (2000), 113 - 120.

• Rüthing, O., Knoop, J., and Steffen, B. Global Value Numbering: A New Approach Combining Efficiency with Precision.
  In Proceedings of the 10th Biennial Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programming Languages and Fundamentals of Programming'' (Kirchhundem-Heinsberg, Germany, September 26 - 30, 1999), FernUniversität Hagen, Germany, Informatik Berichte 263 - 1/2000 (2000), 121 - 130.

• Knoop, J., and Rüthing, O. The impact of paradigm shifts on safety and optimality of code motion.
  In Proceedings of the Joint 16th Annual Workshop of the GI-FG 2.1.4 ``Alternative Konzepte für Sprachen und Rechner'' and the 11th Workshop of the GI-FG 3.6.2 ``German ENCRESS'', the German Member of the European Network of Clubs for Reliability and Safety of Software-Intensive Systems, on ``Sicherheit und Zuverlässigkeit software-basierter Systeme'', (Physikzentrum Bad Honnef, Germany, May 3 - 5, 1999), Institut für Sicherheitstechnologie (ISTec) GmbH, Abteilung Leittechnik, Garching, Germany, Bericht ISTec-A-367 (1999), 6 - 20.

• Knoop, J. Constant propagation in parallel programs.
  In Proceedings of the Joint 7th International Workshop on Functional and Logic Programming and the 15th Annual Workshop of the GI-FG 2.1.4 ``Alternative Konzepte für Sprachen und Rechner''(Physikzentrum Bad Honnef, Germany, April 27 - 29, 1998), Institut für Wirtschaftsinformatik, Westfälische Wilhelms-Universität Münster, Germany, Working Paper No. 63, 1998, 14 pages.

• Knoop, J., and Koschützki, D. From programs to program graphs automatically: A general and flexible control-flow analysis generator.
  In Proceedings of the 9th Biennial Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programming Languages and Fundamentals of Programming'' (Avendorf, Insel Fehmarn, Germany, September 24 - 26, 1997), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9717 (1997), 64 - 74.

• Knoop, J., and Mehofer, E. Interprocedural distribution assignment placement: Analogies and differences to the intraprocedural setting.
  In Proceedings of the 9th Biennial Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programming Languages and Fundamentals of Programming'' (Avendorf, Insel Fehmarn, Germany), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9717 (1997), 75 - 85.

• Knoop, J., and Schreiber, F. Type analysis and type-test elimination in Oberon-2.
  In Proceedings of the 9th Biennial Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programming Languages and Fundamentals of Programming'' (Avendorf, Insel Fehmarn, Germany, September 24 - 26, 1997), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9717 (1997), 240 - 250.

• Knoop, J., and Mehofer, E. A powerful and flexible approach for distribution assignment placement.
  In Proceedings of the 14th Annual Workshop of the GI-FG 2.1.4 ``Alternative Konzepte für Sprachen und Rechner'' (Physikzentrum Bad Honnef, Germany, April 28 - 30, 1997), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9712 (1997), 77 - 84.

• Knoop, J.. Partial dead code elimination for parallel programs.
  In joint Proceedings of the 13th Annual Workshop of the GI-FG 2.1.4 ``Alternative Konzepte für Sprachen und Rechner'' and the 15th Workshop of the GI-ITG-FG 3.1.2 ``Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware (PARS)'' on ``Programmiersprachen und hardware-nahe Programmierung'' (Physikzentrum Bad Honnef, Germany, May 13 - 15, 1996), Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen Nr. 15, (1996), 31 - 40.

• Knoop, J., and Golubski, W. Precise type analysis by means of abstract interpretation.
  In joint Proceedings of the 13th Annual Workshop of the GI-FG 2.1.4 ``Alternative Konzepte für Sprachen und Rechner'' and the 15th Workshop of the GI-ITG-FG 3.1.2 ``Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware (PARS)'' on ``Programmiersprachen und hardware-nahe Programmierung'' (Physikzentrum Bad Honnef, Germany, May 13 - 15, 1996), Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen Nr. 15, (1996), 59 - 68.

• Knoop, J. Coincidence theorems: The backbone of powerful and user-friendly data flow analysis frameworks.
  In: Margaria, T. (Ed.). Proceedings of the 8th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programmiersprachen und Grundlagen der Programmierung'' (Adalbert-Stifter-Haus, Altreichenau, Germany), Fakultät für Mathematik und Informatik, Universität Passau, MIP-Bericht 9519 (1995), 132 - 138.

• Knoop, J., Steffen, B., and Vollmer, J. Optimal code motion for parallel programs.
  In Proceedings of the 12th Annual Workshop of the GI-FG 2.1.4 ``Alternative Konzepte für Sprachen und Rechner'' (Physikzentrum Bad Honnef, Germany), Institut für Informatik, Universität Koblenz-Landau, Fachberichte Informatik, Bericht Nr. 01/96 (1996), 5 pages.

• Knoop, J., Rüthing, O., and Steffen, B. A tool kit for constructing optimal interprocedural data flow analyses.
  In: Snelting, G., and Meyer, U. (Eds.). Proceedings of the Workshop of the GI-FG 2.1.3 on ``Semantikgestützte Analyse, Entwicklung und Generierung von Programmen'' (Schloß Rauischholzhausen, Ebsdorfergrund, Germany), Justus-Liebig-Universität Gießen, Bericht 9402 (1994), 143 - 154.

• Knoop, J.. Higher order data flow analysis.
  In: Berghammer, R., and Schmidt, G. (Eds.). Proceedings of the 7th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programmiersprachen und Grundlagen der Programmierung'' (Barbarahütte, Garmisch-Partenkirchen, Germany), Fakultät für Informatik, Universität der Bundeswehr München, Bericht 9309 (1993), 258 - 270.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy strength reduction. Extended Abstract.
  In: Kandzia, P. (Ed.). Proceedings of the 5th Workshop ``Küsteninformatik'' (Kiel, Germany), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9303 (1993), 23 - 28.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy code motion. Extended Abstract.
  In: Kandzia, P. (Ed.). Proceedings of the 5th Workshop ``Küsteninformatik'' (Kiel, Germany), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9303 (1993), 29 - 33.

• Knoop, J., and Steffen, B. Optimal interprocedural data flow analysis.
  In: Lippe, W.-M., and Stroot, G. (Eds.). Proceedings of the 6th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programmiersprachen -- Methoden, Semantik, Implementierungen'' (Landhaus Rothenberge, Germany), Institut für Angewandte Mathematik und Informatik, Universität Münster, Bericht 7/92-I (1992), 46 - 64.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy code motion.
  In: Lippe, W.-M., and Stroot, G. (Eds.). Proceedings of the 6th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programmiersprachen -- Methoden, Semantik, Implementierungen'' (Landhaus Rothenberge, Germany), Institut für Angewandte Mathematik und Informatik, Universität Münster, Bericht 7/92-I (1992), 205 - 217.

• Steffen, B., and Knoop, J. Constant propagation via finite constants and finite interprocedural constants.
  In: Dosch, W. (Ed.). Proceedings of the 5th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Funktionale und Logische Programmierung -- Sprachen, Methoden, Implementationen'' (Hirschegg/Kleinwalsertal, Austria), Institut für Mathematik, Universität Augsburg, Report Nr. 214 (1989), 146 - 150.

• Steffen, B., Knoop, J., and Rüthing, O. Partial redundancy elimination via optimal placement of computations.
  In: Dosch, W. (Ed.). Proceedings of the 5th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Funktionale und Logische Programmierung -- Sprachen, Methoden, Implementationen'' (Hirschegg/Kleinwalsertal, Austria), Institut für Mathematik, Universität Augsburg, Report Nr. 214 (1989), 139 - 145.

• Steffen, B., and Knoop, J. Ein optimales interpretationsunabhängiges Datenflußanalyseverfahren.
  In: Simon, F. (Ed.). Proceedings of the 4th Workshop of the RWTH Aachen, CAU Kiel, and TU München on ``Programmspezifikation'' (Midlum/Föhr, Germany), Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Bericht Nr. 8711 (1987), 35 pages.

Back to top

Technical Reports

• Knoop, J., Collard, J.-F., Ju, R. D. Partial redundancy elimination on predicated code: Motivation and algorithm.
  Fachbereich Informatik, Universität Dortmund, Germany, Forschungsbericht Nr. 731/2000 (2000), 34 pages.

• Rüthing, O., Knoop, J., and Steffen, B. Sparse code motion.
  Fachbereich Informatik, Universität Dortmund, Germany, Forschungsbericht Nr. 712/1999 (1999), 31 pages.

• Knoop, J. Parallel data-flow analysis of explicitly parallel programs.
  Fachbereich Informatik, Universität Dortmund, Germany, Forschungsbericht Nr. 707/1999 (1999), 24 pages.

• Knoop, J. Constant propagation in explicitly parallel programs.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9809 (1998), 19 pages.

• Collard, J.-F., and Knoop, J. A comparative study of reaching-definitions analyses.
  University of Versailles, Technical Report 1998/22 (1998), 17 pages.

• Knoop, J., and Mehofer, E. Interprocedural distribution assignment placement: More than just enhancing intraprocedural placing techniques.
  Institut für Software Technologie und Parallele Systeme, Universität Wien, Austria, Technischer Bericht TR 98-1 (1998), 12 pages.

• Braun, V., Knoop, J., and Koschützki, D. Cool: A control-flow generator for system analysis..
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9801 (1998), 16 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Code motion and code placement: Just Synonyms?
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9716 (1997), 20 pages.

• Knoop, J., Koschützki, D., and Steffen, B. Basic-block graphs: Living dinosaurs?
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9715 (1997), 29 pages.

• Knoop, J., and Mehofer, E. Distribution assignment placement: A new aggressive approach for optimizing redistribution costs.
  Institut für Software Technologie und Parallele Systeme, Universität Wien, Austria, Technischer Bericht TR 97-6 (1997), 23 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Syntactic versus semantic code motion: Analogies and essential differences.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9616 (1996), 16 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Towards a tool kit for the automatic generation of interprocedural data flow analyses.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9615 (1996), 42 pages.

• Knoop, J., and Golubski, W. Precise type analysis by abstract interpretation.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9619 (1996), 26 pages.

• Knoop, J. Eliminating partially dead code in explicitly parallel programs.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9618 (1996), 26 pages.

• Geser, A., Knoop, J., Lüttgen, G., Rüthing, O., and Steffen, B. Non-monotone fixpoint iterations to resolve second order effects.
  Department of Computer Science, North Carolina State University, Raleigh, North Carolina, Technical Report 9601 (1996), 18 pages.

• Knoop, J., Steffen, B, and Vollmer, J. Optimal code motion for parallel programs.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9511 (1995), 30 pages.

• Knoop, J., Rüthing, O., and Steffen, B. A tool kit for constructing optimal interprocedural data flow analyses.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9413 (1994), 26 pages.

• Knoop, J., Steffen, B., and Vollmer, J. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9409 (1994), 29 pages.

• Geser, A., Knoop, J., Lüttgen, G., Rüthing, O., and Steffen, B. Chaotic fixed point iterations.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9403 (1994), 15 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Partial dead code elimination.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9407 (1994), 18 pages.

• Knoop, J., and Steffen, B. Gemeinsamer Bericht über die Forschungsvorhaben ``Vollständige interprozedurale Programmoptimierung'' und ``Interprozedurale Datenflußanalysegeneratoren I, II & III''.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9406 (1994), 36 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Optimal code motion: Theory and practice.
  Fakultät für Mathematik und Informatik, Universität Passau, Germany, MIP-Bericht Nr. 9310 (1993), 35 pages.

• Knoop, J., and Steffen, B. Efficient and optimal bit-vector data flow analyses: A uniform interprocedural framework.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9309 (1993), 22 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy strength reduction.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9216 (1992), 25 pages.

• Knoop, J., Rüthing, O., and Steffen, B. Lazy code motion.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9208 (1992), 17 pages.

• Knoop, J., and Steffen, B. Unifying strength reduction and semantic code motion.
  Rheinisch-Westfälische Technische Hochschule Aachen, Germany, Aachener Informatik-Berichte Nr. 91-28 (1991), 42 pages.

• Knoop, J., and Steffen, B. The interprocedural coincidence theorem.
  Rheinisch-Westfälische Technische Hochschule Aachen, Germany, Aachener Informatik-Berichte Nr. 91-27 (1991), 29 pages.

• Knoop, J., and Steffen, B. Strength reduction based on code motion: A uniform approach.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9103 (1991), 30 pages.

• Steffen, B., Knoop, J., and Rüthing, O. Optimal code motion within flow graphs: A practical approach.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9102 (1991), 37 pages.

• Steffen, B., Knoop, J., and Rüthing, O. The value flow graph: A program representation for optimal program transformations.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 9004 (1990), 30 pages.

• Steffen, B., and Knoop, J. Finite constants: Characterizations of a new decidable set of constants.
  Laboratory for Foundations of Computer Science, University of Edinburgh, United Kingdom, LFCS Report Series, ECS-LFCS-89-79 (1989), 19 pages.

• Steffen, B., and Knoop, J. Finite constants: Characterizations of a new decidable set of constants.
  Extended Abstract. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 8809 (1988), 13 pages.

• Steffen, B., and Knoop, J. Partial redundancy elimination: A general and complete algorithm.
  Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Germany, Bericht Nr. 8806 (1988), 10 pages.

Back to top

Editor of Proceedings and Journal Issues

• Knoop, J., and Zimmermann, W., Guest Editors, Electronic Notes in Theoretical Computer Science, vol. 82(2) (2004). Proceedings of the 2nd International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2003) (Warsaw, Poland, April 12, 2003).

• Knoop, J., and Zimmermann, W., Guest Editors, J.UCS Special Issue on Compiler Optimization meets Compiler Verification (COCV 2002), vol. 9(3), 2003.

• Knoop, J., and Zimmermann, W., Guest Editors, Electronic Notes in Theoretical Computer Science, vol. 65(2), May 2002. Proceedings of the International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2002) (Grenoble, France, April 13, 2002).

• Dulong, C., Gupta, R., Kennedy, R., Knoop, J., and Pierce, J., Editors, Report on the Dagstuhl-Seminar Code Optimisation - Trends, Challenges, and Perspectives. Dagstuhl-Seminar-Report 286, Schloß Dagstuhl, Germany, (2001).

Back to top