Assertion Verification Design by Active Function.

• WATANABE Katsumasa

  Nara Institute of Science and Technology

• INOUE Akihiro

  Nara Institute of Science and Technology

• TOMONO Mitsuru

  Nara Institute of Science and Technology

• KURAKAWA Kei

  Nara Institute of Science and Technology

• NAKANISHI Masaki

  Nara Institute of Science and Technology

• YAMASITA Shigeru

  Nara Institute of Science and Technology

Bibliographic Information

Other Title

• 続・システム検証の科学技術　　能動関数によるアサーション検証設計
• 能動関数によるアサーション検証設計
• ノウドウ カンスウ ニ ヨル アサーション ケンショウ セッケイ

Abstract

It is not easy to test the programs satisfactorily which are large in size and complex in flow of control. In order to show the correctness of a running program, we could embed the assertion in the program which denotes the properties and conditions of the program at a given timing.<BR>In this paper, we use Hoare's notation P{Q}R and extend the software design method with pre-check {∼P}, and post-check {∼R}. We realize these facilities to check condition as Active Software with Active Functions. Each active function has a condition which activates the function. The body of an active function is executed whenever the value of its condition becomes true at runtime.<BR>By means of this design method, we are able not only to assure the correctness of running programs, but also to construct stable programs adaptable to the change of software specification. We also propose a new computer architecture suitable to execute programs with active functions efficiently.

Journal

• Computer Software

  Computer Software 22 (3), 76-91, 2005

  Japan Society for Software Science and Technology

Details

• CRID: 1390001204738279808
• NII Article ID: 110008016661
• NII Book ID: AN10075819
• DOI: 10.11309/jssst.22.3_76
• NDL BIB ID: 7832267
• ISSN: 02896540
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I7832267
• Text Lang: ja
• Data Source:
  • JaLC
  • NDL
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed