Jens Knoop

Affiliations:
  • TU Wien, Vienna, Austria


According to our database1, Jens Knoop authored at least 78 papers between 1986 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution.
J. Symb. Comput., 2017

2015
T-CREST: Time-predictable multi-core architecture for embedded systems.
J. Syst. Archit., 2015

2014
Model-Based Code-Generators and Compilers - Track Introduction.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

2013
Comparison of type-based and alias-based component recognition for embedded systems software.
Int. J. Softw. Tools Technol. Transf., 2013

Practical experiences of applying source-level WCET flow analysis to industrial code.
Int. J. Softw. Tools Technol. Transf., 2013

The Auspicious Couple: Symbolic Execution and WCET Analysis.
Proceedings of the 13th International Workshop on Worst-Case Execution Time Analysis, 2013

Vorwort zur 6. Arbeitstagung Programmiersprachen (ATPS 2013).
Proceedings of the Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

6. Arbeitstagung Programmiersprachen (ATPS 2013).
Proceedings of the Software Engineering 2013: Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

WCET squeezing: on-demand feasibility refinement for proven precise WCET-bounds.
Proceedings of the 21st International Conference on Real-Time Networks and Systems, 2013

The T-CREST approach of compiler and WCET-analysis integration.
Proceedings of the 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, 2013

SmacC: A Retargetable Symbolic Execution Engine.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Guest Editorial: Parallel Systems and Compilers.
Int. J. Parallel Program., 2012

FFX: a portable WCET annotation language.
Proceedings of the 20th International Conference on Real-Time and Network Systems, 2012

r-TuBound: Loop Bounds for WCET Analysis (Tool Paper).
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Software Aspects of Robotic Systems.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies, 2012

2011
Beyond loop bounds: comparing annotation languages for worst-case execution time analysis.
Softw. Syst. Model., 2011

Symbolic Loop Bound Computation for WCET Analysis.
Proceedings of the Perspectives of Systems Informatics, 2011

2010
Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs.
ACM Trans. Embed. Comput. Syst., 2010

Practical Experiences of Applying Source-Level WCET Flow Analysis on Industrial Code.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

On the Role of Non-functional Properties in Compiler Verification.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

2009
Constraint solving for high-level WCET analysis
CoRR, 2009

From Trusted Annotations to Verified Knowledge.
Proceedings of the 9th Intl. Workshop on Worst-Case Execution Time Analysis, 2009

Adding Timing-Awareness to AUTOSAR Basic-Software -- A Component Based Approach.
Proceedings of the 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, 2009

2008
TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis.
Proceedings of the 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2008

Towards a Common WCET Annotation Language: Essential Ingredients.
Proceedings of the 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2008

WCET 2008 - Report from the Tool Challenge 2008 -- 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis.
Proceedings of the 8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2008

Data-Flow Analysis for Multi-Core Computing Systems: A Reminder to Reverse Data-Flow Analysis.
Proceedings of the Scalable Program Analysis, 13.04. - 18.04.2008, 2008

08441 Final Report - Emerging Uses and Paradigms for Dynamic Binary Translation.
Proceedings of the Emerging Uses and Paradigms for Dynamic Binary Translation, 26.10., 2008

2007
Preface.
Proceedings of the Workshop on Compiler Optimization meets Compiler Verification, 2007

WCET Analysis: The Annotation Language Challenge.
Proceedings of the 7th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2007

2006
A Fresh Look at Partial Redundancy Elimination as a Maximum Flow Problem.
Softwaretechnik-Trends, 2006

Preface.
Proceedings of the 5th International Workshop on Compiler Optimization meets Compiler Verification, 2006

A Fresh Look at PRE as a Maximum Flow Problem.
Proceedings of the Compiler Construction, 15th International Conference, 2006

2005
05101 Abstracts Collection - Scheduling for Parallel Architectures: Theory, Applications, Challenges.
Proceedings of the Scheduling for Parallel Architectures: Theory, Applications, Challenges, 2005

05101 Executive Summary - Scheduling for Parallel Architectures: Theory, Applications, Challenges.
Proceedings of the Scheduling for Parallel Architectures: Theory, Applications, Challenges, 2005

2004
Optimizing for space and time usage with speculative partial redundancy elimination.
Proceedings of the 2004 ACM SIGPLAN/SIGBED Conference on Languages, 2004

2003
Constant Propagation on Predicated Code.
J. Univers. Comput. Sci., 2003

2002
Distribution Assignment Placement: Effective Optimization of Redistribution Costs.
IEEE Trans. Parallel Distributed Syst., 2002

Preface.
Proceedings of the Compiler Optimization Meets Compiler Verification, 2002

2001
Topic 04: Compilers for High Performance.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000
Partial Redundancy Elimination on Predicated Code.
Proceedings of the Static Analysis, 7th International Symposium, 2000

Sparse Code Motion.
Proceedings of the POPL 2000, 2000

Compilers for High Performance.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Constant Propagation on the Value Graph: Simple Constants and Beyond.
Proceedings of the Compiler Construction, 9th International Conference, 2000

1999
From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1999

Detecting Equalities of Variables: Combining Efficiency with Precision.
Proceedings of the Static Analysis, 6th International Symposium, 1999

Code Motion for Explicitly Parallel Programs.
Proceedings of the 1999 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP'99), 1999

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

Parallel Data-Flow Analysis of Explicitly Parallel Programs.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Expansion-Based Removal of Semantic Partial Redundancies.
Proceedings of the Compiler Construction, 8th International Conference, 1999

Optimization Under the Perspective of Soundness, Completeness, and Reusability.
Proceedings of the Correct System Design, 1999

Demand-Driven Model Checking for Context-Free Processes.
Proceedings of the Advances in Computing Science, 1999

1998
Eliminating Partially Dead Code in Explicitly Parallel Programs.
Theor. Comput. Sci., 1998

Formal Callability and Its Relevance and Application to Interprocedural Data-Flow Analysis.
Proceedings of the 1998 International Conference on Computer Languages, 1998

Parallel Constant Propagation.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

Code Motion and Code Placement: Just Synonyms?
Proceedings of the Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28, 1998

Basic-Block Graphs: Living Dinosaurs?
Proceedings of the Compiler Construction, 7th International Conference, 1998

Cool: A Control-Flow Generator for System Analysis.
Proceedings of the Compiler Construction, 7th International Conference, 1998

Optimal Interprocedural Program Optimization, A New Framework and Its Application
Lecture Notes in Computer Science 1428, Springer, ISBN: 3-540-65123-3, 1998

1997
Optimal Distribution Assignment Placement.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Interprocedural Distribution Assignment Placement: More than Just Enhancing Intraprocedural Placing Techniques.
Proceedings of the 1997 Conference on Parallel Architectures and Compilation Techniques (PACT '97), 1997

1996
Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs.
ACM Trans. Program. Lang. Syst., 1996

Towards a tool kit for the automatic generation of interprocedural data flow analyses.
J. Program. Lang., 1996

DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

Partial Dead Code Elimination for Parallel Programs.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Non-monotone Fixpoint Iterations to Resolve Second Order Effects.
Proceedings of the Compiler Construction, 6th International Conference, 1996

1995
Parallelism for Free: Bitvector Analyses -> No State Explosion!
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1995

The Power of Assignment Motion.
Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation (PLDI), 1995

The Fixpoint-Analysis Machine.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
Optimal Code Motion: Theory and Practice.
ACM Trans. Program. Lang. Syst., 1994

Partial Dead Code Elimination.
Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994

1992
Lazy code motion (with retrospective)
Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1992

Lazy Code Motion.
Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation (PLDI), 1992

The Interprocedural Coincidence Theorem.
Proceedings of the Compiler Construction, 1992

1991
Finite Constants: Characterizations of a New Decidable Set of Constants.
Theor. Comput. Sci., 1991

Efficient Code Motion and an Adaption to Strength Reduction.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

1990
The Value Flow Graph: A Program Representation for Optimal Program Transformations.
Proceedings of the ESOP'90, 1990

1986
Online-Kostenrechnung für die CIM-Planung: prozessorientierte Kostenrechnung zur Ablaufplanung flexibler Fertigungssysteme.
PhD thesis, 1986


  Loading...