• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Program Dependence Theory of Concurrent Programs and Its Applications

Research Project

Project/Area Number 04650319
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 情報工学
Research InstitutionKYUSHU UNIVERSITY

Principal Investigator

CHENG Jingde  Kyushu University, Faculty of Engineering, Associate Professor, 工学部, 助教授 (30217228)

Co-Investigator(Kenkyū-buntansha) FURUKAWA Zengo  Kyushu University, Education Center for Information Processing, Associate Profes, 情報処理教育センター, 助教授 (30190135)
USHIJIMA Kazuo  Kyushu University, Faculty of Engineering, Professor, 工学部, 教授 (40037750)
Project Period (FY) 1992 – 1993
Project Status Completed (Fiscal Year 1993)
Budget Amount *help
¥2,300,000 (Direct Cost: ¥2,300,000)
Fiscal Year 1993: ¥1,900,000 (Direct Cost: ¥1,900,000)
Fiscal Year 1992: ¥400,000 (Direct Cost: ¥400,000)
KeywordsConcurrent Programs / Program Dependencies / Program Analysis / Test / Debug / Complexity Metrics / Maintenance / 非決定的並列制御流れネット / 非決定的並列定義使用ネット / 同期従属性 / 通信従属性 / プロセス従属ネット / プロセス支配ネット
Research Abstract

1. We proposed two new representations for concurrent programs, named the nondeterministic parallel control-flow net and nondeterministic parallel definition-use net, and showed how to use them to represent multiple control flows and multiple data flows in concurrent programs written in concurrent programing languages such as Ada, Occam2, and SR.
2. In addition to the usual control and data dependencies proposed and studied for sequential programs, we introduced three new types of primary program dependencies in concurrent programs, named the selection dependence, synchronization dependence, and communication dependence and proposed two new program representations for concurrent programs, named the process dependence net and the process influence net, which are arc-classified digraphs to explicitly represent the five types of primary program dependencies in the programs. We also showed some applications of the representations including concurrent program understanding, optimization, testing, debugging, maintenance, and complexity measurement.
3. We developed a group of tools to transform concurrent programs into their nondeterministic parallel control-flow nets, nondeterministic parallel definition-use nets, process dependence nets, and program influence nets.
4. We extended the notion of slicing, which was originally proposed and studied for sequential programs, to concurrent programs and a graph-theoretical approach to slicing concurrent programs.
5. We proposed a number of new complexity metrics for concurrent programs and evaluated a part of them.

Report

(3 results)
  • 1993 Annual Research Report   Final Research Report Summary
  • 1992 Annual Research Report
  • Research Products

    (13 results)

All Other

All Publications (13 results)

  • [Publications] Jingde CHENG: "Task Dependence Net as a Representation for Concurrent Ada Programs" Lecture Notes in Computer Science. 603. 150-164 (1992)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1993 Final Research Report Summary
  • [Publications] Jingde CHENG: "The Task Dependence Net in Ada Software Development" ACM Ada Letters. Vol.12 No.4. 24-35 (1992)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1993 Final Research Report Summary
  • [Publications] Jingde CHENG: "Slicing Concurrent Programs-A Graph-Theoretical Approach" Lecture Notes in Computer Science. 749. 223-240 (1993)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1993 Final Research Report Summary
  • [Publications] Jingde CHENG: "Task Dependence Net as a Representation for Concurrent Ada Programs" Lecture Notes in Compouter Science. Vol.603. 150-164 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1993 Final Research Report Summary
  • [Publications] Jingde CHENG: "The Task Dependence Net in Ada Software Development" ACM Ada Letters. Vol.12, No.4. 24-35 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1993 Final Research Report Summary
  • [Publications] Jingde CHENG: "Slicing Concurrent Programs - A Graph-Theoretical Approach" Lecture Notes in Computer Science. Vol.749. 223-240 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1993 Final Research Report Summary
  • [Publications] Jingde CHENG: "Task Dependence Net as a Representation for Concurrent Ada Programs" Lecture Notes in Computer Science. Vol.603. 150-164 (1992)

    • Related Report
      1993 Annual Research Report
  • [Publications] Jingde CHENG: "The Task Dependence Net in Ada Software Development" ACM Ada Letters. Vol.12 NO.4. 24-35 (1992)

    • Related Report
      1993 Annual Research Report
  • [Publications] Jingde CHENG: "Slicing Concurrent Programs-A Graph-Theoretical Approach" Lecture Notes in Computer Scieence. Vol.749. 223-240 (1993)

    • Related Report
      1993 Annual Research Report
  • [Publications] Jingde CHENG: "Task Dependece Net as a Representation for Concurrent Ada Programs" Lecture Notes in Computer Science. 603. 150-164 (1992)

    • Related Report
      1992 Annual Research Report
  • [Publications] Jingde CHENG: "The Task Dependence Net in Ada Software Development" ACM Ada Letters. 4. 24-35 (1992)

    • Related Report
      1992 Annual Research Report
  • [Publications] Jingde CHENG: "Compiling Programs to Their Dependence-Based Representations" Proc.IEEE TENCON. (1993)

    • Related Report
      1992 Annual Research Report
  • [Publications] J.van Katwijk: "Ada:Moving towards 2000" Springer-Verlag, 324 (1992)

    • Related Report
      1992 Annual Research Report

URL: 

Published: 1992-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi