Bibliographic Details
| Title: |
Automatic Derivation of Test Cases for LOTOS Expressions with Data Parameters. |
| Authors: |
Xiang Dong Li1, Higashino, Teruo1, Taniguchi, Kenichi1 |
| Source: |
Electronics & Communications in Japan, Part 1: Communications. Mar1994, Vol. 77 Issue 3, p1-14. 14p. |
| Subjects: |
LOTOS (Computer program language), Programming languages, Electronic data processing, Integer programming, Boolean algebra, Algorithms |
| Abstract: |
It is known as generally impossible to generate automatically the test cases for arbitrary LOTOS expression containing data parameters. A subclass of LOTOS, called P-LOTOS, is defined. In P-LOTOS, the data type is restricted to be integer and Boolean and the operation on the integer is restricted to be the addition/subtraction and comparison. This paper presents an algorithm for automatic generation of the test cases for this class of LOTOS descriptions. Algorithms also are presented solving the detection problems for the deadlocks, the unexecutable edges, sad the nondeterministic branches, The proposed algorithm is applied to a simplified OSI session protocol, and the result is reportod in this paper. [ABSTRACT FROM AUTHOR] |
|
Copyright of Electronics & Communications in Japan, Part 1: Communications is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
