Manufacturing cheap, resilient, and stealthy opaque constructs

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	David F. Bacon , Susan L. Graham , Oliver J. Sharp, Compiler transformations for high-performance computing, ACM Computing Surveys (CSUR), v.26 n.4, p.345-420, Dec. 1994 [doi>10.1145/197405.197406]
	3	David R. Chase , Mark Wegman , F. Kenneth Zadeck, Analysis of pointers and structures, ACM SIGPLAN Notices, v.25 n.6, p.296-310, Jun. 1990
	4	S. R. Chidamber , C. F. Kemerer, A Metrics Suite for Object Oriented Design, IEEE Transactions on Software Engineering, v.20 n.6, p.476-493, June 1994 [doi>10.1109/32.295895]
	5	Cristina Cifuentes , K. John Gough, Decompilation of binary programs, Software—Practice & Experience, v.25 n.7, p.811-829, July 1995 [doi>10.1002/spe.4380250706]
	6	Christian CoUberg, Clark Thomborson, and Douglas Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland, July t997. http://Waw.cs.auckland.ac.nz/'collberg/ Research/Publica~ions/CollbergThomborsonLow97a.
	7	Alain Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.230-241, June 20-24, 1994, Orlando, Florida, United States
	8	Rakesh Ghiya , Laurie J. Hendren, Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-15, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237724]
	9	James R Gosler, Software protection: myth or reality?, Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85, p.140-157, June 1986, Santa Barbara, California, United States
	10	James Gosling , Bill Joy , Guy L. Steele, The Java Language Specification, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1996
	11	Warren A. Harrison , Kenneth I. Magel, A complexity measure based on nesting level, ACM SIGPLAN Notices, v.16 n.3, p.63-74, March 1981 [doi>10.1145/947825.947829]
	12	L. J. Hendren , A. Nicolau, Parallelizing Programs with Recursive Data Structures, IEEE Transactions on Parallel and Distributed Systems, v.1 n.1, p.35-47, January 1990 [doi>10.1109/71.80123]
	13	SaUie Henry and Dennis Kafura, Software structure metrics based on information flow. IEEE flunsae, ~ions on Software Engineering, 7(5):510-518, September 198t.
	14	Amir Herzberg , Shlomit S. Pinter, Public protection of software, ACM Transactions on Computer Systems (TOCS), v.5 n.4, p.371-393, Nov. 1987 [doi>10.1145/29868.29872]
	15	Jens Knoop , Bernhard Steffen , Jürgen Vollmer, Parallelism for free: efficient and optimal bitvector analyses for parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.3, p.268-299, May 1996 [doi>10.1145/229542.229545]
	16	Stavros Macrakis. Protecting source code with ANDF. fl:p:/Iriftp, osf.orglpublandf/andf_coll. papers/Pro1~ectingSourceCode.ps, January 1993.
	17	Apple's QuickTime lawsuit, h~tp://vw~, macworld, com/pages/j une. 95/Ne~s. 848. html and may.95/Ne~s.705.ht~1, May-June 1995.
	18	Thomas J. McCabe, A complexity measure, Proceedings of the 2nd international conference on Software engineering, p.407, October 13-15, 1976, San Francisco, California, United States
	19	John C. Munson , Taghi M. Khoshgoftaar, Measurement of data structure complexity, Journal of Systems and Software, v.20 n.3, p.217-225, March 1993 [doi>10.1016/0164-1212(93)90065-6]
	20	E. I. Oviedo. Control flow, data flow, and program complexity. In Proceedings of IEEE COMPSA C, pages 146-152, November 1980.
	21	Todd A. Proebsting and Scott A. Watterson. Krakatou: Decompilation in java (Does bytecode reveal source?), In Third USENIX Conference on Object-Oriented Tech. nologies and Systems {COOTS), June 1997.
	22	G. Ramalingam, The undecidability of aliasing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1467-1471, Sept. 1994 [doi>10.1145/186025.186041]
	23	Pamela Samuelson, Reverse-Engineering Someone Else's Software: Is It Legal?, IEEE Software, v.7 n.1, p.90-96, January 1990 [doi>10.1109/52.43054]
	24	Frank Tip. A survey of program slicing techniques, Journal of Programming Languages, 3(3):121-189, September 1995.
	25	Robert Totksdoff. Programming languages for the Java virtual machine, 1997. ht~p://grunge, cs. ~u-berlln. de/" to Ik/vmlanguage s. html.
	26	Hans Peter Van Viler. Cretan- The Java obfuscator, http://~eb, inter, nl .net/users/H.P. van. Vliot/crema.html, January 1996.
	27	Uwe G. Wilhelm. Cryptographically protected objects. In RenPar'9, May 1997. http://lse,uw.opfl, ch/'wilhelm/CryPO, html.