메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1-10

Genetic programming for reverse engineering

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT ASSIGNMENT; DEPENDENCE ANALYSIS; GENETIC IMPROVEMENTS; PARTIAL EVALUATION; REGRESSION TESTING; SEARCH BASED SOFTWARE ENGINEERING (SBSE); SYNTAX-PRESERVING; WORKING CONFERENCE ON REVERSE ENGINEERINGS;

EID: 84893394695     PISSN: 10951350     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCRE.2013.6671274     Document Type: Conference Paper
Times cited : (34)

References (93)
  • 2
  • 6
    • 55749099654 scopus 로고    scopus 로고
    • A Novel Co-evolutionary approach to automatic software bug fixing
    • Hongkong, China 1-6 June. IEEE Computer Society
    • Andrea Arcuri and Xin Yao. A Novel Co-evolutionary Approach to Automatic Software Bug Fixing. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 08), pages 162-168, Hongkong, China, 1-6 June 2008. IEEE Computer Society.
    • (2008) Proceedings of the IEEE Congress on Evolutionary Computation (CEC 08 , pp. 162-168
    • Arcuri, A.1    Yao, X.2
  • 9
    • 0027308002 scopus 로고
    • Program and interface slicing for reverse engineering
    • Los Alamitos, California, USA IEEE Computer Society Press
    • Jon Beck and David Eichmann. Program and interface slicing for reverse engineering. In IEEE/ACM 15th Conference on Software Engineering (ICSE93), pages 509-518, Los Alamitos, California, USA, 1993. IEEE Computer Society Press.
    • (1993) IEEE/ACM 15th Conference on Software Engineering (ICSE93 , pp. 509-518
    • Beck, J.1    Eichmann, D.2
  • 10
    • 0027306292 scopus 로고
    • The concept assignment problem in program understanding
    • Los Alamitos, California, USA May IEEE Computer Society Press
    • T. J. Biggerstaff, B. Mitbander, and D. Webster. The concept assignment problem in program understanding. In 15th International Conference on Software Engineering, pages 482-498, Los Alamitos, California, USA, May 1993. IEEE Computer Society Press.
    • (1993) 15th International Conference on Software Engineering , pp. 482-498
    • Biggerstaff, T.J.1    Mitbander, B.2    Webster, D.3
  • 11
    • 57849107164 scopus 로고    scopus 로고
    • A formal relationship between program slicing and partial evaluation
    • David Binkley, Sebastian Danicic, Mark Harman, John Howroyd, and Lahcen Ouarbya. A formal relationship between program slicing and partial evaluation. Formal Aspects of Computing, 18(2):103-119, 2006.
    • (2006) Formal Aspects of Computing , vol.18 , Issue.2 , pp. 103-119
    • Binkley, D.1    Danicic, S.2    Harman, M.3    Howroyd, J.4    Ouarbya, L.5
  • 15
    • 84950998600 scopus 로고    scopus 로고
    • An empirical study of amorphous slicing as a program comprehension support tool
    • Los Alamitos, California, USA June, IEEE Computer Society Press
    • David Binkley, Mark Harman, L. Ross Raszewski, and Christopher Smith. An empirical study of amorphous slicing as a program comprehension support tool. In 8th IEEE International Workshop on Program Comprehension, pages 161-170, Los Alamitos, California, USA, June 2000. IEEE Computer Society Press.
    • (2000) 8th IEEE International Workshop on Program Comprehension , pp. 161-170
    • Binkley, D.1    Harman, M.2    Ross Raszewski, L.3    Smith, C.4
  • 16
    • 33847574759 scopus 로고    scopus 로고
    • Partial evaluation for program comprehension
    • September 1998. Article 17
    • Sandrine Blazy and Philie Facon. Partial evaluation for program comprehension. ACM Computing Surveys, 30(3), September 1998. Article 17.
    • ACM Computing Surveys , vol.30 , pp. 3
    • Blazy, S.1    Facon, P.2
  • 19
    • 77955427208 scopus 로고    scopus 로고
    • Learning a metric for code readability
    • Raymond P. L. Buse and Westley Weimer. Learning a metric for code readability. IEEE Trans. Software Eng., 36(4):546-558, 2010.
    • (2010) IEEE Trans. Software Eng. , vol.36 , Issue.4 , pp. 546-558
    • Buse, R.P.L.1    Weimer, W.2
  • 20
    • 84864226089 scopus 로고    scopus 로고
    • 34th International Conference on Software Engineering (ICSE 2012, Zurich, Switzerland, June 2012
    • Raymond P. L. Buse and Westley Weimer. Synthesizing API usage examples. In 34th International Conference on Software Engineering (ICSE 2012), pages 782-792, Zurich, Switzerland, June 2012.
    • Synthesizing API Usage Examples , pp. 782-792
    • Buse, R.P.L.1    Weimer, W.2
  • 25
    • 33846199175 scopus 로고    scopus 로고
    • 12th International Working Conference on Reverse Engineering (WCRE 05 Carnegie Mellon University, Pittsburgh, Pennsylvania, USA November
    • Deji Fatiregun, Mark Harman, and Rob Hierons. Search-based amorphous slicing. In 12th International Working Conference on Reverse Engineering (WCRE 05), pages 3-12, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, November 2005.
    • (2005) Search-based Amorphous Slicing , pp. 3-12
    • Fatiregun, D.1    Harman, M.2    Hierons, R.3
  • 26
    • 80053202643 scopus 로고    scopus 로고
    • Evosuite: Automatic test suite generation for object-oriented software
    • ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 11 , September 5th-9th 2011
    • Gordon Fraser and Andrea Arcuri. Evosuite: automatic test suite generation for object-oriented software. In 8th European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 11), pages 416-419. ACM, September 5th-9th 2011.
    • 8th European Software Engineering Conference and the , pp. 416-419
    • Fraser, G.1    Arcuri, A.2
  • 29
    • 84893375795 scopus 로고
    • D. Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, IFIP TC2 Workshop on Partial Evaluation and Mixed Computation North-Holland
    • Yoshihiko Futamura and Kenroku Nogi. Generalized partial computation. In D. Bjrner, Andrei P. Ershov, and Neil D. Jones, editors, IFIP TC2 Workshop on Partial Evaluation and Mixed Computation, pages 133-151. North-Holland, 1987.
    • (1987) Generalized Partial Computation , pp. 133-151
    • Futamura, Y.1    Nogi, K.2
  • 33
    • 0000052043 scopus 로고    scopus 로고
    • DyC: An expressive annotation-directed dynamic compiler for C
    • Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, and Susan J. Eggers. DyC: an expressive annotation-directed dynamic compiler for C. Theor. Comput. Sci., 248(1-2):147-199, 2000.
    • (2000) Theor. Comput. Sci , vol.248 , Issue.1-2 , pp. 147-199
    • Grant, B.1    Mock, M.2    Philipose, M.3    Chambers, C.4    Eggers, S.J.5
  • 34
    • 34748859982 scopus 로고    scopus 로고
    • The current state and future of search based software engineering
    • Los Alamitos, California, USA IEEE Computer Society Press
    • Mark Harman. The current state and future of search based software engineering. In Lionel Briand and Alexander Wolf, editors, Future of Software Engineering 2007, pages 342-357, Los Alamitos, California, USA, 2007. IEEE Computer Society Press.
    • (2007) Lionel Briand and Alexander Wolf, Editors, Future of Software Engineering , pp. 342-357
    • Harman, M.1
  • 35
    • 84893417605 scopus 로고    scopus 로고
    • 1st International Workshop on Search Based Testing (SBT). Lillehammer, Norway 2008
    • Mark Harman. Open problems in testability transformation. In 1st International Workshop on Search Based Testing (SBT 2008), Lillehammer, Norway, 2008.
    • (2008) Open Problems in Testability Transformation
    • Harman, M.1
  • 38
    • 0029376295 scopus 로고
    • Software Testing Verification and Reliability September
    • Mark Harman and Sebastian Danicic. Using program slicing to simplify testing. Software Testing, Verification and Reliability, 5(3):143-162, September 1995.
    • (1995) Using Program Slicing to Simplify Testing , vol.5 , Issue.3 , pp. 143-162
    • Harman, M.1    Danicic, S.2
  • 39
    • 0142211094 scopus 로고    scopus 로고
    • A new representation and crossover operator for search-based optimization of software modularization
    • New York, USA, 9-13 July 2002 Morgan Kaufmann Publishers
    • Mark Harman, Robert Hierons, and Mark Proctor. A New Representation and Crossover Operator for Search-based Optimization of Software Modularization. In Proceedings of the 2002 Conference on Genetic and Evolutionary Computation (GECCO 02), pages 1351-1358, New York, USA, 9-13 July 2002. Morgan Kaufmann Publishers.
    • Proceedings of the 2002 Conference on Genetic and Evolutionary Computation (GECCO 02 , pp. 1351-1358
    • Harman, M.1    Hierons, R.2    Proctor, M.3
  • 40
    • 0002107790 scopus 로고    scopus 로고
    • An overview of program slicing
    • Mark Harman and Robert Mark Hierons. An overview of program slicing. Software Focus, 2(3):85-92, 2001.
    • (2001) Software Focus , vol.2 , Issue.3 , pp. 85-92
    • Harman, M.1    Mark Hierons, R.2
  • 41
    • 80053197346 scopus 로고    scopus 로고
    • 8th European Software Engineering Conference and the, ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 11 , New York, NY, USA, September 5th-9th 2011. ACM
    • Mark Harman, Yue Jia, and Bill Langdon. Strong higher order mutationbased test data generation. In 8th European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 11), pages 212-222, New York, NY, USA, September 5th-9th 2011. ACM.
    • Strong Higher Order Mutationbased Test Data Generation , pp. 212-222
    • Harman, M.1    Jia, Y.2    Langdon, B.3
  • 45
    • 84893414263 scopus 로고    scopus 로고
    • A comprehensive survey of trends in oracles for software testing
    • Department of Computer Science, University of Sheffield
    • Mark Harman, Phil McMinn, Muzammil Shahbaz, and Shin Yoo. A comprehensive survey of trends in oracles for software testing. Technical Report Research Memoranda CS-13-01, Department of Computer Science, University of Sheffield, 2013.
    • (2013) Technical Report Research Memoranda CS-13-01
    • Harman, M.1    McMinn, P.2    Shahbaz, M.3    Yoo, S.4
  • 47
    • 32444442579 scopus 로고    scopus 로고
    • An empirical study of the robustness of two module clustering fitness functions
    • Washington DC, USA, June 2005. Association for Computer Machinery
    • Mark Harman, Stephen Swift, and Kiarash Mahdavi. An empirical study of the robustness of two module clustering fitness functions. In Genetic and Evolutionary Computation Conference (GECCO 2005), pages 1029-1036, Washington DC, USA, June 2005. Association for Computer Machinery.
    • (2005) Genetic and Evolutionary Computation Conference (GECCO , pp. 1029-1036
    • Harman, M.1    Swift, S.2    Mahdavi, K.3
  • 50
    • 31844452965 scopus 로고    scopus 로고
    • Path slicing
    • Chicago, IL, USA, June 2005, ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (POPL
    • Ranjit Jhala and Rupak Majumdar. Path slicing. In Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (POPL 2005), pages 38-47, Chicago, IL, USA, June 2005.
    • (2005) Proceedings of the , pp. 38-47
    • Jhala, R.1    Majumdar, R.2
  • 51
    • 51449110896 scopus 로고    scopus 로고
    • Locating dependence structures using search based slicing
    • Tao Jiang, Nicolas Gold, Mark Harman, and Zheng Li. Locating dependence structures using search based slicing. Information and Software Technology, 50(12):1189-1209, 2008.
    • (2008) Information and Software Technology , vol.50 , Issue.12 , pp. 1189-1209
    • Jiang, T.1    Gold, N.2    Harman, M.3    Li, Z.4
  • 55
    • 78649781035 scopus 로고    scopus 로고
    • Using genetic search for reverse engineering of parametric behaviour models for performance prediction
    • November-December 2010
    • Klaus Krogmann, Michael Kuperberg, and Ralf Reussner. Using genetic search for reverse engineering of parametric behaviour models for performance prediction. IEEE Transactions on Software Engineering, 36(6):865-877, November-December 2010.
    • IEEE Transactions on Software Engineering , vol.36 , Issue.6 , pp. 865-877
    • Krogmann, K.1    Kuperberg, M.2    Reussner, R.3
  • 57
    • 84867404152 scopus 로고    scopus 로고
    • AUSTIN: An open source tool for search based software testing of C programs
    • January 2013
    • Kiran Lakhotia, Mark Harman, and Hamilton Gross. AUSTIN: An open source tool for search based software testing of C programs. Journal of Information and Software Technology, 55(1):112-125, January 2013.
    • Journal of Information and Software Technology , vol.55 , Issue.1 , pp. 112-125
    • Lakhotia, K.1    Harman, M.2    Gross, H.3
  • 61
    • 84880642930 scopus 로고    scopus 로고
    • Current challenges in automatic software repair
    • Claire Le Goues, Stephanie Forrest, and Westley Weimer. Current challenges in automatic software repair. Software Quality Journal, 21(3):421-443, 2013.
    • (2013) Software Quality Journal , vol.21 , Issue.3 , pp. 421-443
    • Le Goues, C.1    Forrest, S.2    Weimer, W.3
  • 64
    • 77956617699 scopus 로고    scopus 로고
    • A multiple hill climbing approach to software module clustering
    • Los Alamitos, California, USA September IEEE Computer Society Press
    • Kiarash Mahdavi, Mark Harman, and Robert Mark Hierons. A multiple hill climbing approach to software module clustering. In IEEE International Conference on Software Maintenance, pages 315-324, Los Alamitos, California, USA, September 2003. IEEE Computer Society Press.
    • (2003) IEEE International Conference on Software Maintenance , pp. 315-324
    • Mahdavi, K.1    Harman, M.2    Mark Hierons, R.3
  • 67
    • 84859749195 scopus 로고    scopus 로고
    • Input domain reduction through irrelevant variable removal and its effect on local, global and hybrid search-based structural test data generation
    • March&April 2012
    • Phil McMinn, Mark Harman, Youssef Hassoun, Kiran Lakhotia, and Joachim Wegener. Input domain reduction through irrelevant variable removal and its effect on local, global and hybrid search-based structural test data generation. IEEE Transactions on Software Engineering, 38(2):453-477, March&April 2012.
    • IEEE Transactions on Software Engineering , vol.38 , Issue.2 , pp. 453-477
    • McMinn, P.1    Harman, M.2    Hassoun, Y.3    Lakhotia, K.4    Wegener, J.5
  • 68
    • 0142211090 scopus 로고    scopus 로고
    • Using heuristic search techniques to extract design abstractions from source code
    • New York, USA, 9-13 July 2002 Morgan Kaufmann Publishers
    • Brian S. Mitchell and Spiros Mancoridis. Using Heuristic Search Techniques to Extract Design Abstractions from Source Code. In Proceedings of the 2002 Conference on Genetic and Evolutionary Computation (GECCO 02), pages 1375-1382, New York, USA, 9-13 July 2002. Morgan Kaufmann Publishers.
    • Proceedings of the 2002 Conference on Genetic and Evolutionary Computation (GECCO 02 , pp. 1375-1382
    • Mitchell, B.S.1    Mancoridis, S.2
  • 69
    • 33645833890 scopus 로고    scopus 로고
    • On the Automatic Modularization of Software Systems using the Bunch Tool
    • March
    • Brian S. Mitchell and Spiros Mancoridis. On the Automatic Modularization of Software Systems using the Bunch Tool. IEEE Transactions on Software Engineering, 32(3):193-208, March 2006.
    • (2006) IEEE Transactions on Software Engineering , vol.32 , Issue.3 , pp. 193-208
    • Mitchell, B.S.1    Mancoridis, S.2
  • 71
    • 33748121602 scopus 로고    scopus 로고
    • Minimum spanning trees made easier via multi-objective optimization
    • Frank Neumann and Ingo Wegener. Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3):305-319, 2006.
    • (2006) Natural Computing , vol.5 , Issue.3 , pp. 305-319
    • Neumann, F.1    Wegener, I.2
  • 72
    • 22044458558 scopus 로고    scopus 로고
    • Peter M. A. Sloot, Marian Bubak, and Louis O. Hertzberger, editors, Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking (HPCN 98 Lecture Notes In Computer Science, Amsterdam, The Netherlands 21-23 April Springer
    • Andy Nisbet. GAPS: A Compiler Framework for Genetic Algorithm (GA) Optimised Parallelisation. In Peter M. A. Sloot, Marian Bubak, and Louis O. Hertzberger, editors, Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking (HPCN 98), volume 1401 of Lecture Notes In Computer Science, pages 987-989, Amsterdam, The Netherlands, 21-23 April 1998. Springer.
    • (1998) GAPS: A Compiler Framework for Genetic Algorithm (GA) Optimised Parallelisation , vol.1401 , pp. 987-989
    • Nisbet, A.1
  • 75
  • 77
  • 78
    • 84881290554 scopus 로고    scopus 로고
    • Using automated program repair for evaluating the effectiveness of fault localization techniques
    • International Symposium on Software Testing and Analysis (ISSTA 13
    • Yuhua Qi, Xiaoguang Mao, Yan Lei, and Chengsong Wang. Using automated program repair for evaluating the effectiveness of fault localization techniques. In International Symposium on Software Testing and Analysis (ISSTA 13), pages 191-201, Lugano, Switzerland, july 2013.
    • Lugano, Switzerland, July 2013 , pp. 191-201
    • Qi, Y.1    Mao, X.2    Lei, Y.3    Wang, C.4
  • 80
    • 42149154819 scopus 로고    scopus 로고
    • Rinard. Living in the comfort zone
    • Systems, Languages, and Applications (OOPSLA, Montreal, Quebec, Canada, October 2007
    • Martin C. Rinard. Living in the comfort zone. In Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2007), pages 611-622, Montreal, Quebec, Canada, October 2007.
    • (2007) Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming , pp. 611-622
    • Martin, C.1
  • 85
    • 82455171650 scopus 로고    scopus 로고
    • Genetic programming for shader simplification
    • Pitchaya Sitthi-amorn, Nicholas Modly, Westley Weimer, and Jason Lawrence. Genetic programming for shader simplification. ACM Trans. Graph., 30(6):152, 2011.
    • (2011) ACM Trans. Graph , vol.30 , Issue.6 , pp. 152
    • Sitthi-Amorn, P.1    Modly, N.2    Weimer, W.3    Lawrence, J.4
  • 88
    • 0028743608 scopus 로고
    • Reverse engineering through formal transformation: Knuths polynomial addition algorithm
    • Martin P. Ward. Reverse engineering through formal transformation: Knuths polynomial addition algorithm. Comput. J., 37(9):795-813, 1994.
    • (1994) Comput. J , vol.37 , Issue.9 , pp. 795-813
    • Ward, M.P.1
  • 92
    • 84857550008 scopus 로고    scopus 로고
    • Regression testing minimisation, selection and prioritisation: A survey
    • Shin Yoo and Mark Harman. Regression testing minimisation, selection and prioritisation: A survey. Journal of Software Testing, Verification and Reliability, 22(2):67-120, 2012.
    • (2012) Journal of Software Testing, Verification and Reliability , vol.22 , Issue.2 , pp. 67-120
    • Yoo, S.1    Harman, M.2
  • 93
    • 29844458023 scopus 로고    scopus 로고
    • Experimental evaluation of using dynamic slices for fault location
    • Monterey, California, USA, September 2005 ACM
    • Xiangyu Zhang, Haifeng He, Neelam Gupta, and Rajiv Gupta. Experimental evaluation of using dynamic slices for fault location. In International Workshop on Automated and Algorithmic Debugging(AADEBUG 2005), pages 33-42, Monterey, California, USA, September 2005. ACM
    • (2005) International Workshop on Automated and Algorithmic Debugging(AADEBUG , pp. 33-42
    • Zhang, X.1    He, H.2    Gupta, N.3    Gupta, R.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.