|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
 |
2
|
|
| |
3
|
|
| |
4
|
F. BODIN, Data structure analysis in C programs, in International Workshop on Compilers for Parallel Computers, Paris, Dec. 1990, Ecole des Mines de Paris, pp. 11-24.
|
| |
5
|
|
| |
6
|
M CAHEN, Sur Ies substitutions fondamentaIes du groupe moduIaire, Bulletin de la Societ4 Math4matique de France, 43 (191~), pp. sq-ss.
|
| |
7
|
R CA~.TWRiGHT AND D OPP~N, The logic of aIiasing, Acts Informatica, 15 (1981), pp. 365-384.
|
| |
8
|
|
| |
9
|
|
| |
10
|
Jyh-Herng Chow , William Ludwell Harrison, III, Compile-time analysis of parallel programs that share memory, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.130-141, January 19-22, 1992, Albuquerque, New Mexico, United States
[doi> 10.1145/143165.143194]
|
| |
11
|
B COURC}~LLS, Fundamental properties of infinite trees, Theoretical Computer Science, 25 (1983), pp. 95-169.
|
| |
12
|
P. COUSOT AND R. COUSOT, Static determination of dynamic properties o.f recurszve procedures, in Working Conf. on Formal Description of Programming Concepts, St-Andrews, Canada, Aug. 1977, IFIP WG 2.2, North-Holland.
|
| |
13
|
|
| |
14
|
Patrick Cousot , Radhia Cousot, Formal language, grammar and set-constraint-based program analysis by abstract interpretation, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.170-181, June 26-28, 1995, La Jolla, California, United States
[doi> 10.1145/224164.224199]
|
| |
15
|
|
| |
16
|
|
| |
17
|
|
| |
18
|
~., Operational Models of Programming Languages and Representations of Relations on Regular Languages w~th Application to the Static Determination of Dynamic AIzasing Properties of Data, PhD thesis, LIX, Ecole Polytechnique, F- 91128, Palaiseau, France, 1992.
|
| |
19
|
~, A storeIess model of aIiasing and ~ts abstractions using finite representations of right-regular equivalence relations, in Proc. of the IEEE 1992 International Conf. on Computer Languages, San Francisco, Apr. 1992, IEEE Press, pp. 2-13.
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
R GHIYA, Practlcal techniques for inter-procedural heap analyszs, Master's thesis, McGill University, Montreal, Mar. 1995.
|
| |
24
|
|
| |
25
|
R. HARPI~R) R MILNER, AND M. TOFTE, The definition o/Standard ML, LFCS Report Series ECS-LFCS-89-81, Laboratory for Foundations of Computer Science) Dept. of Computer Science, University of Edinburgh, May 1989.
|
| |
26
|
W HARRISON, The interproceduraI analysis and automatic paraIleIisation o/Scheme programs, Lisp and Symbolic Computalion, 2 (1989), pp. 176-396.
|
| |
27
|
L. H~DI~RMAN, Compile time garbage collection, Master's thesis, Rice University, Aug. 1988. COMP TR88-75.
|
| |
28
|
|
| |
29
|
|
| |
30
|
|
| |
31
|
|
| |
32
|
R HUGHES, Backwards analysis o/ .functional programs, in Proc. Workshop on Partial Evaluation and Mixed Computation, D. Bjorner, A. Ershov, and N. Jones, eds., North-Holland, Oct. 1987, pp. 155-169.
|
| |
33
|
Joseph Hummel , Laurie J. Hendren , Alexandru Nicolau, A general data dependence test for dynamic, pointer-based data structures, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.218-229, June 20-24, 1994, Orlando, Florida, United States
|
| |
34
|
|
| |
35
|
T. Ji~NSI~N, Abstract interpretation over algebraic data types, in 1994 International Conference on Computer Languages, Toulouse, France, May 16-19 1994, IEEE Computer Society Press, pp. 265-276.
|
| |
36
|
N JONES, Flow analysis o-f Iambda ezpressions, in Symp. on Functional Languages and Computer Architecture, GLteborg, Sweden, June 1981, Chalmers Univ, of Technology, pp. 376-401.
|
| |
37
|
N JONSS AND S MUCHNICK, Flow analysis and optimization of Lisp-like structures, in Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, eds., New Jersey, 1981, Prentice-Hall, pp. 102-131.
|
| |
38
|
|
| |
39
|
H .}ONK~RS, Abstract storage structures, in Algorithmic Languages, d~ Bakker and van Vlict, eds., IFIP, North Holland, 1981, pp. 321-343.
|
| |
40
|
|
| |
41
|
|
| |
42
|
|
| |
43
|
|
| |
44
|
|
| |
45
|
|
| |
46
|
|
| |
47
|
|
| |
48
|
|
| |
49
|
|
| |
50
|
J LAUNCHBURY, Projection Factorisations in Partial Evaluation, PhD thesis, University of Glasgow, 1989.
|
| |
51
|
|
| |
52
|
F MASDUPUY, Uszng abstract ~nterpretation to detect array data dependencies, in Proc. of the International Symp. on Supercomputing, Fukuoka, Nov. 1991, Kyushu University Press, pp. 19-27. ISBN 4-87378-284-8.
|
| |
53
|
I. MASON AND C TALCOTT, References, local variables and operational reasoning, in Proc. of the 7th Annual IEEE Syrup. on Logic in Computer Science, June 1992, pp. 186-197.
|
| |
54
|
|
| |
55
|
T MOG~NSI~N, Partially static structures ~n a self-applicable partial evaIuator, in Workshop on Partial Evaluation and Mixed Computation, D. Bj0rner, A. Ershov, and N. Jones, eds., North Holland, Oct. 1987, pp. 325-347.
|
| |
56
|
|
| |
57
|
Greg Morrisett , Matthias Felleisen , Robert Harper, Abstract models of memory management, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.66-77, June 26-28, 1995, La Jolla, California, United States
[doi> 10.1145/224164.224182]
|
| |
58
|
|
| |
59
|
|
| |
60
|
|
| |
61
|
|
| |
62
|
|
| |
63
|
|
| |
64
|
J R~YNOLDS, Automatzc computation o-f data set definitions, in Proc. of IFIP Congress 68, Aug. 1968, pp. B69-B73.
|
| |
65
|
|
| |
66
|
|
| |
67
|
A SCHLNHAG~, Storage modification machines, SIAM J. Cornput., 9 (1980), pp. 490-508.
|
| |
68
|
|
| |
69
|
M SHARIR AND A. PNUSLI, Two approaches to interproceduraI data flow analysis, in Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, eds., Prentice-Hall, 1981, pp. 189-234.
|
| |
70
|
|
| |
71
|
~, Control-flow Analysis o-f Higher-Order Languages, PhD thesis, Carnegie Mellon University, Pittsburgh, May 1991. CMU-CS-91-145.
|
| |
72
|
|
| |
73
|
J. TALPm AND P. JOUV~LOT, The type and effect d~sc~pline, in Seventh Annual IEEE Symp. on Logic in Computer Science, 1992.
|
| |
74
|
R. TENNI~NT, Semantics of ~nterference control, Theoretical Computer Science, 27 (1983), pp. 297-310.
|
| |
75
|
|
| |
76
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.3