Graph-based procedural abstraction

International Symposium on Code Generation and Optimization, CGO 2007

Volumn , Issue , 2007, Pages 259-270

  Dreweke, A ^a   Worlein M ^a   Fischer, I ^b   Schell, D ^a   Meinl, Th ^b   Philippsen, M ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BINARY CODES; BLOCK CODES; EMBEDDED SYSTEMS;

BASIC BLOCKS; EMBEDDED MICRO COMPUTERS;

GRAPH THEORY;

EID: 34547693089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2007.14     Document Type: Conference Paper

References (48)

1. Advanced RISC Machines Ltd. (ARM). An Introduction to THUMB, March 1995.
2. R. Agrawal, T. Imielinski, and A. N. Swami. Mining Association Rules between Sets of Items in Large Databases. In P. Buneman and S. Jajodia, editors, Proc. 1993 ACM SIGMOD Int'l Conf. on Management of Data, pages 207-216, Washington, D.C., USA, 1993. ACM Press.
3. aipop. AbsInt Angew. Informatik GmbH, Saarbrücken, http://www.AbsInt.com/aipop.
4. B. Baker. On finding duplication and near-duplication in large software systems. In Second Working Conference on Reverse Engineering, pages 86-95, Los Alamitos, CA, USA, 1995. IEEE Computer Society.
5. V. Barthelmann. Advanced Compiling Techniques to Reduce RAM Usage of Static Operating Systems. PhD thesis, Universität Erlangen- Nürnberg, Erlangen, Germany, 2004.
6. I. Baxter, A. Yahin, L. De Moura, M. Sant'Anna, and L. Bier. Clone detection using abstract syntax trees. In Proceedings of the 1998 International Conference on Software Maintenance, pages 368-377, Bethesda, Maryland, USA, 1998. IEEE Computer Society.
7. J. Bentley. Programming Pearls: Squeezing Space. Communications of the ACM, 27(5):416-421, May 1984.
8. Á. Beszédes, R. Ferenc, T. Gyimóthy, A. Dolenc, and K. Karsisto. Survey of code-size reduction methods. ACM Computing Surveys, 35(3):223-267, Sept. 2003.
9. C. Borgelt and M. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In Proc. IEEE Int'l Conf. on Data Mining ICDM, pages 51-58, Maebashi City, Japan, 2002. IEEE Computer Society Press.
10. P. Brisk, A. Kaplan, R. Kastner, and M. Sarrafzadeh. Instruction generation and regularity extraction for reconfigurable processors. In Proceedings of the Int'l Conf. on Compilers, Architecture, and Synthesis for Embedded Systems, pages 262-269, New York, NY, USA, 2002. ACM Press.
11. P. Brisk, J. Macbeth, A. Nahapetian, and M. Sarrafzadeh. A dictionary construction technique for code compression systems with echo instructions. In Y. Paek and R. Gupta, editors, Proceedings of the Conf. on Languages, Compilers, and Tools for Embedded Systems, pages 105-114, Chicago, USA, June 2005. ACM.
12. T. Callahan, P. Chong, A. DeHon, and J. Wawrzynek. Fast module mapping and placement for datapaths in FPGAs. In ACM/SIGDA Int'l Symp. on Field Programmable Gate Arrays, pages 123-132, Monterey, CA, 1998.
13. W. Cheung, W. Evans, and J. Moses. Predicated instructions for code compaction. In 7th Int'l Workshop on Software and Compilers for Embedded Systems (SCOPES), number 2826 in Lecture Notes in Computer Science, pages 17-32, 2003.
14. A. Chowdhary, S. Kale, P. Saripella, N. Sehgal, and R. Gupta. A general approach for regularity extraction in datapath circuits. In IEEE Int'l Conf. on ComputerAided Design (ICCAD), pages 332-339, 1998.
15. D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32-41, 2000.
16. B. De Sutter, B. De Bus, and K. De Bosschere. Sifting out the mud: Low level c++ code reuse. In Proceedings of the 17th ACM SIGPLAN Conf. on Object-oriented programming, systems, languages, and applications, pages 275-291, New York, NY, USA, 2002. ACM Press.
17. B. De Sutter, H. Vandierendonck, B. De Bus, and K. De Bosschere. On the side-effects of code abstraction. In Proceedings of the 2003 ACM SIGPLAN Conf. on Languages, Compilers, and Tools for Embedded Systems, pages 244-253, New York, NY, USA, 2003. ACM Press.
18. S. K. Debray, W. S. Evans, R. Muth, and B. de Sutter. Compiler Techniques for Code Compaction. ACM Trans. on Progamming Languages and Systems, 22(2):378-415, Mar. 2000.
19. Diablo. Parallel Information System Group, University of Gent, Belgien, http://www.elis.ugent.be/diablo.
20. dietlibc - a libe optimized for small size. http://www.fefe.de/dietlibc/.
21. 0,288n) Independent Set Algorithm. In Proc. of the 17th ACM-SIAM Symp. on Discrete Algorithms: SODA '06, pages 18-25, Miami, Florida, USA, Jan. 2006. ACM and SIAM.
22. C. Fraser, E. Myers, and A. Wendt. Analyzing and compressing assembly code. In Proceedings of the ACM SIGPLAN '84 Symp. on Compiler Construction, pages 117-121, New York, NY, USA, 1984. ACM Press.
23. C. W. Fraser, E. W. Myers, and A. L. Wendt. Analyzing and Compressing Assembly Code. In Proc. 1984 ACM SIGPLAN Symp. an Compiler Construction, pages 117-121, Montréal, Canada, June 1984.
24. S. Furber. ARM System Architecture. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1996.
25. S. Ghazizadeh and S. S. Chawathe. Seus: Structure extraction using summaries. In S. Lange, K. Satoh, and C. H. Smith, editors, 5th Int'l Conf. on Discovery Science, volume 2534 of Lecture Notes in Computer Science, pages 71-85, Lübeck, Germany, Nov. 2002. Springer.
26. M. Guthaus, J. Ringenberg, D. Ernst, T. Austin, T. Mudge, and R. Brown. Mibench: A free, commercially representative embedded benchmark suite. In Proceedings of the 4th IEEE Annual Workshop on Workload Characterization, pages 3-14, Austin, TX, USA, 2001. IEEE Computer Society.
27. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proc. of the 3rd IEEE Int'l Conf. on Data Mining ICDM, pages 549-552, Melbourne, FL, USA, Nov. 2003. IEEE Press.
28. A. Inokuchi, T. Washio, and H. Motada. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD '00: Proceedings of the 4th European Conf. on Principles of Data Mining and Knowledge Discovery, pages 13-23, London, UK, 2000. Springer.
29. R. Komondoor and S. Horwitz. Eliminating duplication in source code via procedure extraction. Technical report, Comupter Sciences Department University of WisconsinMadison, Madison, WI, USA, 2002.
30. D. Kumlander. A new exact Algorithm for the Maximum-Weight Clique Problem based on a Heuristic Vertex-Coloring and a Backtrack Search. In T. H. A. Le and D. T. Pham, editors, 5th Int'l Conf. on Modelling, Computation and Optimization in Information Systems and Management Sciences: MCO '04, pages 202-208, Metz, France, July 2004. Hermes Science Publishing Ltd.
31. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In M. W. Berry, U. Dayal, C. Kamath, and D. B. Skillicorn, editors, Proceedings of the Fourth SIAM Int'l Conf. on Data Mining, pages 243-271, Orlando, FL, USA, Apr. 2004. SIAM.
32. T. Meinl and I. Fischer. Subgraph mining. In J. Wang, editor, Encyclopedia of Data Warehousing and Mining, pages 1059-1063. Idea Group, Hershey, PA, USA, 2005.
33. T. Meinl, I. Fischer, and M. Philippsen. Parallel Mining for Frequent Fragments on a Shared-Memory Multiprocessor - Results and Java-Obstacles-. In M. Bauer, A. Kröner, and B. Brandherm, editors, LWA 2005 - Beiträge zur GIWorkshopwoche Lernen, Wissensentdeckung, Adaptivität, pages 196-201, 2005.
34. S. O. Memik, G. Memik, R. Jafari, and E. Kursun. Global resource sharing for synthesis of control data flow graphs on fpgas. In ACM/IEEE Design Automation Conference (DAC), pages 604-609, Anaheim, CA, June 2003.
35. P. C. Nguyen, K. Ohara, H. Motada, and T. Washio. Cl-gbi: A novel approach for extracting typical patterns from graphstructured data. In T. B. Ho, D. Cheung, and H. Liu, editors, Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, volume 3518 of Lecture Notes in Computer Science, pages 639-649, Hanoi, Vietnam, May 2005. Springer.
36. S. Nijssen and J. N. Kok. The Gaston Tool for Frequent Subgraph Mining. Proc. Int'l Workshop on Graph-Based Tools (Grabats), Electronic Notes in Theoretical Computer Science, 127(1):77-87, 2004.
37. S. Nijssen and J. N. Kok. Frequent subgraph miners: Runtime don't say everything. In T. Gärtner, G. C. Garriga, and T. Meinl, editors, Proceedings of the Int'l Workshop on Mining and Learning with Graphs (MLG 2006), pages 173-180, Berlin, Germany, 2006.
38. W. Pugh. Compressing Java Class Files. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), pages 247-258, Atlanta, GA, USA, May 1999.
39. D. Rao and F. Kurdahi. Partitioning by regularity extraction. In ACM/IEEE Design Automation Conference, pages 235-238, Anaheim, CA, June 1992.
40. B. D. Sutter, B. D. Bus, and K. D. Bosschere. Link-time binary rewriting techniques for program compaction. ACM Trans. Prog. Lang. Syst., 27(5):882-945, 2005.
41. F. Tip, P. F. Sweeney, C. Laffra, A. Eisma, and D. Streeter. Practical Extraction Techniques for Java. ACM Trans. on Programming Languages and Systems, 24(6):625-666, Nov. 2002.
42. N. Vanetik, E. Gudes, and S. Shimony. Computing frequent graph patterns from semistructured data. In Proc. of 2002 IEEE Int'l Conf. on Data Mining, pages 458-464, Maebashi City, Japan, Dec. 2002. IEEE Computer Society.
43. T. Washio and H. Motoda. State of the Art of Graph-based Data Mining. SIGKDD Explorations Newsletter, 5(1):59-68, July 2003.
44. M. Wörlein, T. Meinl, I. Fischer, and M. Philippsen. A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston. In A. Jorge, L. Torgo, P. Brazdil, R. Camacho, and J. Gama, editors, Knowledge Discovery in Database: PKDD 2005, Lecture Notes in Computer Science, pages 392-403, Porto, Portugal, 2005. Springer.
45. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proceedings IEEE Int'l Conf. on Data Mining ICDM, pages 721-723, Maebashi City, Japan, 2002. IEEE Computer Society Press.
46. X. Yan and J. Han. Closegraph: Mining closed frequent graph patterns. In Proceedings of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 286-295, Washington, DC, USA, 2003. ACM Press.
47. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New Algorithms for Fast Discovery of Association Rules. In D. Heckerman, H. Mannila, D. Pregibon, R. Uthurusamy, and M. Park, editors, Proc. of 3rd Int'l Conf. on Knowledge Discovery and Data Mining, pages 283-296, Newport Beach, CA, USA, Aug. 1997. AAAI Press.
48. D. C. Zaretsky, G. Mittal, R. P. Dick, and P. Banerjee. Dynamic template generation for resource sharing in control and data flow graphs. In Proceedings of the 19th Int'l Conf. on VLSI Design, pages 465-468, Hyderabad, India, Jan. 2006. IEEE Computer Society.