Riferimenti
[1] Alfred V. Aho, Ravi Sethi,
and Jeffrey D. Ullman. Compilers, Principles,
Techniques, and Tools. Addison-Wesley, 1986. ISBN 0-201-10088-6.
[2] David F. Bacon, Susan L.
Graham, and Oliver J. Sharp. Compiler transformations for high-performance computing. ACM
Computing Surveys, 26(4):345-420, December 1994.
[3] Shyarn R. Chidamber and Chris F. Kemerer, A metrics suite for object oriented design.
IEEE Transactions on Software Engineering, 20(6):476493, June 1994.
[4] Cristina Cifuentes and K. John Cough. Decompilation of binary programs. Software – Practice Experience, 25(7):811-829,
July 1995.
[5] Jeffrey Dean. Whole-Program Optimization of
Object-Oriented Languages. PhD thesis,
[6] James R. Gosler. Software protection: Myth or reality? In
CRYPTO'85 - Advances in Cryptology, pages 140-157, August 1985.
[7] James Gosling, Bill Joy,
and Guy Steele. The
Java Language Specification. Addison-Wesley, 1996. ISBN
0-201-63451-1.
[8] M. H. Halstead. Elements of Software Science.
Elsevier North-Holland, 1977.
[9] Warren A. Harrison and
Kenneth L Magel. A complexity measure based on nesting level.
SIGPLAN Notices, 16(3):63-74, 1981.
[10] Sallie Henry
and Dennis Kafura. Software structure metrics based on information flow. IEEE
Transactions on Software Engineering, 7(5):510-518, September 1981.
[11] Amir Herzberg and Shlomit S. Pinter. Public protection of software. ACM Transactions on Computer
systems, 5 :371-393, november 1987.
[12] Susan Horwitz. Precise
flow-insensitive May-Alias analysis is NP-hard. TOPLAS, 19(l):1-6, January
1997.
[13] Susan Horwitz, Thomas Reps, and David Hinkley.
Interprocedural slicing using dependence graphs.
TOPLAS,
[14] Neil D.
Jones. An introduction
to partial evaluation. ACM Computing Surveys, 28(3):480-503,
September 1996.
[15] Jens Knoop, Bernhard Steffen, and Jürgen Vollmer. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. TOPLAS,
18(3):268-299, May 1996.
[16] Mark D. LaDue. HoseMocha. http://www.cigital.com/hostile-applets/HoseMocha.java
, January 1997.
[17] James R.
Lyle, Dolorres R. Wallace, James R. Graham, Keith B.
Gallagher, Joseph P. Poole, and David W Binkley. Unravel: A CASE tool to assist evaluation of high integrity software.
Volume 1: Requirements and design. Technical Report NIST1R 5691,
[18] Stavros
Macrakis. Protecting
source code with ANDF, january
1993.
[19] Apple's
QuickTirne lawsuit. News 705 de maggio 95 e News 848 del giugno 95.
[20] T. J. McCabe. A complexity measure. IEEE
Transactions on Software Engineering, 2(4):308320, December 1976.
[21] John C. Munson and Taghi M. Kohshgoftaar. Measurement of data structure complexity.
Journal of Systems Software, 20:217-225, 1993.
[22] William F. Opdyke and Ralph E. Johnson. Creating abstract superclasses
by refactoring. In Stan C. Kwasny and John F. Buck, editors, Proceedings of the 21st
Annual Conference on Computer Science, pages 66-73,
[23] E. 1.
[24] G. Ramalingarn. The undecidability of aliasing.TOPLAS, 16(5):1467-1471, September
1997.
[25] Spencer Rugabei, Kurt Stirewalt, and
Linda M. Wills. The interleaving
problem in program understanding. In 2nd
Working Conference on Reverse Engineering,
[26] Pamela
Samuelson. Reverse-engineering someone
else's software: Is it legal? IEEE Software, pages 90-96, January 1990.
[27] Antero Taivalsaari. On the notion of inheritance. ACM Computing Surveys,
28(3):438-479, Septemher 1996.
[28] Frank Tip. A survey of program slicing
techniques. Journal of Programming Languages, 3(3):121-189,
September 1995.
[29] Hans Peter Van Vliet. Crema - The Java
obfuscator, January 1996.
[30] Hans Peter Van Vliet. Mocha - The Java decompiler, January 1996.
[31] Uwe G. Wilhelm. Cryptographically protected objects, 1997.
[32] Linda Mary
Wills. Automated program recognition: a
feasibility demonstration. Artificial Intelligence, 45(1-2):113-172, 1990.
[33] Michael Wolfe. High Performance Compilers For Parallel
Computing. Addison-Wesley, 1996. ISBN 0-8053-2730-4.