Rapid Prototyping of a Semantically Well Founded Circus Model Checker

Mota, Alexandre; Farias, Adalberto; Didier, André; Woodcock, Jim

doi:10.1007/978-3-319-10431-7_17

Cited by 9 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is not the objective of our work to develop one (and there are ongoing efforts [51,52] in this direction). However, for some Circus specifications, we can overcome this barrier via a translation of Circus models to CSP and the use of a well-known, mature 660 refinement checker for CSP, FDR [53].…”

Section: Tool Supportmentioning

confidence: 99%

See 1 more Smart Citation

Formal mutation testing for

Alberto

Cavalcanti

Gaudel

et al. 2017

Information and Software Technology

View full text Add to dashboard Cite

Context: The demand from industry for more dependable and scalable test-development mechanisms has fostered the use of formal models to guide the generation of tests. Despite many advancements having been obtained with state-based models, such as Finite State Machines (FSMs) and Input/Output Transition Systems (IOTSs), more advanced formalisms are required to specify large, state-rich, concurrent systems. Circus, a state-rich process algebra combining Z, CSP and a refinement calculus, is suitable for this; however, deriving tests from such models is accordingly more challenging. Recently, a testing theory has been stated for Circus, allowing the verification of process refinement based on exhaustive test sets. Objective: We investigate fault-based testing for refinement from Circus specifications using mutation. We seek the benefits of such techniques in test-set quality assertion and fault-based test-case selection. We target results relevant not only for Circus, but to any process algebra for refinement that combines CSP with a data language. Method: We present a formal definition for fault-based test sets, extending the Circus testing theory, and an extensive study of mutation operators for Circus. Using these results, we propose an approach to generate tests to kill mutants. Finally, we explain how prototype tool support can be obtained with the implementation of a mutant generator, a translator from Circus to CSP, and a refinement checker for CSP, and with a more sophisticated chain of tools that support the use of symbolic tests. Results: We formally characterise mutation testing for Circus, defining the exhaustive test sets that can kill a given mutant. We also provide a technique to select tests from these sets based on specification traces of the mutants. Finally, we present mutation operators that consider faults related to both reactive and data manipulation behaviour. Altogether, we define a new fault-based test-generation technique for Circus. Conclusion: We conclude that mutation testing for Circus can truly aid making test generation from state-rich model more tractable, by focussing on particular faults.

show abstract

Section: Tool Supportmentioning

confidence: 99%

“…More details about the ERS can be found in [78]. It is used in [52] to assess the deadlock detection of a prototype model checker for Circus.…”

Section: Appendix B Emergency Response Systemmentioning

confidence: 99%

Formal mutation testing for

Alberto

Cavalcanti

Gaudel

et al. 2017

Information and Software Technology

View full text Add to dashboard Cite

show abstract

“…For (4), the specication must be captured as an expression in temporal logic; LTL is commonly used [3], with its operators such as eventually and henceforth. A model checker, such as PAT [31] or the CML model checker [34],…”

Section: Vmspec = Noloss and Fairmentioning

confidence: 99%

Contracts in CML

Woodcock

Cavalcanti

Fitzgerald

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We describe the COMPASS Modelling Language (CML), which is used to model large-scale Systems of Systems and the contracts that bind them together. The language can be used to document the interfaces to constituent systems using formal, precise, and veriable specications including preconditions, postconditions, and invariants. The semantics of CML directly supports the use of these contracts for all language constructs, including the use of communication channels, parallel processes, and processes that run forever. Every process construct in CML has an associated contract, allowing clients and suppliers to check that the implementations of constituent systems conform to their interface specications.

show abstract

“…More details about the ERS can be found in (ANDREWS et al, 2013a). It is used in (MOTA et al, 2014) to assess the deadlock detection of a prototype model checker for Circus.…”

Section: Emergency Response System Specification Examplementioning

confidence: 99%

“…For Circus, there is no mature refinement model checker available at this time and is out of the scope of this work to develop one. Moreover, there are ongoing efforts (FREITAS, 2006;MOTA et al, 2014) in this direction. However, for some Circus specifications, we can detour from this barrier via a translation of Circus models to CSP and benefit from the well established refinement checker for CSP M .…”

Section: Theory Validation By Csp Refinement Checkingmentioning

confidence: 99%

Formal mutation testing in Circus process algebra

Alberto¹

View full text Add to dashboard Cite

P ROCESS algebras are a family of techniques used in formal specification and analysis of computer systems, specially when independent processes that perform and synchronize in parallel are concerned. The so-called concurrent systems. Circus is a process algebra that aggregates the expressiveness power for concurrent behaviors from CSP, along with the predicative data modelling aspects of Z. Recent publications have established a formal exhaustive symbolic testing theory for specifications modelled in Circus. Aiming to improve the feasibility of applying such tests in practical scenarios, it is convenient to look for criteria that reduces the number of test cases which, by the exhaustive nature of the approach, is often infinite. In the light of this, the work we present proposes the application of mutation testing techniques in Circus specifications, targeting the coverage of faults seeded by well-known mutation operators, along with operators designed with the particularities of the language in mind. Some contributions were produced in the pursuit of these goals, such as establishing a formal theory for mutation testing in Circus specifications and the implementation of a symbolic traces generator for the language.

show abstract

Rapid Prototyping of a Semantically Well Founded Circus Model Checker

Cited by 9 publications

References 14 publications

Formal mutation testing for

Formal mutation testing for

Contracts in CML

Formal mutation testing in Circus process algebra

Contact Info

Product

Resources

About