• DocumentCode
    1937482
  • Title

    Analysis of Applicability for Synchronization Complexity Metric

  • Author

    Yastrebenetsky, Peter ; Trakhtenbrot, Mark

  • Author_Institution
    Open Univ. of Israel, Raanana, Israel
  • fYear
    2011
  • fDate
    27-29 April 2011
  • Firstpage
    24
  • Lastpage
    33
  • Abstract
    The paper analyzes the practical applicability of the novel Synchronization Complexity metric (SCM) introduced by the authors in. This metric characterizes complexity of a program based on the kind and amount of means used for synchronization between its concurrent components. The metric is evaluated with respect to the soundness properties introduced by Weyuker and software measurement scales considered by Zuse. The growth of SCM for real-world applications is also analyzed. The analysis shows that SCM is a useful practical instrument for evaluation of complex software systems. In particular, SCM allows for assessment of the amount of tests needed to achieve a proper coverage in testing of a concurrent program. It also enables comparison between different implementations of a system based on their synchronization complexity.
  • Keywords
    computational complexity; software metrics; complex software systems; program complexity; software measurement scales; synchronization complexity metric; Complexity theory; Estimation; IP networks; Instruction sets; Synchronization; practical applicability; soundness; synchronization complexity analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Engineering of Computer Based Systems (ECBS), 2011 18th IEEE International Conference and Workshops on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    978-1-4577-0065-1
  • Electronic_ISBN
    978-0-7695-4379-6
  • Type

    conf

  • DOI
    10.1109/ECBS.2011.7
  • Filename
    5934801