|
СТ |
Portial Redundancy Elimination on Predicated Code |
2000 |
Knoop J., Collard J. -F., Ju R. D. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
19.08.2000 |
|
СТ |
Sparse Code Motion |
2000 |
Ruthing O., Knoop J., Steffen B. |
|
|
|
Papers Presented at the 27th ACM SIGPLAN-SIGACT Symp. on Pinciples of Programming Languages |
05.06.2000 |
|
СТ |
Constant Propagation on the Value Graph: Simple Constants and Beyond |
2000 |
Knoop J., Ruthing O. |
|
|
|
Lecture Notes in Computer Science |
22.04.2000 |
|
П |
Constant Propagation in Explicitly Parallel Programs |
1998 |
Knoop J. |
|
|
Univ.Passau |
|
24.03.2000 |
|
СТ |
Code Motion for Explicitly Parallel Programs |
1999 |
Knoop J., Steffen B. |
|
|
|
SIGPLAN Notices |
20.12.1999 |
|
СТ |
Optimization Under the Perspective of Soundness, Completeness, and Reusability |
1999 |
Knoop J., Ruthing O. |
|
|
|
Lecture Notes in Computer Science |
20.11.1999 |
|
СТ |
Parallel Data-Flow Analysis of Explicitly Parallel Programs |
1999 |
Knoop J. |
|
|
|
Lecture Notes in Computer Science |
19.11.1999 |
|
СТ |
From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach |
1999 |
Knoop J. |
|
|
|
Lecture Notes in Computer Science |
08.04.1999 |
|
СТ |
Expansion-Based Removal of Semantic Partial Redundancies |
1999 |
Knoop J., Ruthing O., Steffen B. |
|
|
|
Lecture Notes in Computer Science |
02.04.1999 |
|
СТ |
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis |
1999 |
Esparza J., Knoop J. |
|
|
|
Lecture Notes in Computer Science |
02.04.1999 |
|
П |
Constraint Propagation in Explicitly Parallel Programs |
1998 |
Knoop J. |
Lecture Notes in Computer Science |
|
Univ.Passau |
|
07.01.1999 |
|
М |
Optimal Interprocedural Program Optimization: A New Framework and Its Application |
1998 |
Knoop J. |
Lecture Notes in Computer Science |
|
|
|
04.11.1998 |
|
СТ |
Parallel Constant Propagation |
1998 |
Knoop J. |
|
|
|
Lecture Notes in Computer Science |
17.10.1998 |
|
П |
Cool: A Control-flow Generator for System Analysis |
1998 |
Braun V., Knoop J., Koschutzki D. |
|
|
Univ.Passau |
|
08.07.1998 |
|
П |
Basic-block Graphs: Living Denosaurs? |
1997 |
Knoop J., Koschutzki D., Steffen B. |
|
|
Univ.Passau |
|
30.04.1998 |
|
СТ |
Code Motion and Code Placement: Just Synonyms? |
1998 |
Knoop J., Ruthing O., Steffen B. |
|
|
|
Lecture Notes in Computer Science |
17.04.1998 |
|
СТ |
Basic-Block Graphs: Living Dinosaurs? |
1998 |
Knoop J., Koschutzki D., Steffen B. |
|
|
|
Lecture Notes in Computer Science |
17.04.1998 |
|
П |
Eliminating Partially Dead Code in Explicitly Parallel Programs |
1996 |
Knoop J. |
|
|
Univ.Passau |
|
22.05.1997 |
|
П |
Precise Type Analysis by Abstract Interpretation |
1996 |
Knoop J., Golubski W. |
|
|
Univ.Passau |
|
22.05.1997 |
|
П |
Eliminiting Partially Dead Code in Explicitly Parallel Programs |
1996 |
Knoop J. |
|
|
Univ.Passau |
|
24.04.1997 |
|
СТ |
Non-monotone Fixpoint Iterations to Resolve Second Order Effects |
1996 |
Geser A., Knoop J., Luttgen G., Ruthing O., Steffen B. |
|
|
|
Lecture Notes in Computer Science |
21.05.1996 |
|
СТ |
Parallelism for Free: Bitvector Analyses => No State Explosion! |
1995 |
Knoop J., Steffen B., Vollmer J. |
|
|
|
Lecture Notes in Computer Science |
11.01.1996 |
|
П |
Optimal Code Motion for Parallel Programs |
1995 |
Knoop J., Steffen B., Vollmer J. |
|
|
Univ.Passau |
|
21.12.1995 |
|
СТ |
The Fixpoint-Analysis Machine |
1995 |
Steffen B., Classen A., Klein M., Knoop J., Margaria T. |
Lecture Notes in Computer Science |
|
|
CONCUR 95: Concurrency Theory |
14.10.1995 |
|
СТ |
The Power of Assignment Motion |
1995 |
Knoop J., Ruthing O., Steffen B. |
|
|
|
ACM SIGPLAN Notices |
14.09.1995 |
|
П |
Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs |
1994 |
Knoop J., Steffen B., Vollmer J. |
|
|
Univ.Passau |
|
31.01.1995 |
|
П |
A Tool Kit for Constructing Optimal Interprocedural Data Flow Analyses |
1994 |
Knoop J., Ruthing O., Steffen B. |
|
|
Univ.Passau |
|
31.01.1995 |
|
П |
Chaotic Fixed Point Iterations |
1994 |
Geser A., Knoop J., Luttgen G., Steffen B., Ruthing O. |
|
|
Univ.Passau |
|
28.01.1995 |
|
СТ |
Partial Dead Code Elimination |
1994 |
Knoop J., Ruthing O., Steffen B. |
|
|
|
SIGPLAN Notices |
22.08.1994 |
|
П |
Optimal Code Motion: Theory and Practice |
1993 |
Knoop J., Ruthing O., Steffen B. |
|
|
Univ.Passau |
|
06.04.1994 |
|
СТ |
The Interprocedural Coincidence Theorem |
1992 |
Knoop J., Steffen B. |
|
|
|
Lecture Notes in Computer Science |
27.10.1992 |
|
СТ |
Improving the Performance of Parallel LISP by Compile Time Analysis |
1992 |
Knoop J. |
|
|
|
Lecture Notes in Computer Science |
27.10.1992 |
|
СТ |
Lazy Code Motion |
1992 |
Knoop J., Ruthing O., Steffen B. |
|
|
|
SIGPLAN Notices |
14.07.1992 |
