Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters

We propose an automatic analysis and test case derivation method for LOTOS expressions with data values. We introduce the class of P-LOTOS expressions where the data types are restricted to Presburger arithmetic. That is, only the integer and Boolean types are used, and the operators of the integers are restricted to addition, subtraction, and comparison. For this class, we give an algorithm for deriving a set of test cases (a test suite). The algorithm is carried out by using a decision procedure for integer linear programming problems. We also give solutions for the deadlock detection problem, the detection of nonexecutable branches, and the detection of nondeterministic behaviors. We have implemented a tool for the analysis and test selection based on our techniques. The derivation of a test suite for a simplified Session protocol is described as an example. >

[1]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[2]  Jan Willem Klop,et al.  Term rewriting systems: a tutorial , 1987 .

[3]  Teruo Higashino,et al.  VTM: A Graph Editor for Large Trees , 1992, IFIP Congress.

[4]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[5]  Gregor von Bochmann.  Protocol Specification for OSI , 1989, Comput. Networks ISDN Syst..

[6]  Gregor von Bochmann,et al.  Testing Non-Deterministic State Machines with Fault Coverage , 1991, Protocol Test Systems.

[7]  Gregor von Bochmann,et al.  A Test Design Methodology for Protocol Testing , 1987, IEEE Transactions on Software Engineering.

[8]  Teruo Higashino,et al.  Test System for a Restricted Class of LOTOS Expressions with Data Parameters , 1992, Protocol Test Systems.

[9]  Derek C. Oppen,et al.  A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..

[10]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[11]  Behçet Sarikaya,et al.  Test Generation from Protocol Specification , 1989, FORTE.

[12]  Stefania Gnesi,et al.  How Expressive Are LOTOS Behaviour Expressions? , 1990, FORTE.

[13]  Henk Eertink,et al.  Symbolic execution of LOTOS specifications , 1992, Formal Techniques for (Networked and) Distributed Systems.

[14]  Jan Tretmans.  Test Case Derivation from LOTOS Specifications , 1989, FORTE.

[15]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[16]  Rom Langerak.  A Testing Theory for LOTOS using Deadlock Detection , 1989, PSTV.

[17]  Luigi Logrippo,et al.  Derivation of Useful Execution Trees from LOTOS by using an Interpreter , 1988, Formal Techniques for (Networked and) Distributed Systems.

[18]  Y. Chen.  [The change of serum alpha 1-antitrypsin level in patients with spontaneous pneumothorax]. , 1995, Zhonghua jie he he hu xi za zhi = Zhonghua jiehe he huxi zazhi = Chinese journal of tuberculosis and respiratory diseases.

[19]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[20]  Teruo Higashino,et al.  Automated Verification of Equivalence of Protocol Machines , 1989, PSTV.

[21]  Jan Tretmans,et al.  A Formal Approach to Conformance Testing , 1993, Protocol Test Systems.

[22]  Luigi Logrippo,et al.  Derivation of Test Cases for LAP-B from a LOTOS Specification , 1989, FORTE.

[23]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[24]  Michel Diaz,et al.  Formal Description Technique Estelle: Results of the Esprit Sedos Project , 1989 .

[25]  Clazien D. Wezeman.  The CO-OP Method for Compositional Derivation of Conformance Testers , 1989, PSTV.