-
1
-
-
0024138013
-
Minimizing communication for synchronizing parallel dataflow programs
-
St. Charles, IL, 1988. University Park, PA: Pennsylvania State University Press
-
Badger, L., Weiser, M.: Minimizing communication for synchronizing parallel dataflow programs. In Proc. 1988 Int. Conf. on Parallel Processing, St. Charles, IL, 1988. University Park, PA: Pennsylvania State University Press 1988
-
(1988)
Proc. 1988 Int. Conf. on Parallel Processing
-
-
Badger, L.1
Weiser, M.2
-
2
-
-
84956676262
-
The program summary graph and flow-sensitive interprocedural data flow analysis
-
Proc. ACM SIGPLAN 88 Conf. on Programming Language Design and Implementation, Atlanta, GA, 1988.
-
Callahan, D.: The program summary graph and flow-sensitive interprocedural data flow analysis. Proc. ACM SIGPLAN 88 Conf. on Programming Language Design and Implementation, Atlanta, GA, 1988. ACM SIGPLAN Notices 23 (7), 47-56 (1988)
-
(1988)
ACM SIGPLAN Notices
, vol.23
, Issue.7
, pp. 47-56
-
-
Callahan, D.1
-
3
-
-
0003199138
-
Attribute grammars: Definitions, systems and bibliography
-
New York: Springer
-
Deransart, P., Jourdan, M., Lorho, B.: Attribute Grammars: Definitions, Systems and Bibliography (Lecture Notes in Comput. Sci., Vol. 323). New York: Springer 1988
-
(1988)
Lecture Notes in Comput. Sci.
, vol.323
-
-
Deransart, P.1
Jourdan, M.2
Lorho, B.3
-
4
-
-
0021450319
-
On the sequential nature of unification
-
Dwork, C., Kanellakis, P.C., Mitchell, J.C.: On the sequential nature of unification. J. Logic Program. 1, 35-50 (1984)
-
(1984)
J. Logic Program.
, vol.1
, pp. 35-50
-
-
Dwork, C.1
Kanellakis, P.C.2
Mitchell, J.C.3
-
5
-
-
0023385308
-
The program dependence graph and its use in optimization
-
Ferrante, J., Ottenstein, K., Warren, J.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9 (3), 319-349 (1987)
-
(1987)
ACM Trans. Program. Lang. Syst.
, vol.9
, Issue.3
, pp. 319-349
-
-
Ferrante, J.1
Ottenstein, K.2
Warren, J.3
-
6
-
-
0002711066
-
The monotone and planar circuit value problems are log-space comnplete for P
-
Goldschlager, L.: The monotone and planar circuit value problems are log-space comnplete for P. ACM SIGACT News 9 (2), 25-29 (1977)
-
(1977)
ACM SIGACT News
, vol.9
, Issue.2
, pp. 25-29
-
-
Goldschlager, L.1
-
7
-
-
85032174393
-
Fast left-linear semi-unification
-
Proc. Int. Conf. on Computing and Information, 1990. New York: Springer
-
Henglein, F.: Fast left-linear semi-unification. In Proc. Int. Conf. on Computing and Information, 1990 (Lecture Notes in Computer Science, Vol. 468, pp. 82-91). New York: Springer 1990
-
(1990)
Lecture Notes in Computer Science
, vol.468
, pp. 82-91
-
-
Henglein, F.1
-
8
-
-
0024700474
-
Integrating non-interfering versions of programs
-
Horwitz, S., Prins, J., Reps, T.: Integrating non-interfering versions of programs. ACM Trans. Program. Lang. Syst. 11 (3), 345-387 (1989)
-
(1989)
ACM Trans. Program. Lang. Syst.
, vol.11
, Issue.3
, pp. 345-387
-
-
Horwitz, S.1
Prins, J.2
Reps, T.3
-
9
-
-
0025228221
-
Interprocedural slicing using dependence graphs
-
Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12 (1), 26-60 (1990)
-
(1990)
ACM Trans. Program. Lang. Syst.
, vol.12
, Issue.1
, pp. 26-60
-
-
Horwitz, S.1
Reps, T.2
Binkley, D.3
-
10
-
-
0024127001
-
Finding program slices for recursive procedures
-
Chicago, IL, 1988. Washington, DC: IEEE Computer Society
-
Hwang, J.C., Du, M.W., Chou, C.R.: Finding program slices for recursive procedures. In Proc. IEEE COMPSAC 88, Chicago, IL, 1988. Washington, DC: IEEE Computer Society 1988
-
(1988)
Proc. IEEE COMPSAC 88
-
-
Hwang, J.C.1
Du, M.W.2
Chou, C.R.3
-
11
-
-
49549127781
-
Complete problems for deterministic polynomial time
-
Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theoret. Comput. Sci. 3, 105-117 (1977)
-
(1977)
Theoret. Comput. Sci.
, vol.3
, pp. 105-117
-
-
Jones, N.D.1
Laaser, W.T.2
-
12
-
-
0000028408
-
Ordered attribute grammars
-
Kastens, U.: Ordered attribute grammars. Acta Inform. 13 (3), 229-256 (1980)
-
(1980)
Acta Inform.
, vol.13
, Issue.3
, pp. 229-256
-
-
Kastens, U.1
-
13
-
-
0017271712
-
Automatic generation of efficient evaluators for attribute grammars
-
Atlanta, GA, New York: ACM 1976
-
Kennedy, K., Warren, S.K.: Automatic generation of efficient evaluators for attribute grammars. In Conf. Record of the Third ACM Symp. on Principles of Programming Languages, Atlanta, GA, pp. 32-49, 1976. New York: ACM 1976
-
(1976)
Conf. Record of the Third ACM Symp. on Principles of Programming Languages
, pp. 32-49
-
-
Kennedy, K.1
Warren, S.K.2
-
15
-
-
84976754093
-
The interprocedural coincidence theorem
-
Proc. Fourth Int. Conf. on Compiler Construction, Paderborn, FRG, 1992, ed. U. Kastens and P. Pfahler. New York: Springer
-
Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In Proc. Fourth Int. Conf. on Compiler Construction, Paderborn, FRG, 1992 (Lecture Notes in Computer Science, Vol. 641, ed. U. Kastens and P. Pfahler). New York: Springer 1992
-
(1992)
Lecture Notes in Computer Science
, vol.641
-
-
Knoop, J.1
Steffen, B.2
-
16
-
-
85027612984
-
Dependence graphs and compiler optimizations
-
Willamsburg, VA, New York: ACM 1981
-
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., Wolfe, M.: Dependence graphs and compiler optimizations. In Conf. Record of the Eighth ACM Symp. on Principles of Programming Languages, pp. 207-218. Willamsburg, VA, 1981. New York: ACM 1981
-
(1981)
Conf. Record of the Eighth ACM Symp. on Principles of Programming Languages
, pp. 207-218
-
-
Kuck, D.J.1
Kuhn, R.H.2
Leasure, B.3
Padua, D.A.4
Wolfe, M.5
-
17
-
-
85021863308
-
Pointer-induced aliasing: A problem classification
-
Orlando, FL, New York: ACM 1991
-
Landi, W., Ryder, B.G.: Pointer-induced aliasing: A problem classification. In Conf. Record of the Eighteenth ACM Symp. on Principles of Programming Languages, Orlando, FL, pp. 93-101, 1991. New York: ACM 1991
-
(1991)
Conf. Record of the Eighteenth ACM Symp. on Principles of Programming Languages
, pp. 93-101
-
-
Landi, W.1
Ryder, B.G.2
-
18
-
-
0026987136
-
A safe approximate algorithm for interprocedural pointer aliasing
-
Proc. ACM SIGPLAN 92 Conf. on Programming Language Design and Implementation, San Farncisco, CA, 1991.
-
Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural pointer aliasing. Proc. ACM SIGPLAN 92 Conf. on Programming Language Design and Implementation, San Farncisco, CA, 1991. ACM SIGPLAN Notices 27 (7), 235-248 (1992)
-
(1992)
ACM SIGPLAN Notices
, vol.27
, Issue.7
, pp. 235-248
-
-
Landi, W.1
Ryder, B.G.2
-
19
-
-
0027830142
-
Interprocedural modification side effect analysis with pointer aliasing
-
Albuquerque, NM, New York: ACM 1993
-
Landi, W., Ryder, B.G., Zhang, S.: Interprocedural modification side effect analysis with pointer aliasing. In Proc. ACM SIGPLAN 93 Conf. on Programming Language Design and Implementation, Albuquerque, NM, pp. 56-67, 1993. New York: ACM 1993
-
(1993)
Proc. ACM SIGPLAN 93 Conf. on Programming Language Design and Implementation
, pp. 56-67
-
-
Landi, W.1
Ryder, B.G.2
Zhang, S.3
-
22
-
-
85030836096
-
Grammar flow analysis
-
International Summer School SAGA, Prague, Czechoslovakia
-
Möncke, U., Wilhelm, R.: Grammar flow analysis. In Attribute Grammars, Applications and Systems, International Summer School SAGA, Prague, Czechoslovakia, pp. 151-186, 1991. (Lectures in Comput. Sci., Vol. 545, ed. H. Alblas and B. Melichar). New York: Springer 1991
-
(1991)
Attribute Grammars, Applications and Systems
, pp. 151-186
-
-
Möncke, U.1
Wilhelm, R.2
-
23
-
-
85030836096
-
-
New York: Springer
-
Möncke, U., Wilhelm, R.: Grammar flow analysis. In Attribute Grammars, Applications and Systems, International Summer School SAGA, Prague, Czechoslovakia, pp. 151-186, 1991. (Lectures in Comput. Sci., Vol. 545, ed. H. Alblas and B. Melichar). New York: Springer 1991
-
(1991)
Lectures in Comput. Sci.
, vol.545
-
-
Alblas, H.1
Melichar, B.2
-
25
-
-
84976707537
-
The program dependence graph in a software development environment
-
Proc. ACM SIGSOFT/SIGPLAN Software Engineering Symp. on Practical Software Development Environments, Pittsburgh, PA, 1984.
-
Ottenstein, K.J., Ottenstein, L.M.: The program dependence graph in a software development environment. Proc. ACM SIGSOFT/SIGPLAN Software Engineering Symp. on Practical Software Development Environments, Pittsburgh, PA, 1984. ACM SIGPLAN Notices 19 (5), 177-184 (1984)
-
(1984)
ACM SIGPLAN Notices
, vol.19
, Issue.5
, pp. 177-184
-
-
Ottenstein, K.J.1
Ottenstein, L.M.2
-
27
-
-
0028510908
-
The undecidability of aliasing
-
Ramalingam, G.: The undecidability of aliasing. ACM Trans. Program. Lang. Syst. 16 (5), 1476-1471 (1994)
-
(1994)
ACM Trans. Program. Lang. Syst.
, vol.16
, Issue.5
, pp. 1476-11471
-
-
Ramalingam, G.1
-
28
-
-
84963539896
-
Speeding up slicing
-
SIGSOFT 94: Proc. Second ACM SIGSOFT Symp. on the Foundations of Software Engineering, New Orleans, LA, 1994
-
Reps, T., Horwitz, S., Sagiv, M., Rosay, G.: Speeding up slicing, SIGSOFT 94: Proc. Second ACM SIGSOFT Symp. on the Foundations of Software Engineering, New Orleans, LA, 1994, ACM SIGSOFT Software Engineering Notes 19 (5), 11-20 (1994)
-
(1994)
ACM SIGSOFT Software Engineering Notes
, vol.19
, Issue.5
, pp. 11-20
-
-
Reps, T.1
Horwitz, S.2
Sagiv, M.3
Rosay, G.4
-
29
-
-
0003638217
-
Demand interprocedural program analysis using logic databases
-
R. Ramakrishnan (ed.) Boston, MA: Kluwer Academic Publishers
-
Reps, T.: Demand interprocedural program analysis using logic databases. In R. Ramakrishnan (ed.) Applications of Logic Databases, pp. 163-196. Boston, MA: Kluwer Academic Publishers 1994
-
(1994)
Applications of Logic Databases
, pp. 163-196
-
-
Reps, T.1
-
30
-
-
0029180939
-
Precise interprocedural dataflow analysis via graph reachability
-
San Francisco, CA, New York: ACM 1995
-
Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In Conf. Record of the Twenty-Second ACM Symp. on Principles of Programming Languages, San Francisco, CA, pp. 49-61, 1995. New York: ACM 1995
-
(1995)
Conf. Record of the Twenty-second ACM Symp. on Principles of Programming Languages
, pp. 49-61
-
-
Reps, T.1
Horwitz, S.2
Sagiv, M.3
-
31
-
-
84976805609
-
Logic and logic programming
-
Robinson, J.A.: Logic and logic programming. Comm. ACM 35 (3), 40-65 (1992)
-
(1992)
Comm. ACM
, vol.35
, Issue.3
, pp. 40-65
-
-
Robinson, J.A.1
-
32
-
-
84957653937
-
Precise interprocedural dataflow analysis with applications to constant propagation
-
M.I. Schwartzbach (ed.) Proc. FASE 95: Colloquium on Formal Approaches in Software Engineering. Aarhus, Denmark, 1995. New York: Springer
-
Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. In M.I. Schwartzbach (ed.) Proc. FASE 95: Colloquium on Formal Approaches in Software Engineering. Aarhus, Denmark, 1995. (Lecture Notes in Comput. Sci. Vol. 915) New York: Springer 1995
-
(1995)
Lecture Notes in Comput. Sci.
, vol.915
-
-
Sagiv, M.1
Reps, T.2
Horwitz, S.3
-
33
-
-
0002823436
-
Two approaches to interprocedural data flow analysis
-
S.S. Muchnick and N.D. Jones (eds.) Englewood Cliffs, NJ: Prentice-Hall
-
Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones (eds.) Program Flow Analysis: Theory and Applications, pp. 189-233. Englewood Cliffs, NJ: Prentice-Hall 1981
-
(1981)
Program Flow Analysis: Theory and Applications
, pp. 189-233
-
-
Sharir, M.1
Pnueli, A.2
-
34
-
-
0021095647
-
Reconstructing sequential behavior from parallel behavior projections
-
Weiser, M.: Reconstructing sequential behavior from parallel behavior projections. Inform. Process. Lett. 17, 129-135 (1983).
-
(1983)
Inform. Process. Lett.
, vol.17
, pp. 129-135
-
-
Weiser, M.1
|