Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jens Knoop
2010 – today
- 2013
[j19]Dietmar Schreiner, Gergö Barany, Markus Schordan, Jens Knoop: Comparison of type-based and alias-based component recognition for embedded systems software. STTT 15(1): 41-52 (2013)- [j18]Björn Lisper, Andreas Ermedahl, Dietmar Schreiner, Jens Knoop, Peter Gliwa: Practical experiences of applying source-level WCET flow analysis to industrial code. STTT 15(1): 53-63 (2013)
- [c54]Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr: SmacC: A Retargetable Symbolic Execution Engine. ATVA 2013: 482-486
- [c53]Jens Knoop, Laura Kovács, Jakob Zwirchmayr: WCET squeezing: on-demand feasibility refinement for proven precise WCET-bounds. RTNS 2013: 161-170
- [c52]Jens Knoop, Janis Voigtländer: Vorwort zur 6. Arbeitstagung Programmiersprachen (ATPS 2013). Software Engineering (Workshops) 2013: 17-20
- [c51]Jens Knoop, Janis Voigtländer: 6. Arbeitstagung Programmiersprachen (ATPS 2013). Software Engineering 2013: 369
- [c50]Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr: The Auspicious Couple: Symbolic Execution and WCET Analysis. WCET 2013: 53-63
- 2012
- [j17]Valentina Salapura, Michael Gschwind, Jens Knoop: Guest Editorial: Parallel Systems and Compilers. International Journal of Parallel Programming 40(1): 1-3 (2012)
- [c49]
- [c48]Jens Knoop, Laura Kovács, Jakob Zwirchmayr: r-TuBound: Loop Bounds for WCET Analysis (Tool Paper). LPAR 2012: 435-444
- [c47]Armelle Bonenfant, Hugues Cassé, Marianne De Michiel, Jens Knoop, Laura Kovács, Jakob Zwirchmayr: FFX: a portable WCET annotation language. RTNS 2012: 91-100
- 2011
- [j16]Raimund Kirner, Jens Knoop, Adrian Prantl, Markus Schordan, Albrecht Kadlec: Beyond loop bounds: comparing annotation languages for worst-case execution time analysis. Software and System Modeling 10(3): 411-437 (2011)
- [c46]Jens Knoop, Laura Kovács, Jakob Zwirchmayr: Symbolic Loop Bound Computation for WCET Analysis. Ershov Memorial Conference 2011: 227-242
- [e4]Jens Knoop (Ed.): Compiler Construction - 20th International Conference, CC 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings. Lecture Notes in Computer Science 6601, Springer 2011, ISBN 978-3-642-19860-1
- 2010
- [j15]Lian Li, Jingling Xue, Jens Knoop: Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs. ACM Trans. Embedded Comput. Syst. 10(2): 28 (2010)
- [c45]Björn Lisper, Andreas Ermedahl, Dietmar Schreiner, Jens Knoop, Peter Gliwa: Practical Experiences of Applying Source-Level WCET Flow Analysis on Industrial Code. ISoLA (2) 2010: 449-463
- [c44]Jens Knoop, Wolf Zimmermann: On the Role of Non-functional Properties in Compiler Verification. ISoLA (2) 2010: 491-495
- [e3]Valentina Salapura, Michael Gschwind, Jens Knoop (Eds.): 19th International Conference on Parallel Architecture and Compilation Techniques (PACT 2010), Vienna, Austria, September 11-15, 2010. ACM 2010, ISBN 978-1-4503-0178-7
2000 – 2009
- 2009
- [c43]Dietmar Schreiner, Markus Schordan, Jens Knoop: Adding Timing-Awareness to AUTOSAR Basic-Software -- A Component Based Approach. ISORC 2009: 288-292
- [c42]Adrian Prantl, Jens Knoop, Raimund Kirner, Albrecht Kadlec, Markus Schordan: From Trusted Annotations to Verified Knowledge. WCET 2009
- [i1]Adrian Prantl, Jens Knoop, Markus Schordan, Markus Triska: Constraint solving for high-level WCET analysis. CoRR abs/0903.2251 (2009)
- 2008
- [c41]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, Nicholas Merriam, Marianne De Michiel, Adrian Prantl, Bernhard Rieder, Christine Rochange, Pascal Sainrat, Markus Schordan: WCET 2008 - Report from the Tool Challenge 2008 -- 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis. WCET 2008
- [c40]Raimund Kirner, Albrecht Kadlec, Adrian Prantl, Markus Schordan, Jens Knoop: Towards a Common WCET Annotation Language: Essential Ingredients. WCET 2008
- [c39]Adrian Prantl, Markus Schordan, Jens Knoop: TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis. WCET 2008
- 2007
- [j14]Jens Knoop, George C. Necula, Wolf Zimmermann: Preface. Electr. Notes Theor. Comput. Sci. 176(3): 1-2 (2007)
- [j13]Sabine Glesner, Jens Knoop, Rolf Drechsler: Preface. Electr. Notes Theor. Comput. Sci. 190(4): 1-2 (2007)
- [c38]Raimund Kirner, Jens Knoop, Adrian Prantl, Markus Schordan, Ingomar Wenzel: WCET Analysis: The Annotation Language Challenge. WCET 2007
- 2006
- [j12]Jingling Xue, Jens Knoop: A Fresh Look at Partial Redundancy Elimination as a Maximum Flow Problem. Softwaretechnik-Trends 26(2) (2006)
- [c37]
- 2005
- [j11]Jens Knoop, George C. Necula, Wolf Zimmermann: Preface. Electr. Notes Theor. Comput. Sci. 132(1): 1-3 (2005)
- [j10]Jens Knoop, George C. Necula, Wolf Zimmermann: Preface. Electr. Notes Theor. Comput. Sci. 141(2): 1-3 (2005)
- [c36]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
- [c35]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
- [e2]Erik R. Altman, James C. Dehnert, Christoph W. Kessler, Jens Knoop (Eds.): Scheduling for Parallel Architectures: Theory, Applications, Challenges. Dagstuhl Seminar Proceedings 05101, Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany 2005
- 2004
- [c34]Bernhard Scholz, R. Nigel Horspool, Jens Knoop: Optimizing for space and time usage with speculative partial redundancy elimination. LCTES 2004: 221-230
- 2003
- [j9]
- [j8]
- 2002
- [j7]
- [j6]Jens Knoop, Eduard Mehofer: Distribution Assignment Placement: Effective Optimization of Redistribution Costs. IEEE Trans. Parallel Distrib. Syst. 13(6): 628-647 (2002)
- [e1]Jens Knoop, Laurie J. Hendren (Eds.): Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Berlin, Germany, June 17-19, 2002. ACM 2002, ISBN 1-58113-463-0
- 2001
- [c33]Jens Knoop, Manish Gupta, Keshav Pingali, Michael F. P. O'Boyle: Topic 04: Compilers for High Performance. Euro-Par 2001: 204-206
- 2000
- [c32]Jens Knoop, Oliver Rüthing: Constant Propagation on the Value Graph: Simple Constants and Beyond. CC 2000: 94-109
- [c31]Samuel P. Midkiff, Barbara M. Chapman, Jean-Francois Collard, Jens Knoop: Compilers for High Performance. Euro-Par 2000: 329-330
- [c30]
- [c29]Jens Knoop, Jean-Francois Collard, Roy Dz-Ching Ju: Partial Redundancy Elimination on Predicated Code. SAS 2000: 260-279
1990 – 1999
- 1999
- [c28]
- [c27]Jens Knoop, Oliver Rüthing: Optimization Under the Perspective of Soundness, Completeness, and Reusability. Correct System Design 1999: 288-315
- [c26]Jens Knoop, Oliver Rüthing, Bernhard Steffen: Expansion-Based Removal of Semantic Partial Redundancies. CC 1999: 91-106
- [c25]
- [c24]Javier Esparza, Jens Knoop: An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. FoSSaCS 1999: 14-30
- [c23]
- [c22]Oliver Rüthing, Jens Knoop, Bernhard Steffen: Detecting Equalities of Variables: Combining Efficiency with Precision. SAS 1999: 232-247
- [c21]Jens Knoop: From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach. TACAS 1999: 360-374
- 1998
- [b1]Jens Knoop: Optimal Interprocedural Program Optimization, A New Framework and Its Application. Lecture Notes in Computer Science 1428, Springer 1998, ISBN 3-540-65123-3
- [j5]Jens Knoop: Eliminating Partially Dead Code in Explicitly Parallel Programs. Theor. Comput. Sci. 196(1-2): 365-393 (1998)
- [c20]
- [c19]Volker Braun, Jens Knoop, Dirk Koschützki: Cool: A Control-Flow Generator for System Analysis. CC 1998: 306-309
- [c18]Jens Knoop, Oliver Rüthing, Bernhard Steffen: Code Motion and Code Placement: Just Synonyms? ESOP 1998: 154-169
- [c17]
- [c16]Jens Knoop: Formal Callability and Its Relevance and Application to Interprocedural Data-Flow Analysis. ICCL 1998: 252-261
- 1997
- [c15]Jens Knoop, Eduard Mehofer: Interprocedural Distribution Assignment Placement: More than Just Enhancing Intraprocedural Placing Techniques. IEEE PACT 1997: 26-
- [c14]
- 1996
- [j4]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)
- [j3]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)
- [c13]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
- [c12]
- [c11]Marion Klein, Jens Knoop, Dirk Koschützki, Bernhard Steffen: DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation. TACAS 1996: 422-426
- 1995
- [c10]Bernhard Steffen, Andreas Claßen, Marion Klein, Jens Knoop, Tiziana Margaria: The Fixpoint-Analysis Machine. CONCUR 1995: 72-87
- [c9]
- [c8]Jens Knoop, Bernhard Steffen, Jürgen Vollmer: Parallelism for Free: Bitvector Analyses -> No State Explosion! TACAS 1995: 264-289
- 1994
- [j2]Jens Knoop, Oliver Rüthing, Bernhard Steffen: Optimal Code Motion: Theory and Practice. ACM Trans. Program. Lang. Syst. 16(4): 1117-1155 (1994)
- [c7]
- 1992
- [c6]
- [c5]
- [c4]Jens Knoop, Oliver Rüthing, Bernhard Steffen: Lazy code motion (with retrospective). Best of PLDI 1992: 460-472
- 1991
- [j1]Bernhard Steffen, Jens Knoop: Finite Constants: Characterizations of a New Decidable Set of Constants. Theor. Comput. Sci. 80(2): 303-318 (1991)
- [c3]Bernhard Steffen, Jens Knoop, Oliver Rüthing: Efficient Code Motion and an Adaption to Strength Reduction. TAPSOFT, Vol.2 1991: 394-415
- 1990
- [c2]Bernhard Steffen, Jens Knoop, Oliver Rüthing: The Value Flow Graph: A Program Representation for Optimal Program Transformations. ESOP 1990: 389-405
1980 – 1989
- 1989
- [c1]Bernhard Steffen, Jens Knoop: Finite Constants: Characterizations of a New Decidable Set of Constants. MFCS 1989: 481-491
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:27 CEST by the dblp team