• DocumentCode
    2843805
  • Title

    How to make concurrent programs highly reliable-more than state space analysis

  • Author

    Uchihira, Naoshi

  • Author_Institution
    Syst. & Software Res. Lab., Toshiba Corp., Kawasaki, Japan
  • fYear
    1998
  • fDate
    23-26 Mar 1998
  • Firstpage
    16
  • Lastpage
    23
  • Abstract
    Several approaches to making concurrent programs highly reliable are surveyed. State space analysis including model checking is the most promising formal verification approach for concurrent programs. However, it is not the only such method for actual program development. The paper focuses on harmful nondeterministic behaviors of concurrent programs and introduces three advanced approaches (testing with verification, program adjustment, and hypersequential programming) to detect and remove them, which provide more than state space analysis. We also show our projects and tools going along with these approaches
  • Keywords
    parallel programming; program testing; program verification; software reliability; advanced approaches; formal verification approach; harmful nondeterministic behaviors; highly reliable concurrent programs; hypersequential programming; model checking; program adjustment; state space analysis; testing; Binary decision diagrams; Bismuth; Computer bugs; Laboratories; Logic; Rail to rail inputs; Software systems; State-space methods; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application of Concurrency to System Design, 1998. Proceedings., 1998 International Conference on
  • Conference_Location
    Fukushima
  • Print_ISBN
    0-8186-8350-3
  • Type

    conf

  • DOI
    10.1109/CSD.1998.657535
  • Filename
    657535