Specification of an integrated circuit card protocol application using the B method and linear temporal logic

Julliand, Jacques; Legeard, Bruno; Machicoane, Thierry; Parreaux, Benoît; Tatibouët, Bruno

doi:10.1007/bfb0053367

Cited by 5 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For simplicity, the B-TESTING-TOOLS environment does not deal with the composition of B machines. This is not too restrictive; in various case studies (process scheduler [17], protocol T = 1 [24] or the GSM application discussed in this paper), this practice was convenient and gave good results.…”

Section: Testing Framework With B-testing-toolsmentioning

confidence: 98%

Generation of test sequences from formal specifications: GSM 11‐11 standard case study

et al. 2004

Self Cite

View full text Add to dashboard Cite

This paper presents the results of a case study on generating test cases for a fragment of the smart card GSM 11-11 standard. The generation method is based on an original approach using the B notation and techniques of constraint logic programming with sets. The GSM 11-11 technical specifications were formalized with the B notation. From this B specification, a system of constraints was derived, equivalent to this formal model. Using a set constraint solver, boundary states were computed and test cases were obtained by traversing the constrained reachability graph of the specifications. The purpose of this project was to evaluate the contribution of this testing environment, called B-TESTING-TOOLS, in an industrial process on a real life-size application, by comparing the generated test sequences with the already used and high-quality manually-designed tests. This comparison enabled us to validate our approach and showed its effectiveness in the validation process of critical applications: the case study gives a wide coverage (about 85%) of the generated tests compared to the pre-existing tests and a saving of 30% in test design time.the specifications are implemented exactly as expected. In application domains of critical software, i.e. software, avionics, railway signalling, automotive control and management systems, secure smart card applications, etc., more than 50% of the development is devoted to the validation of the software product. Testing is performed by applying test cases to an implementation under test, by making observations during the execution of the tests, and by subsequently assigning a verdict on the correct execution of the implementation. The design of black-box tests in industry is seldom supported by tools and relies on the expertise of validation engineers. Consequently, there is considerable subjectivity exercised in created test sets. The manual design of functional black-box tests is generally based around an informal review of the system specification.The need to offer better methods and tools for functional black-box testing has given rise to a large amount of research on generating tests from formal specifications, e.g. [1][2][3]. Formal methods of specification, particularly model-oriented notations such Z [4], VDM [5] and B [6], allow a high-level abstract formalization of the expected behaviour of the system under test. These notations are well suited for test generation because the expressiveness of set-oriented logic constructs and the definition of an explicit model help both test case generation and oracle synthesis. Thus, these formal notations are the basis of various proposals to more or less automatically generate tests from the formal model, see for example [7][8][9][10][11].In [12][13][14], we presented a new method for automated test generation from B abstract machines using constraint logic programming [15], called B-TESTING-TOOLS. From the B formal model of the functional requirements of the system to be tested, an equivalent system of constraints is derived and, th...

show abstract

Section: Testing Framework With B-testing-toolsmentioning

confidence: 98%

Generation of test sequences from formal specifications: GSM 11‐11 standard case study

et al. 2004

Self Cite

View full text Add to dashboard Cite

show abstract

“…The robot's example is voluntarily simple. We have studied the modular refinement relation about less trivial applications such as the protocol T = 1 [13], a BRP protocol [5] and so on.…”

Section: Examplementioning

confidence: 99%

Ready-Simulation Is Not Ready to Express a Modular Refinement Relation

Bellegarde

Julliand

Kouchnarenko

2000

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

The B method has been successfully used to specify many industrial applications by refinement. Previously, we proposed enriching the B event systems by formulating its dynamic properties in LT L. This enables us to combine model-checking with theorem-proving verification technologies. The model-checking of LT L formulae necessitates that the B event system semantics is a transition system. In this paper, we express the refinement relation by a relationship between transition systems. A result of our study shows that this relation is a special kind of simulation allowing us to exploit the partition of the reachable state space for a modular verification of LT L formulae. The results of the paper allow us to build a bridge between the above view of the refinement and the notions of observability characterized as simulation relations by Milner, van Glabbeek, Bloom and others. The refinement relation we define in the paper is a ready-simulation generalization which is similar to the refusal simulation of Ulidowsky. The way the relation is defined allows us to obtain a compositionality result w.r.t. parallel composition operation. For complex systems, it is important in practice to associate a design by refinement with a design by a parallel composition of their components. This refinement relation has two main applications: it allows the splitting of the refined transition system into modules; it allows the construction of complex systems by a parallel composition of components. It makes sense to qualify the refinement relation as being modular.

show abstract