Question

参考书目

[AC72]	F.E. Allen and J. Cocke. Graph theoretic constructs for program control flow analysis. Technical Report RC 3923 (No. 17789), IBM, Thomas J. Watson Research Center, Yorktown Heights, New York, July 1972.
[AC76]	F.E. Allen and J. Cocke. A program data flow analysis procedure. Communications of the ACM, 19(3):137-147, March 1976.
[All70]	F.E. Allen. Control flow analysis. SIGPLAN Notices, 5(7):1-19, July 1970.
[All72]	F.E. Allen. A basis for program optimization. In Proc. IFIP Congress, pages 385-390, Amsterdam, Holland, 1972. North-Holland Pub.Co.
[All74]	F.E. Allen. Interprocedural data flow analysis. In Proc. IFIP Congress, pages 398-402, Amsterdam, Holland, 1974. North-Holland Pub.Co.
[AM71]	E. Ashcroft and Z. Manna. The translation of 'go to' programs to 'while' programs. Technical report, Stanford University, Department of Computer Science, 1971.
[ASU86a]	A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Publishing Company, 1986.
[ASU86b]	A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools, chapter 10, pages 585-722. Addison-Wesley Publishing Company, 1986.
[Bak77]	B.S. Baker. An algorithm for structuring flowgraphs. Journal of the ACM, 24(1):98-120, January 1977.
[Bar74]	P. Barbe. The Piler system of computer program translation. Technical report, Probe Consultants Inc., September 1974.
[BB91]	J. Bowen and P. Breuer. Decompilation techniques. Internal to ESPRIT REDO project no. 2487 2487-TN-PRG-1065 Version 1.2, Oxford University Computing Laboratory, 11 Keble Road, Oxford OX1 3QD, March 1991.
[BB92]	P.T. Breuer and J.P. Bowen. Decompilation: The enumeration of types and grammars. Technical Report PRG-TR-11-92, Oxford University Computing Laboratory, 11 Keble Road, Oxford OX1 3QD, 1992.
[BB93]	P.T. Breuer and J.P. Bowen. Decompilation: the enumeration of types and grammars. To appear in Transaction of Programming Languages and Systems, 1993.
[BB94]	P.T. Breuer and J.P. Bowen. Generating decompilers. To appear in Information and Software Technology Journal, 1994.
[BBL91]	J.P. Bowen, P.T. Breuer, and K.C. Lano. The REDO project: Final report. Technical Report PRG-TR-23-91, Oxford University Computing Laboratory, 11 Keble Road, Oxford OX1 3QD, December 1991.
[BBL93]	J. Bowen, P. Breuer, and K. Lano. A compendium of formal techniques for software maintenance. Software Engineering Journal, pages 253-262, September 1993.
[BJ66]	C. Bohm and G. Jacopini. Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM, 9(5):366-371, May 1966.
[Bor92]	Borland. Borland C++ Version 3.1 - User's Guide. Borland International, 1800 Green Hills Road, Scotts Valley, CA 95066, 1992.
[Bow91]	J. Bowen. From programs to object code using logic and logic programming. In R. Giegerich and S.L. Graham, editors, Code Generation - Concepts, Tools, Techniques, Workshops in Computing, pages 173-192, Dagstuhl, Germany, May 1991. Springer Verlag.
[Bow93]	J. Bowen. From programs to object code and back again using logic programming: Compilation and decompilation. Journal of Software Maintenance: Research and Practice, 5(4):205-234, 1993.
[BP79]	D. Balbinot and L. Petrone. Decompilation of Polish code in Basic. Rivista di Informatica, 9(4):329-335, October 1979.
[BP81]	M.N. Bert and L. Petrone. Decompiling context-free languages from their Polish-like representations. pages 35-57, 1981.
[Bri81]	D.L. Brinkley. Intercomputer transportation of assembly language software through decompilation. Technical report, Naval Underwater Systems Center, October 1981.
[Bri93]	Brillo brillig. EXE, 8(5):6, October 1993.
[BZ80]	A.L. Baker and S.H. Zweben. A comparison of measures of control flow complexity. IEEE Transactions on Software Engineering, SE-6(6):506-512, November 1980.
[Cal]	C.A. Calkins. Masterful disassembler. Public domain software. Anonymous ftp oak.oakland.edu:SimTel/msdos/disasm/md86.zip.
[CCHK90]	D. Callahan, A. Carle, M.W. Hall, and K. Kennedy. Constructing the procedure call multigraph. IEEE Transactions on Software Engineering, 16(4):483-487, April 1990.
[CG93]	C. Cifuentes and K.J. Gough. A methodology for decompilation. In Proceedings of the XIX Conferencia Latinoamericana de Informatica, pages 257-266, Buenos Aires, Argentina, 2-6 August 1993. Centro Latinoamericano de Estudios en Informatica.
[CG94]	C. Cifuentes and K.J Gough. Decompilation of binary programs. Technical Report 3/94, Faculty of Information Technology, Queensland University of Technology, GPO Box 2434, Brisbane 4001, Australia, April 1994. (To appear in 1995, Software - Practice & Experience).
[Chr80]	W. Christensen. Resource for the 8086. Public domain software. Anonymous ftp oak.oakland.edu:SimTel/msdos/disasm/res86.zip, 1980. Translated to the 8086 by Larry Etienne.
[Cif93]	C. Cifuentes. A structuring algorithm for decompilation. In Proceedings of the XIX Conferencia Latinoamericana de Informatica, pages 267-276, Buenos Aires, Argentina, 2-6 August 1993. Centro Latinoamericano de Estudios en Informatica.
[Cif94a]	C. Cifuentes. Interprocedural data flow decompilation. Technical Report 4/94, Faculty of Information Technology, Queensland University of Technology, GPO Box 2434, Brisbane 4001, Australia, April 1994. (Submitted to Journal of Programming Languages).
[Cif94b]	C. Cifuentes. Structuring decompiled graphs. Technical Report 5/94, Faculty of Information Technology, Queensland University of Technology, GPO Box 2434, Brisbane 4001, Australia, April 1994. (Submitted to The Computer Journal).
[Cob93]	Cobol decompiler. Midrange Systems, 6(13):66, July 1993.
[Coc70]	J. Cocke. Global common subexpression elimination. SIGPLAN Notices, 5(7):20-25, July 1970.
[Col81]	J.W. Perry Cole. ANSI Fortran IV, A structured programming approach. WM.C.Brown, 2460 Kerper Boulevard, Dubuque, Iowa 52001, 8 edition, 1981.
[Com91]	V Communications. Sourcer - Commenting Disassembler, 8088 to 80486 Instruction Set Support. V Communications, Inc, 4320 Stevens Creek Blvd., Suite 275, San Jose, CA 95129, 1991.
[Coo67]	D.C. Cooper. Bohm and Jacopini's reduction of flow charts. Communications of the ACM, 10(8):463,473, August 1967.
[Coo83]	D. Cooper. Standard Pascal, User Reference Manual. W.W.Norton & Company, 500 Fifth Avenue, New York, N.Y. 10110, 1 edition, 1983.
[Dav58]	M. Davis. Computability and Unsolvability, chapter 5, pages 69-70. McGraw-Hill, 1958.
[DoD83]	American National Standards Institute, Inc., Department of Defense, OUSD(R&E), Washington, DC 20301, USA. Reference Manual for the Ada Programming Language, ANSI/MIL-STD-1815A-1983, February 1983.
[DS82]	L.M. Dorsey and S.Y. Su. The decompilation of COBOL-DML programs for the purpose of program conversion. In Proceedings of COMPSAC 82. IEEE Computer Society's Sixth International Computer Software and Applications Conference, pages 495-504, Chicago, USA, November 1982. IEEE.
[Dud82]	R. Dudley. A recursive decompiler. FORTH Dimensions, 4(2):28, Jul-Aug 1982.
[Dun88a]	R. Duncan. Advanced MSDOS programming. Microsoft Press, 16011 NE 36th Way, Box 97017, Redmond, Washington 98073-9717, 2 edition, 1988.
[Dun88b]	R. Duncan. The MSDOS Encyclopedia, chapter 4, pages 107-147. Microsoft Press, 1988.
[DZ89]	D.M. Dejean and G.W. Zobrist. A definition optimization technique used in a code translation algorithm. Communications of the ACM, 32(1):94-104, January 1989.
[EH93]	A.M. Erosa and L.J. Hendren. Taming control flow: A structured approach to eliminating goto statements. Technical Report ACAPS Technical Memo 76, School of Computer Science, McGill University, 3480 University St, Montreal, Canada H3A 2A7, September 1993.
[Emm94]	M. Van Emmerik. Signatures for library functions in executable files. Technical Report 2/94, Faculty of Information Technology, Queensland University of Technology, GPO Box 2434, Brisbane 4001, Australia, April 1994.
[FJ88a]	C.N. Fischer and R.J. LeBlanc Jr. Crafting a Compiler. Benjamin Cummings, 2727 Sand Hill Road, Menlo Park, California 94025, 1988.
[FJ88b]	C.N. Fischer and R.J. LeBlanc Jr. Crafting a Compiler, chapter 16, pages 609-680. Benjamin Cummings, 2727 Sand Hill Road, Menlo Park, California 94025, 1988.
[Flu89]	B.H. Flusche. The art of disassembly; getting to the source of the problem when the object's the data. Micro Cornucopia, (46):8-14, March - April 1989.
[Fre91]	P. French. Private communication. Email, 1991.
[Fri74]	F.L. Friedman. Decompilation and the Transfer of Mini-Computer Operating Systems. PhD dissertation, Purdue University, Computer Science, August 1974.
[FZ91]	C. Fuan and L. Zongtian. C function recognition technique and its implementation in 8086 C decompiling system. Mini-Micro Systems, 12(11):33-40,47, 1991.
[FZL93]	C. Fuan, L. Zongtian, and L. Li. Design and implementation techniques of the 8086 C decompiling system. Mini-Micro Systems, 14(4):10-18,31, 1993.
[Gai65]	R.S. Gaines. On the translation of machine language programs. Communications of the ACM, 8(12):737-741, December 1965.
[Gar88]	P.D. Garnett. Selective disassembly: a first step towareds developing a virus filter. Fourth Aerospace Computing Security Appl Conference, pages 2-6, December 1988.
[GCC+92]	K.J. Gough, C. Cifuentes, D. Corney, J. Hynd, and P. Kolb. An experiment in mixed compilation/interpretation. In G.K.Gupta and C.D.Keen, editors, Proceedings of the Fifteenth Australian Computer Science Conference (ACSC-15), pages 315-327, University of Tasmania, Hobart, Australia, 29-31 January 1992. Australian Computer Society.
[GD83]	J. Gersbach and J. Damke. Asmgen, version 2.01. Public domain software. Anonymous ftp oak.oakland.edu:SimTel/msdos/disasm/asmgen3.zip, 1983.
[GL82]	L. Goldschlager and A. Lister. Computer Science: A modern introduction. Prentice-Hall International, 1982.
[Gou88]	K.J. Gough. Syntax Analysis and Software Tools. Addison Wesley Publishing Company, Reading, U.K., 1988.
[Gou93]	K.J. Gough. Private communication, 1993.
[Gut90]	S. Guthery. exe2c. News item in comp.compilers USENET newsgroup, 30 Apr 1990.
[Gut91a]	S. Guthery. exe2c. News item in comp.compilers USENET newsgroup, 23 Apr 1991.
[Gut91b]	S. Guthery. Private communication. Austin Code Works, 11100 Leafwood Lane, Austin, TX 78750-3587, 14 Dec 1991.
[Hal62]	M.H. Halstead. Machine-independent computer programming, chapter 11, pages 143-150. Spartan Books, 1962.
[Hal67]	M.H. Halstead. Machine independence and third generation computers. In Proceedings SJCC (Sprint Joint Computer Conference), pages 587-592, 1967.
[Hal70]	M.H. Halstead. Using the computer for program conversion. Datamation, pages 125-129, May 1970.
[Hec77]	M.S. Hecht. Flow Analysis of Computer Programs. Elsevier North-Holland, Inc, 52 Vanderbilt Avenue, New York, New York 10017, 1977.
[HH73]	B.C. Housel and M.H. Halstead. A methodology for machine language decompilation. Technical Report RJ 1316 (#20557), Purdue University, Department of Computer Science, December 1973.
[HHB+93]	P. Heiser, D. Hanson, C. Berntson, K. Everett, and A. Schwartz. Feedback. Data Based Advisor, 11(6):14-15, June 1993.
[HK92]	M.W. Hall and K. Kennedy. Efficient call graph analysis. Letters on Programming Languages and Systems, 1(3):227-242, September 1992.
[HM79]	R.N. Horspool and N. Marovac. An approach to the problem of detranslation of computer programs. The Computer Journal, 23(3):223-229, 1979.
[HM84]	N.L. Hills and D. Moines. Revisited: Recursive decompiler. FORTH Dimensions, 5(6):16-18, Mar-Apr 1984.
[Hol73]	C.R. Hollander. Decompilation of Object Programs. PhD dissertation, Stanford University, Computer Science, January 1973.
[Hoo91]	S.T. Hood. Decompiling with definite clause grammars. Technical Report ERL-0571-RR, Electronics Research Laboratory, DSTO Australia, PO Box 1600, Salisbury, South Australia 5108, September 1991.
[Hop78]	G.L. Hopwood. Decompilation. PhD dissertation, University of California, Irvine, Computer Science, 1978.
[Hou73]	B.C. Housel. A Study of Decompiling Machine Languages into High-Level Machine Independent Languages. PhD dissertation, Purdue University, Computer Science, August 1973.
[HU72]	M.S. Hecht and J.D. Ullman. Flow graph reducibility. SIAM Journal of Computing, 1(2):188-202, June 1972.
[HU74]	M.S. Hecht and J.D. Ullman. Characterizations of reducible flow graphs. Journal of the ACM, 21(3):367-375, July 1974.
[HU75]	M. Hecht and J. Ullman. A simple algorithm for global data flow analysis problems. SIAM Journal of Computing, 4(4):519-532, December 1975.
[HZY91]	L. Hungmong, L. Zongtian, and Z. Yifen. Design and implementation of the intermediate language in a PC decompiler system. Mini-Micro Systems, 12(2):23-28,46, 1991.
[Int86]	Intel. iAPX 86/88, 186/188 User's Manual. Intel Corporation, 3065 Bowers Avenue, Santa Clara, CA 95051, 1986.
[Int87]	Intel. 80286 and 80287 Programmer's Reference Manual. Intel Corporation, 3065 Bowers Avenue, Santa Clara, CA 95051, 1987.
[KF71]	D.E. Knuth and R.W. Floyd. Notes on avoiding go to statements. Information Processing Letters, 1(1):23-31, 1971.
[Knu74]	D.E. Knuth. Structured programming with go to statements. Computing Surveys, 6(4):261-301, December 1974.
[Kos74]	S.R. Kosaraju. Analysis of structured programs. Journal of Computer and System Sciences, 9(3):232-255, 1974.
[KR88]	B.W. Kernighan and D.M. Ritchie. The C Programming Language. Prentice-Hall, Inc, Englewood Cliffs, N.J., 2 edition, 1988.
[KW82]	R.H. Katz and E. Wong. Decompiling CODASYL DML into relational queries. ACM Transactions on Database Systems, 7(1):1-23, March 1982.
[LG86]	Y.C. Liu and G.A. Gibson. Microcomputer Systems: the 8086/8088 family. Prentice-Hall International, New Jersey, 2 edition, 1986.
[Lic85]	U. Lichtblau. Decompilation of control structures by means of graph transformations. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, 1985.
[Lic91]	U. Lichtblau. Recognizing rooted context-free flowgraph languages in polynomial time. In G. Rozenberg H. Ehrig, H.J. Kreowski, editor, Graph Grammars and their application to Computer Science, number 532 in Lecture Notes in Computer Science, pages 538-548. Springer-Verlag, 1991.
[LM75]	H.F. Ledgard and M. Marcotty. A genealogy of control structures. Communications of the ACM, 18(11):629-639, November 1975.
[Mak90]	O.J. Makela. Intelligent disassembler, version 1.2. Public domain software. Anonymous ftp oak.oakland.edu:SimTel/msdos/disasm/id12.zip, 1990.
[May88]	W. May. A simple decompiler. Dr.Dobb's Journal, pages 50-52, June 1988.
[Mic87]	Microsoft. Mixed-Language Programming Guide. Microsoft Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA 98073-9717, 1987.
[MZBR85]	W.K. Marshall, G.W. Zobrist, W. Bach, and A. Richardson. A functional mapping for a microprocessor system simulation. In Proceedings of the 1985 IEEE Microprocessor Forum (Atlantic City, N.J., Apr.2-4). IEEE Piscataway, N.J. pp.37-39, 1985.
[Oul82]	G. Oulsnam. Unravelling unstructured programs. The Computer Journal, 25(3):379-387, 1982.
[Out93]	Tools and utilities. DBMS, 6(7):63-92, June 1993.
[PLA91]	Programming Languages and Systems Group - Queensland University of Technology, GPO Box 2434, Brisbane, QLD 4001, Australia. Gardens Point Modula-2, 1991.
[PW93]	D.J. Pavey and L.A. Winsborrow. Demonstrating equivalence of source code and PROM contents. The Computer Language, 36(7):654-667, 1993.
[Ram88]	L. Ramshaw. Eliminating go to's while preserving program structure. Journal of the ACM, 35(4):893-920, October 1988.
[Ray89]	E.S. Raymond. Plum-hall benchmarks. URL: ftp//plaza.aarnet.edu.au/usenet/comp.sources.unix/volume20/plum-benchmarks.gz, 1989.
[Reu88]	J. Reuter. URL: ftp//cs.washington.edu/ pub/decomp.tar.z. Public domain software, 1988.
[Reu91]	J. Reuter. Private communication. Email, 1991.
[Ryd79]	B.G. Ryder. Constructing the call graph of a program. IEEE Transactions on Software Engineering, 5(3):216-226, May 1979.
[Sas66]	W.A. Sassaman. A computer program to translate machine language into fortran. In Proceedings SJCC, pages 235-239, 1966.
[SCK+93]	R.L. Sites, A. Chernoff, M.B. Kirk, M.P. Marks, and S.G. Robinson. Binary translation. Communications of the ACM, 36(2):69-81, February 1993.
[Sha80]	M. Sharir. Structural analysis: A new approach to flow analysis in optimizing compilers. Computer Languages, 5:141-153, 1980.
[Sof88]	RH Factor Software. Bubble chamber installation. Public domain software, beta release. Anonymous ftp oak.oakland.edu:SimTel/msdos/disasm/bubble.zip, 1988.
[SW74]	V. Schneider and G. Winiger. Translation grammars for compilation and decompilation. BIT, 14:78-86, 1974.
[SW93]	A. Srivastava and D.W. Wall. A practical system for intermodule code optimization at link-time. Journal of Programming Languages, 1(1):1-18, March 1993.
[Tar72]	R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, June 1972.
[Tar74]	R.E. Tarjan. Testing flow graph reducibility. Journal of Computer and System Sciences, pages 355-365, September 1974.
[Unc93]	Your guide to clipper add-ons. Data Based Advisor, 11(8):47-67, August 1993.
[Val93]	Slicing thru source code. Data Based Advisor, 11(3):28, March 1993.
[WG85]	M.H. Williams and G.Chen. Restructuring pascal programs containing goto statements. The Computer Journal, 28(2):134-137, 1985.
[Wil77]	M.H. Williams. Generating structured flow diagrams: the nature of unstructuredness. The Computer Journal, 20(1):45-50, 1977.
[Wir85]	N. Wirth. Programming in Modula-2. Springer-Verlag, Berlin Heidelberg, 3 edition, 1985.
[WO78]	M.H. Williams and H.L. Ossher. Conversion of unstructured flow diagrams to structured form. The Computer Journal, 21(2):161-167, 1978.
[Wor78]	D.A. Workman. Language design using decompilation. Technical report, University of Central Florida, December 1978.
[Wor91]	Austin Code Works. exe2c.firelease, 1991. Email: info@acw.com.
[Yoo85]	C.W. Yoo. An approach to the transportation of computer software. Information Processing Letters, 21:153-157, September 1985.
[Zan85]	J.R. Van Zandt. Interactive 8086 disassembler, version 2.21. Public domain software. Anonymous ftp oak.oakland.edu:SimTel/msdos/disasm/dis86221.zip, 1985.