The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jens Knoop: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  47. 05101 Executive Summary - Scheduling for Parallel Architectures: Theory, Applications, Challenges. [Citation Graph (, )][DBLP]


  48. 05101 Abstracts Collection - Scheduling for Parallel Architectures: Theory, Applications, Challenges. [Citation Graph (, )][DBLP]


  49. Adding Timing-Awareness to AUTOSAR Basic-Software -- A Component Based Approach. [Citation Graph (, )][DBLP]


  50. WCET Analysis: The Annotation Language Challenge. [Citation Graph (, )][DBLP]


  51. TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis. [Citation Graph (, )][DBLP]


  52. WCET 2008 - Report from the Tool Challenge 2008 -- 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis. [Citation Graph (, )][DBLP]


  53. From Trusted Annotations to Verified Knowledge. [Citation Graph (, )][DBLP]


  54. Towards a Common WCET Annotation Language: Essential Ingredients. [Citation Graph (, )][DBLP]


  55. Constraint solving for high-level WCET analysis [Citation Graph (, )][DBLP]


  56. Preface. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002