Structuring decompiled graphs-Reference-Cited by-同舟云学术

Structuring decompiled graphs

Published:1996 Issue: Volume: Page:91-105
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cifuentes Cristina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61053-7_55.pdf

Reference29 articles.

1. F.E. Allen. Control flow analysis. SIGPLAN Notices, 5(7):1–19, July 1970.

2. F.E. Allen. A basis for program optimization. In Proc. IFIP Congress, pages 385–390, Amsterdam, Holland, 1972. North-Holland Pub.Co.

3. F.E. Allen. Interprocedural data flow analysis. In Proc. IFIP Congress, pages 398–402, Amsterdam, Holland, 1974. North-Holland Pub.Co.

4. 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.

5. F.E. Allen and J. Cocke. A program data flow analysis procedure. Communications of the ACM, 19(3):137–147, March 1976.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structuring Erlang BEAM control flow;Proceedings of the 16th ACM SIGPLAN International Workshop on Erlang;2017-09-08

2. A refined decompiler to generate C code with high readability;Software: Practice and Experience;2012-07-13

3. Warp Processors;ACM Transactions on Design Automation of Electronic Systems;2006-07

4. Structuring statement sequences in instance-based locality optimization;Future Generation Computer Systems;2001-01

5. Regularity considerations in instance-based locality optimization;Lecture Notes in Computer Science;1999