• DocumentCode
    2033680
  • Title

    Detecting dead statements for concurrent programs

  • Author

    Chen, Zhenqiang ; Xu, Baowen ; Yang, Hongji

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    65
  • Lastpage
    72
  • Abstract
    With more and more concurrent programs being used in practice, technique and tools to analyze such programs are urgently needed. Due to the schedule, race conditions and synchronization among processes (threads), some statements may never be executed. Such statements are dead statements and have no influence on the programs except make them more difficult to analyze and understand. Therefore, the paper develops a data flow approach to detect dead statements for concurrent programs. With this method concurrent programs are represented by concurrent control flow graphs in a simple and precise way, and detecting rules are extracted by analyzing program behavior. Based on these rules, we propose a dead statement-detecting algorithm
  • Keywords
    data flow analysis; flow graphs; parallel programming; MHP algorithm; concurrent control flow graphs; concurrent programs; data flow approach; dead statement detection; program behavior analysis; race conditions; rendezvous; synchronization; Computer science; Data mining; Flow graphs; Laboratories; Petri nets; Processor scheduling; Scheduling algorithm; Software engineering; System recovery; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Source Code Analysis and Manipulation, 2001. Proceedings. First IEEE International Workshop on
  • Conference_Location
    Florence
  • Print_ISBN
    0-7695-1387-5
  • Type

    conf

  • DOI
    10.1109/SCAM.2001.972667
  • Filename
    972667