-
2
-
-
0003138853
-
VFC: The Vienna Fortran Compiler
-
December
-
S. Benkner. VFC: The Vienna Fortran Compiler. Journal of Scientific Programming, 7(1):67-81, December 1999.
-
(1999)
Journal of Scientific Programming
, vol.7
, Issue.1
, pp. 67-81
-
-
Benkner, S.1
-
3
-
-
0011610818
-
-
October
-
S. Benkner, S. Andel, R. Blasko, P. Brezany, A. Celic, B. Chapman, M. Egg, T. Fahringer, J. Hulman, Y. Hou, E. Kelc, E. Mehofer, H. Moritsch, M. Paul, K. Sanjari, V. Sipkova, B. Velkov, B. Wender, and H. Zima. Vienna Fortran Compilation System - Version 2.0 - User's Guide, October 1995.
-
(1995)
Vienna Fortran Compilation System - Version 2.0 - User's Guide
-
-
Benkner, S.1
Andel, S.2
Blasko, R.3
Brezany, P.4
Celic, A.5
Chapman, B.6
Egg, M.7
Fahringer, T.8
Hulman, J.9
Hou, Y.10
Kelc, E.11
Mehofer, E.12
Moritsch, H.13
Paul, M.14
Sanjari, K.15
Sipkova, V.16
Velkov, B.17
Wender, B.18
Zima, H.19
-
4
-
-
0031372538
-
Path profile guided partial dead code elimination using predication
-
San Francisco, California, November
-
R. Gupta, D. Berson, and J. Fang. Path profile guided partial dead code elimination using predication. In International Conference on Parallel Architectures and Compilation Techniques (PACT'97), pages 102-115, San Francisco, California, November 1997.
-
(1997)
International Conference on Parallel Architectures and Compilation Techniques (PACT'97)
, pp. 102-115
-
-
Gupta, R.1
Berson, D.2
Fang, J.3
-
5
-
-
0031627691
-
Path profile guided partial redundancy elimination using speculation
-
Chicago, Illinois, May
-
R. Gupta, D. Berson, and J. Fang. Path profile guided partial redundancy elimination using speculation. In IEEE International Conference on Computer Languages, pages 230-239, Chicago, Illinois, May 1998.
-
(1998)
IEEE International Conference on Computer Languages
, pp. 230-239
-
-
Gupta, R.1
Berson, D.2
Fang, J.3
-
11
-
-
24244467364
-
-
Technical Report Institute for Software Technology and Parallel Systems, University of Vienna, Austria, December
-
E. Mehofer and H. Zima. Distribution assignment placement. Technical Report TR 96-5, Institute for Software Technology and Parallel Systems, University of Vienna, Austria, December 1996.
-
(1996)
Distribution Assignment Placement
-
-
Mehofer, E.1
Zima, H.2
-
13
-
-
0029180939
-
Precise interprocedural dataflow analysis via graph reachability
-
San Francisco, CA, January
-
T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the ACM Symposium on Principles of Programming Languages (POPL'95), pages 49-61, San Francisco, CA, January 1995.
-
(1995)
Proc. of the ACM Symposium on Principles of Programming Languages (POPL'95)
, pp. 49-61
-
-
Reps, T.1
Horwitz, S.2
Sagiv, M.3
-
14
-
-
0032010237
-
A new framework for elimination-based data flow analysis using DJ graphs
-
Mar
-
V. C. Sreedhar, G. R. Gao, and Y.-F. Lee. A new framework for elimination-based data flow analysis using DJ graphs. ACM Transactions on Programming Languages and Systems, 20(2):388-435, Mar. 1998.
-
(1998)
ACM Transactions on Programming Languages and Systems
, vol.20
, Issue.2
, pp. 388-435
-
-
Sreedhar, V.C.1
Gao, G.R.2
Lee, Y.-F.3
|