Skip to main content
SpringerLink
Log in

Software Birthmark Similarity

  • Chapter
  • First Online:
Software Similarity and Classification

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

Abstract

Comparing birthmarks is necessary to identify similarities between software. If two birthmarks are similar, then the software is similar. Birthmarks may be compared to show similarity, or an alternative to showing similarity is to show dissimilarity or distance. Similarity measures and metrics exist for the different types of data such as strings, vectors, trees, graphs, etc. This chapter examines the different similarity measures and metrics for the different classes of birthmarks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Peter NY (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM symposium on discrete algorithms, Austin, Texas, United States. Society for industrial and applied mathematics, pp 311–321

    Google Scholar 

  2. Vieira MR, Chino FJT, Traina C Jr., Traina AJM (2004) DBM-Tree: a dynamic metric access method sensitive to local density data. In: Brazilian symposium on databases, Brazil, pp 163–177

    Google Scholar 

  3. Paolo C, Marco P, Pavel Z (1997) M-tree: an efficient access method for similarity search in metric spaces. Paper presented at the proceedings of the 23rd international conference on very large data bases

    Google Scholar 

  4. Cilibrasi R, Vitányi PMB (2005) Clustering by compression. Inf Theory IEEE Trans 51(4):1523–1545

    Article  Google Scholar 

  5. Brecheisen S (2007) Efficient and effective similarity search on complex objects. Ludwig-Maximilians-Universität München, Munich, Germany

    Google Scholar 

  6. Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337(1–3):217–239

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Deakin University, 221 Burwood Highway, Burwood, VIC, 3125, Australia

    Silvio Cesare & Yang Xiang

Authors
  1. Silvio Cesare
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Xiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2012 The Author(s)

About this chapter

Cite this chapter

Cesare, S., Xiang, Y. (2012). Software Birthmark Similarity. In: Software Similarity and Classification. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2909-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2909-7_8

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2908-0

  • Online ISBN: 978-1-4471-2909-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation