Software artifacts recovery using abstract regular expressions

被引:0
|
作者
Rasool, Ghulam [1 ]
Asif, Nadim [1 ]
机构
[1] CIIT Lahore, Dept Comp Sci, Lahore, Pakistan
关键词
artifact recovery; pattern matching; regular expressions; reverse engineering; source code analysis;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Program comprehension and artifacts recovery of legacy software systems is assisted by tools that match patterns oil the source code of different programming languages and text flies. There are different capable pattern matching tools including lexical, syntactic and semantic restricted by limitations. The lexical pattern matchers have been given excellent performance, known for case of use and abstract regular expression capabilities. Despite the high degree of performance in pattern matching, these matchers have limited vocabulary that restricts the eclectic restructuring of software components. The syntactic pattern matcher provides precision but may sacrifice the performance, robustness, or power. It is imperative to use the superlative features of both the lexical and syntactic tools that ensure performance, precision and high degree of innovative vocabulary. This paper present a lexical based Pattern matching technique using abstract regular expressions and design recovery tool(DRT) incorporating superlative features of lexical an syntactic pattern matching tools to extract artifacts from legacy software applications.
引用
收藏
页码:167 / 172
页数:6
相关论文
共 50 条
  • [21] Regular Transducer Expressions for Regular Transformations
    Dave, Vrunda
    Gastin, Paul
    Krishna, Shankara Narayanan
    LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 2018, : 315 - 324
  • [22] Regular transducer expressions for regular transformations
    Dave, Vrunda
    Gastin, Paul
    Krishna, Shankara Narayanan
    INFORMATION AND COMPUTATION, 2022, 282
  • [23] The problem of creation and abstract artifacts
    Nurbay Irmak
    Synthese, 2021, 198 : 9695 - 9708
  • [24] NFA Reduction for Regular Expressions Matching Using FPGA
    Kosar, Vlastimil
    Zadnik, Martin
    Korenek, Jan
    PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT), 2013, : 338 - 341
  • [25] Optimizing regular path expressions using graph schemas
    Fernandez, M
    Suciu, D
    14TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 1998, : 14 - 23
  • [26] FROM REGULAR EXPRESSIONS TO DFAS USING COMPRESSED NFAS
    CHANG, CH
    PAIGE, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 644 : 90 - 110
  • [27] The problem of creation and abstract artifacts
    Irmak, Nurbay
    SYNTHESE, 2021, 198 (10) : 9695 - 9708
  • [28] Cleansing Indoor RFID Data Using Regular Expressions
    Baba, Asif Iqbal
    Lu, Hua
    Ku, Wei-Shinn
    Pedersen, Torben Bach
    24TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2016), 2016,
  • [29] LEARNING AND MATCHING HUMAN ACTIVITIES USING REGULAR EXPRESSIONS
    Daldoss, M.
    Piotto, N.
    Conci, N.
    De Natale, F. G. B.
    2010 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, 2010, : 4681 - 4684
  • [30] Synchronized regular expressions
    Della Penna, G
    Intrigila, B
    Tronci, E
    Zilli, MV
    ACTA INFORMATICA, 2003, 39 (01) : 31 - 70