BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Italy
1 × Sweden
2 × Denmark
2 × Portugal
3 × Germany
3 × The Netherlands
7 × USA
Collaborated with:
B.Steffen O.Rüthing D.Koschützki J.Xue J.Esparza ∅ B.Scholz R.N.Horspool J.Collard R.D.Ju V.Braun J.Vollmer M.Klein A.Geser G.Lüttgen
Talks about:
code (9) motion (7) program (4) partial (4) flow (4) analysi (3) redund (3) elimin (3) graph (3) dfa (3)

♂ Person: Jens Knoop

DBLP DBLP: Knoop:Jens

Facilitated 7 volumes:

ICMT 2015PrCo
CC 2011Ed
COCV 2007Ed
COCV 2005Ed
LDTA 2005PrCo
LDTA 2004PrCo
PLDI 2002Ed

Contributed to:

CC 20062006
LCTES 20042004
CC 20002000
POPL 20002000
SAS 20002000
CC 19991999
FoSSaCS 19991999
PPoPP 19991999
SAS 19991999
TACAS 19991999
CC 19981998
ESOP 19981998
CC 19961996
TACAS 19961996
PLDI 19951995
TACAS 19951995
PLDI 19941994
Best of PLDI 20041992
CC 19921992
PLDI 19921992
ESOP 19901990
TAPSOFT, Vol.2: CCPSD 19911991

Wrote 23 papers:

CC-2006-XueK #fresh look #problem
A Fresh Look at PRE as a Maximum Flow Problem (JX, JK), pp. 139–154.
LCTES-2004-ScholzHK #optimisation
Optimizing for space and time usage with speculative partial redundancy elimination (BS, RNH, JK), pp. 221–230.
CC-2000-KnoopR #constant #graph
Constant Propagation on the Value Graph: Simple Constants and Beyond (JK, OR), pp. 94–109.
POPL-2000-RuthingKS
Sparse Code Motion (OR, JK, BS), pp. 170–183.
SAS-2000-KnoopCJ
Partial Redundancy Elimination on Predicated Code (JK, JFC, RDCJ), pp. 260–279.
CC-1999-KnoopRS #semantics
Expansion-Based Removal of Semantic Partial Redundancies (JK, OR, BS), pp. 91–106.
FoSSaCS-1999-EsparzaK #analysis #approach #data flow #interprocedural
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis (JE, JK), pp. 14–30.
PPoPP-1999-KnoopS #parallel #source code
Code Motion for Explicitly Parallel Programs (JK, BS), pp. 13–24.
SAS-1999-RuthingKS #detection #performance #precise
Detecting Equalities of Variables: Combining Efficiency with Precision (OR, JK, BS), pp. 232–247.
TACAS-1999-Knoop #approach #multi #paradigm
From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach (JK), pp. 360–374.
CC-1998-BraunKK #analysis #control flow #generative #named
Cool: A Control-Flow Generator for System Analysis (VB, JK, DK), pp. 306–309.
CC-1998-KnoopKS #graph #question
Basic-Block Graphs: Living Dinosaurs? (JK, DK, BS), pp. 65–79.
ESOP-1998-KnoopRS #question
Code Motion and Code Placement: Just Synonyms? (JK, OR, BS), pp. 154–169.
CC-1996-GeserKLRS #fixpoint #higher-order
Non-monotone Fixpoint Iterations to Resolve Second Order Effects (AG, JK, GL, OR, BS), pp. 106–120.
TACAS-1996-KleinKKS #automaton #program analysis
DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation (MK, JK, DK, BS), pp. 422–426.
PLDI-1995-KnoopRS #power of
The Power of Assignment Motion (JK, OR, BS), pp. 233–245.
TACAS-1995-KnoopSV #analysis #exclamation #explosion #for free #parallel
Parallelism for Free: Bitvector Analyses -> No State Explosion! (JK, BS, JV), pp. 264–289.
PLDI-1994-KnoopRS
Partial Dead Code Elimination (JK, OR, BS), pp. 147–158.
Best-of-PLDI-1992-KnoopRS92a #lazy evaluation
Lazy code motion (with retrospective) (JK, OR, BS), pp. 460–472.
CC-1992-KnoopS #interprocedural #theorem
The Interprocedural Coincidence Theorem (JK, BS), pp. 125–140.
PLDI-1992-KnoopRS #lazy evaluation
Lazy Code Motion (JK, OR, BS), pp. 224–234.
ESOP-1990-SteffenKR #graph #program transformation #representation
The Value Flow Graph: A Program Representation for Optimal Program Transformations (BS, JK, OR), pp. 389–405.
CCPSD-1991-SteffenKR #adaptation #performance #reduction
Efficient Code Motion and an Adaption to Strength Reduction (BS, JK, OR), pp. 394–415.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.