Browsing by Author "Agarwal, Suneeta"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation - Scopus: 1
    Maintaining Software Through Bit-Parallelism and Hashing the Parameterized q-grams
    (Univ Osijek, Tech Fac, 2012) Prasad, Rajesh; Agarwal, Suneeta; Misra, Sanjay; Sharma, Anuj Kumar; Singh, Alok; Computer Engineering; Computer Engineering; 06. School Of Engineering; 01. Atılım University
    In the software maintenance, it is often required to find duplicity present in the codes. Two code fragments are equivalent, if one can be transformed into the other via consistent renaming of identifiers, literals and variables. This equivalency can be detected by parameterized string matching. In this matching, a given pattern is said to match with a substring of the text, if there exists a one-to-one correspondence between symbols of and symbols of. In this paper, we propose an efficient algorithm for this problem by using both the overlapping and non-overlapping q-gram. We show the effect of running time of the algorithm on increasing the duplicity present in the code.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 1
    Plagiarism Detection in Software Using Efficient String Matching
    (Springer-verlag Berlin, 2012) Pandey, Kusum Lata; Agarwal, Suneeta; Misra, Sanjay; Prasad, Rajesh; Computer Engineering; 06. School Of Engineering; 01. Atılım University
    String matching refers to the problem of finding occurrence(s) of a pattern string within another string or body of a text. It plays a vital role in plagiarism detection in software codes, where it is required to identify similar program in a large populations. String matching has been used as a tool in a software metrics, which is used to measure the quality of software development process. In the recent years, many algorithms exist for solving the string matching problem. Among them, Berry-Ravindran algorithm was found to be fairly efficient. Further refinement of this algorithm is made in TVSBS and SSABS algorithms. However, these algorithms do not give the best possible shift in the search phase. In this paper, we propose an algorithm which gives the best possible shift in the search phase and is faster than the previously known algorithms. This algorithm behaves like Berry-Ravindran in the worst case. Further extension of this algorithm has been made for parameterized string matching which is able to detect plagiarism in a software code.