default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens Knoop
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c61]Emad Jacob Maroun, Eva Dengler, Christian Dietrich, Stefan Hepp, Henriette Herzog, Benedikt Huber, Jens Knoop, Daniel Wiltsche-Prokesch, Peter P. Puschner, Phillip Raffeck, Martin Schoeberl, Simon Schuster, Peter Wägemann:
The Platin Multi-Target Worst-Case Analysis Tool. WCET 2024: 2:1-2:14
2010 – 2019
- 2018
- [e15]Jens Knoop, Markus Schordan, Teresa Johnson, Michael F. P. O'Boyle:
Proceedings of the 2018 International Symposium on Code Generation and Optimization, CGO 2018, Vösendorf / Vienna, Austria, February 24-28, 2018. ACM 2018 [contents] - 2017
- [j15]Jens Knoop, Laura Kovács
, Jakob Zwirchmayr:
Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution. J. Symb. Comput. 80: 101-124 (2017) - [e14]Jens Knoop, Wolfgang Karl, Martin Schulz, Koji Inoue, Thilo Pionteck:
Architecture of Computing Systems - ARCS 2017 - 30th International Conference, Vienna, Austria, April 3-6, 2017, Proceedings. Lecture Notes in Computer Science 10172, Springer 2017, ISBN 978-3-319-54998-9 [contents] - 2016
- [e13]Jens Knoop, Uwe Zdun:
Software Engineering 2016, Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Februar 2016, Wien, Österreich. LNI P-252, GI 2016, ISBN 978-388579-646-6 [contents] - 2015
- [j14]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, Alexander Jordan, Evangelia Kasapaki, Jens Knoop, Yonghui Li, Daniel Prokesch, Wolfgang Puffitsch, Peter P. Puschner, André Rocha, Cláudio Silva, Jens Sparsø, Alessandro Tocchi:
T-CREST: Time-predictable multi-core architecture for embedded systems. J. Syst. Archit. 61(9): 449-471 (2015) - 2014
- [c60]Uwe Aßmann, Jens Knoop, Wolf Zimmermann:
Model-Based Code-Generators and Compilers - Track Introduction. ISoLA (1) 2014: 386-390 - [e12]Jens Knoop, Valentina Salapura, Israel Koren, Gerardo Pelosi:
Proceedings of the First Workshop on Cryptography and Security in Computing Systems, CS2@HiPEAC 2014, Vienna, Austria, January 20, 2014. ACM 2014, ISBN 978-1-4503-2484-7 [contents] - 2013
- [j13]Dietmar Schreiner, Gergö Barany, Markus Schordan, Jens Knoop:
Comparison of type-based and alias-based component recognition for embedded systems software. Int. J. Softw. Tools Technol. Transf. 15(1): 41-52 (2013) - [j12]Björn Lisper, Andreas Ermedahl, Dietmar Schreiner, Jens Knoop, Peter Gliwa:
Practical experiences of applying source-level WCET flow analysis to industrial code. Int. J. Softw. Tools Technol. Transf. 15(1): 53-63 (2013) - [c59]Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
SmacC: A Retargetable Symbolic Execution Engine. ATVA 2013: 482-486 - [c58]Peter P. Puschner, Daniel Prokesch, Benedikt Huber, Jens Knoop, Stefan Hepp, Gernot Gebhard:
The T-CREST approach of compiler and WCET-analysis integration. ISORC 2013: 1-8 - [c57]Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
WCET squeezing: on-demand feasibility refinement for proven precise WCET-bounds. RTNS 2013: 161-170 - [c56]Jens Knoop, Janis Voigtländer:
Vorwort zur 6. Arbeitstagung Programmiersprachen (ATPS 2013). Software Engineering (Workshops) 2013: 17-20 - [c55]Jens Knoop, Janis Voigtländer:
6. Arbeitstagung Programmiersprachen (ATPS 2013). Software Engineering 2013: 369 - [c54]Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
The Auspicious Couple: Symbolic Execution and WCET Analysis. WCET 2013: 53-63 - 2012
- [j11]Valentina Salapura, Michael Gschwind, Jens Knoop:
Guest Editorial: Parallel Systems and Compilers. Int. J. Parallel Program. 40(1): 1-3 (2012) - [c53]Jens Knoop, Dietmar Schreiner:
Software Aspects of Robotic Systems. ISoLA (2) 2012: 323 - [c52]Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
r-TuBound: Loop Bounds for WCET Analysis (Tool Paper). LPAR 2012: 435-444 - [c51]Armelle Bonenfant, Hugues Cassé, Marianne De Michiel, Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
FFX: a portable WCET annotation language. RTNS 2012: 91-100 - [e11]Reiner Hähnle, Jens Knoop, Tiziana Margaria, Dietmar Schreiner, Bernhard Steffen:
Leveraging Applications of Formal Methods, Verification, and Validation - International Workshops, SARS 2011 and MLSC 2011, Held Under the Auspices of ISoLA 2011 in Vienna, Austria, October 17-18, 2011. Revised Selected Papers. Communications in Computer and Information Science 336, Springer 2012, ISBN 978-3-642-34780-1 [contents] - 2011
- [j10]Raimund Kirner, Jens Knoop, Adrian Prantl, Markus Schordan, Albrecht Kadlec:
Beyond loop bounds: comparing annotation languages for worst-case execution time analysis. Softw. Syst. Model. 10(3): 411-437 (2011) - [c50]Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
Symbolic Loop Bound Computation for WCET Analysis. Ershov Memorial Conference 2011: 227-242 - [e10]Jens Knoop:
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 [contents] - 2010
- [j9]Lian Li, Jingling Xue, Jens Knoop:
Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs. ACM Trans. Embed. Comput. Syst. 10(2): 28:1-28:42 (2010) - [c49]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 - [c48]Jens Knoop, Wolf Zimmermann:
On the Role of Non-functional Properties in Compiler Verification. ISoLA (2) 2010: 491-495 - [e9]Valentina Salapura, Michael Gschwind, Jens Knoop:
19th International Conference on Parallel Architectures and Compilation Techniques, PACT 2010, Vienna, Austria, September 11-15, 2010. ACM 2010, ISBN 978-1-4503-0178-7 [contents]
2000 – 2009
- 2009
- [c47]Dietmar Schreiner, Markus Schordan, Jens Knoop:
Adding Timing-Awareness to AUTOSAR Basic-Software -- A Component Based Approach. ISORC 2009: 288-292 - [c46]Adrian Prantl, Jens Knoop, Raimund Kirner, Albrecht Kadlec, Markus Schordan:
From Trusted Annotations to Verified Knowledge. WCET 2009 - [i5]Adrian Prantl, Jens Knoop, Markus Schordan, Markus Triska:
Constraint solving for high-level WCET analysis. CoRR abs/0903.2251 (2009) - 2008
- [c45]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 - [c44]Raimund Kirner, Albrecht Kadlec, Adrian Prantl, Markus Schordan, Jens Knoop:
Towards a Common WCET Annotation Language: Essential Ingredients. WCET 2008 - [c43]Adrian Prantl, Markus Schordan, Jens Knoop:
TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis. WCET 2008 - [i4]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, Wei-Chung Hsu, Jens Knoop, Andreas Krall, Naveen Kumar, Jonas Maebe, Robert Muth, Xavier Rival, Erven Rohou, Roni Rosner, Mary Lou Soffa, Jens Tröger, Christopher A. Vick:
08441 Final Report - Emerging Uses and Paradigms for Dynamic Binary Translation. Emerging Uses and Paradigms for Dynamic Binary Translation 2008 - [i3]Jens Knoop:
Data-Flow Analysis for Multi-Core Computing Systems: A Reminder to Reverse Data-Flow Analysis. Scalable Program Analysis 2008 - 2007
- [c42]Raimund Kirner, Jens Knoop, Adrian Prantl, Markus Schordan, Ingomar Wenzel:
WCET Analysis: The Annotation Language Challenge. WCET 2007 - [c41]Sabine Glesner, Jens Knoop, Rolf Drechsler:
Preface. COCV@ETAPS 2007: 1-2 - [e8]Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the 5th International Workshop on Compiler Optimization meets Compiler Verification, COCV@ETAPS 2006, Vienna, Austria, April 2, 2006. Electronic Notes in Theoretical Computer Science 176(3), Elsevier 2007 [contents] - [e7]Sabine Glesner, Jens Knoop, Rolf Drechsler:
Proceedings of the Workshop on Compiler Optimization meets Compiler Verification, COCV@ETAPS 2007, Braga, Portugal, March 25, 2007. Electronic Notes in Theoretical Computer Science 190(4), Elsevier 2007 [contents] - 2006
- [j8]Jingling Xue, Jens Knoop:
A Fresh Look at Partial Redundancy Elimination as a Maximum Flow Problem. Softwaretechnik-Trends 26(2) (2006) - [c40]Jingling Xue, Jens Knoop:
A Fresh Look at PRE as a Maximum Flow Problem. CC 2006: 139-154 - [c39]Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. COCV@ETAPS 2006: 1-2 - 2005
- [c38]Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. COCV@ETAPS 2005: 1-3 - [e6]Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the 3rd International Workshop on Compiler Optimization Meets Compiler Verification, COCV@ETAPS 2004, Barcelona, Spain, April 3, 2004. Electronic Notes in Theoretical Computer Science 132(1), Elsevier 2005 [contents] - [e5]Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the Fourth International Workshop on Compiler Optimization meets Compiler Verification, COCV@ETAPS 2005, Edinburgh, UK, April 3, 2005. Electronic Notes in Theoretical Computer Science 141(2), Elsevier 2005 [contents] - [e4]Erik R. Altman, James C. Dehnert, Christoph W. Kessler, Jens Knoop:
Scheduling for Parallel Architectures: Theory, Applications, Challenges. Dagstuhl Seminar Proceedings 05101, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 [contents] - [i2]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 - [i1]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 - 2004
- [c37]Bernhard Scholz, R. Nigel Horspool, Jens Knoop:
Optimizing for space and time usage with speculative partial redundancy elimination. LCTES 2004: 221-230 - [c36]Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. COCV@ETAPS 2004: 1-3 - [e3]Jens Knoop, Wolf Zimmermann:
Compiler Optimization Meets Compiler Verification, COCV@ETAPS 2003, Warsaw, Poland, April 12, 2003. Electronic Notes in Theoretical Computer Science 82(2), Elsevier 2004 [contents] - 2003
- [j7]Jens Knoop, Oliver Rüthing:
Constant Propagation on Predicated Code. J. Univers. Comput. Sci. 9(8): 829-872 (2003) - [c35]Jens Knoop, Wolf Zimmermann:
Preface. COCV@ETAPS 2003: 343-344 - 2002
- [j6]Jens Knoop, Eduard Mehofer:
Distribution Assignment Placement: Effective Optimization of Redistribution Costs. IEEE Trans. Parallel Distributed Syst. 13(6): 628-647 (2002) - [c34]Jens Knoop, Wolf Zimmermann:
Preface. COCV@ETAPS 2002: 115-116 - [e2]Jens Knoop, Wolf Zimmermann:
Compiler Optimization Meets Compiler Verification, COCV 2002, Satellite Event of ETAPS 2002, Grenoble, France, April 13, 2002. Electronic Notes in Theoretical Computer Science 65(2), Elsevier 2002 [contents] - [e1]Jens Knoop, Laurie J. Hendren:
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 [contents] - 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]Oliver Rüthing, Jens Knoop, Bernhard Steffen:
Sparse Code Motion. POPL 2000: 170-183 - [c29]Jens Knoop, Jean-Francois Collard, Roy Dz-Ching Ju:
Partial Redundancy Elimination on Predicated Code. SAS 2000: 260-279
1990 – 1999
- 1999
- [c28]Jens Knoop:
Demand-Driven Model Checking for Context-Free Processes. ASIAN 1999: 201-213 - [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]Jens Knoop:
Parallel Data-Flow Analysis of Explicitly Parallel Programs. Euro-Par 1999: 391-400 - [c24]Javier Esparza, Jens Knoop:
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. FoSSaCS 1999: 14-30 - [c23]Jens Knoop, Bernhard Steffen:
Code Motion for Explicitly Parallel Programs. PPoPP 1999: 13-24 - [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
- [b2]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]Jens Knoop, Dirk Koschützki, Bernhard Steffen:
Basic-Block Graphs: Living Dinosaurs? CC 1998: 65-79 - [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]Jens Knoop:
Parallel Constant Propagation. Euro-Par 1998: 445-455 - [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]Jens Knoop, Eduard Mehofer:
Optimal Distribution Assignment Placement. Euro-Par 1997: 364-373 - 1996
- [j4]Jens Knoop, Oliver Rüthing, Bernhard Steffen:
Towards a tool kit for the automatic generation of interprocedural data flow analyses. J. Program. 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]Jens Knoop:
Partial Dead Code Elimination for Parallel Programs. Euro-Par, Vol. I 1996: 441-450 - [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]Jens Knoop, Oliver Rüthing, Bernhard Steffen:
The Power of Assignment Motion. PLDI 1995: 233-245 - [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]Jens Knoop, Oliver Rüthing, Bernhard Steffen:
Partial Dead Code Elimination. PLDI 1994: 147-158 - 1992
- [c6]Jens Knoop, Bernhard Steffen:
The Interprocedural Coincidence Theorem. CC 1992: 125-140 - [c5]Jens Knoop, Oliver Rüthing, Bernhard Steffen:
Lazy Code Motion. PLDI 1992: 224-234 - [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 - 1986
- [b1]Jens Knoop:
Online-Kostenrechnung für die CIM-Planung: prozessorientierte Kostenrechnung zur Ablaufplanung flexibler Fertigungssysteme. Technical University of Berlin, Germany, Erich Schmidt 1986, ISBN 978-3-503-02569-5, pp. 1-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
