Automated Boundary Testing from Z and B

Legeard, Bruno; Peureux, Fabien; Utting, Mark

doi:10.1007/3-540-45614-7_2

Cited by 70 publications

(50 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5 scheduler0.mch and scheduler1.ref are the machines presented in [15]. The scheduler machine is a variation of scheduler0.mch, and is taken from [13]. In all the schedulers the deferred sets are the process identifiers.…”

Section: Resultsmentioning

confidence: 99%

Symmetry Reduction for B by Permutation Flooding

Leuschel

Butler

Spermann

et al. 2006

B 2007: Formal Specification and Development in B

View full text Add to dashboard Cite

Abstract. Symmetry reduction is an established method for limiting the amount of states that have to be checked during exhaustive model checking. The idea is to only verify a single representative of every class of symmetric states. However, computing this representative can be nontrivial, especially for a language such as B with its involved data structures and operations. In this paper, we propose an alternate approach, called permutation flooding. It works by computing permutations of newly encountered states, and adding them to the state space. This turns out to be relatively unproblematic for B's data structures and we have implemented the algorithm inside the ProB model checker. Empirical results confirm that this approach is effective in practice; speedups exceed an order of magnitude in some cases. The paper also contains correctness results of permutation flooding, which should also be applicable for classical symmetry reduction in B.

show abstract

Section: Resultsmentioning

confidence: 99%

Symmetry Reduction for B by Permutation Flooding

Leuschel

Butler

Spermann

et al. 2006

B 2007: Formal Specification and Development in B

View full text Add to dashboard Cite

show abstract

“…Quality of the results was evaluated with statement and branch coverage and mutation analysis [25] metrics. Evaluation of BETA showed that the test scenarios it generates for the different criteria follow theoretical expectations in terms of criteria subsumption 1 . It also indicated that the BETA implementation of logical criteria generates more efficient test sets regarding code and mutation coverage than the input space partitioning ones.…”

Section: Contributionsmentioning

confidence: 90%

“…The closest ones are probably BZ-TT/LTG. BZ-testing-tools [1] is based on boundary value analysis of B and Z specifications, and LEIRIOS test generator 7 [2,3] is an industrial and commercial tool which derived from BZ-TT, supporting new features such as logical criteria and UML inputs. In BZ-TT, the goal is to test every operation of the system at every reachable boundary state, which is a system state where at least one of the state variables has a maximum or minimum boundary value, while LEIRIOS test generator (LTG) offers more flexible goals.…”

Section: Related Workmentioning

confidence: 99%

“…Formal methods and software testing are two techniques with this purpose. Many researchers have tried to combine these two techniques to take advantage of their most interesting aspects ( [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]). This combination can bring benefits such as reduction of development costs through the application of verification techniques in the initial development phases, when faults are cheaper to be fixed, and automatic generation of tests from formal specifications [17].…”

Section: Introductionmentioning

confidence: 99%

“…This combination can bring benefits such as reduction of development costs through the application of verification techniques in the initial development phases, when faults are cheaper to be fixed, and automatic generation of tests from formal specifications [17]. Generating test cases from formal *Correspondence: ernestocid@ppgsc.ufrn.br 1 Department of Informatics and Applied Mathematics -DIMAp, Federal University of Rio Grande do Norte, Natal RN, Brazil Full list of author information is available at the end of the article specifications is very convenient. Since these specifications usually state the software requirements in a complete and unambiguous way, they can be a good source to generate test cases.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An empirical study of test generation with BETA

2016

View full text Add to dashboard Cite

Background: BETA (Bbased testing approach) is a toolsupported approach to generate test cases from Bmethod specifications through the application of input space partitioning and logical coverage criteria. The BETA tool automates the whole process, from the design of abstract test cases to the generation of executable test scripts. Methods: In this paper, we present an empirical study that was performed to evaluate and contribute to the development of BETA. The study evaluated the applicability of BETA on problems with different characteristics and used techniques of code coverage and mutation analysis to measure the quality of the generated test cases. The study was carried out in different rounds, and the results of each round were used as a reference for the improvement of the approach and its supporting tool. Results: These case studies were relevant not only for the evaluation of BETA but also to evaluate how different features affect the usability of the approach and the quality of the test cases and to compare the quality of the test cases generated using different coverage criteria. Conclusions:The results of this study showed that (1) BETAgenerated test scenarios for the different criteria follow theoretical expectations in terms of criteria subsumption; (2) the BETA implementation of the logical criteria generates more efficient test sets regarding code and mutation coverage than the input space partitioning ones; (3) it is important to go beyond the strict requirements of the criteria by adding some additional variation (randomization) of the input data; and (4) the algorithms designed to combine test requirements into test cases need to deal carefully with infeasible (logically unsatisfiable) combinations.

show abstract

Generating Random Values Using Binary Decision Diagrams and Convex Polyhedra

Jahier¹,

Raymond²

2007

Trends in Constraint Programming

View full text Add to dashboard Cite

This article describes algorithms to solve Boolean and numerical constraints, and to randomly select values among the set of solutions. Those algorithms were first designed to generate inputs for testing and simulating reactive real-time programs. As a consequence, the chose a solving technology that allow a fine control in the way solutions are elected. Indeed, a fair selection is sometimes required, while favoring limit cases is often interesting for testing. Moreover, simulating a single reactive execution means generating several hundreds or even several thousands of atomic steps, and thus as many solving steps. Hence, the emphasis is put on efficiency, sometimes sacrificing precision or fairness.

show abstract

Automated Boundary Testing from Z and B

Cited by 70 publications

References 8 publications

Symmetry Reduction for B by Permutation Flooding

Symmetry Reduction for B by Permutation Flooding

An empirical study of test generation with BETA

Generating Random Values Using Binary Decision Diagrams and Convex Polyhedra

Contact Info

Product

Resources

About