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.

No abstract

Recipes on the composition of the “salad of the monks” (Capuchin monks) have been reported in Italy since the 17th century. Different wild edible plants were highly regarded as an important ingredient of this mixed salad. Among these, some species played a key role for both their taste and nutritional properties: Plantago coronopus L. (PC), Rumex acetosa L., Cichorium intybus L., and Artemisia dracunculus L. In the present study, the micromorphological and phytochemical features as well as the antioxidant and anti-inflammatory properties of extracts of these fresh and blanched leaves, were investigated. The extracts obtained by blanched leaves, according to the traditionally used cooking method, showed the highest content of bioactive compounds (total phenols 1202.31–10,751.88 mg GAE/100 g DW; flavonoids 2921.38–61,141.83 mg QE/100 g DW; flavanols 17.47–685.52 mg CE/100 g DW; proanthocyanidins 2.83–16.33 mg CyE/100 g DW; total chlorophyll 0.84–1.09 mg/g FW; carbohydrates 0.14–1.92 g/100 g FW) and possess the most marked antioxidant (IC50 0.30–425.20 µg/mL) and anti-inflammatory activity (IC50 240.20–970.02 µg/mL). Considering this, our results indicate that increased consumption of the investigated plants, in particular of PC, raw or cooked briefly, could provide a healthy food source in the modern diet by the recovery and enhancement of ancient ingredients.

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.