Sound and mechanised compositional verification of input‐output conformance

Sampaio, Augusto; Nogueira, Sidney C.; Mota, Alexandre; Isobe, Yoshinao

doi:10.1002/stvr.1498

Cited by 9 publications

(5 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work [7], [19] explored test generation and compositional verification in the context of CSP, distinguishing input and output events. In those works, a relation cspio was defined and used for test-case generation via counterexamples of refinement in the traces model.…”

Section: Discussionmentioning

confidence: 99%

“…However, no formal account of suspension traces was provided and, as a consequence, no proper treatment of quiescence was given. The work here is a formal basis to justify the syntactic encodings in [7], [19].…”

Section: Discussionmentioning

confidence: 99%

“…S n . We aim to do the same for all other CSP operators, and relax restrictions on input enabledness of the specification, present in current results on compositionality [19], [20].…”

Section: Discussionmentioning

confidence: 99%

See 2 more Smart Citations

A Suspension-Trace Semantics for CSP

Cavalcanti

Hierons

Nogueira

et al. 2016

2016 10th International Symposium on Theoretical Aspects of Software Engineering (TASE)

Self Cite

View full text Add to dashboard Cite

Abstract-CSP is well established as a process algebra for refinement. Most refinement relations for CSP do not differentiate between inputs and outputs, and so are unsuitable for testing. This paper provides CSP with a denotational semantics based on suspension traces; it gives the traditional CSP operators a novel view, catering for the differences between inputs and outputs. We identify healthiness conditions for the suspension-traces model and include a treatment of termination not contemplated in the context of input-output labelled transition systems. Using our suspension-traces semantics, we provide for CSP a characterisation of the conformance relation ioco, which is widely used in testing. Finally, we propose a strategy to mechanise the verification of conformance according to ioco and suspensiontrace refinement using CSP tools. This work provides the basis for a theory of testing for CSP with inputs and outputs, and opens up the possibility of studying algebraic laws and compositional reasoning techniques based on ioco. Ultimately, it contributes to making CSP models useful for both design and testing of systems.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A Suspension-Trace Semantics for CSP

Cavalcanti

Hierons

Nogueira

et al. 2016

2016 10th International Symposium on Theoretical Aspects of Software Engineering (TASE)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Yet, when a CSP model is available, the possibility of using it for testing is attractive. In fact, CSP has a testing theory [7], and, more recently, its use as part of testing techniques has been explored [9,24,30,35].…”

Section: Introductionmentioning

confidence: 99%

Inputs and Outputs in CSP

Cavalcanti

Hierons

Nogueira

2020

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

This paper addresses refinement and testing based on CSP models, when we distinguish input and output events. In a testing experiment, the tester (or the environment) controls the inputs, and the system under test controls the outputs. The standard models and refinement relations of CSP, however, do not differentiate inputs and outputs and are not, therefore, entirely suitable for testing. Here, we consider an alphabet of events partitioned into inputs and outputs, and present a novel refusal-testing model for CSP with a notion of input-output refusal-traces refinement. We compare that with the ioco relation often used in testing, and find that it is more widely applicable and stronger. This means that mistakes found using traditional ioco testing do indicate mistakes in the development. Finally, we provide a CSP testing theory that takes into account inputs and outputs. With our theory, it becomes feasible to develop techniques and tools for automatic generation of realistic and sound tests from CSP models. Our work reconciles the normally disparate areas of refinement and (formal) testing by identifying how ioco testing can be used to inform refinement-based results, and vice-versa. CCS Concepts: • Software and its engineering ✙ Formal methods; Software testing and debugging; • Computing methodologies ✙ Concurrent computing methodologies;

show abstract

“…The overall approach is based on the CSP process algebra, which offers rich semantic models that support a wide range of process verification, and comparisons. In fact, CSP has shown to be very useful to support the rigorous development of component based systems, as a hidden formalism for modelling languages used in practice [RSM06,SNMI14]. Nevertheless, the same principles can be transferred to other formal models, and support the implementation of practical tools for component-based development.…”

Section: Introductionmentioning

confidence: 99%

Rigorous development of component-based systems using component metadata and patterns

et al. 2016

View full text Add to dashboard Cite

In previous work we presented a CSP-based systematic approach that fosters the rigorous design of component-based development (CBD). Our approach is strictly defined in terms of composition rules, which are the only permitted way to compose components. These rules guarantee the preservation of properties (particularly deadlock-freedom) by construction in component composition. Nevertheless, their application is allowed only under certain conditions whose verification via model checking turned out impracticable even for some simple designs, and particularly those involving cyclic topologies. In this paper, we address the performance of the analysis and present a significantly more efficient alternative to the verification of the rule side conditions, which are improved by carrying out partial verification on component metadata throughout component compositions and by using behavioural patterns. The use of metadata, together with behavioural patterns, demands new composition rules, which allow previous exponential time verifications to be carried out now in linear time. Two case studies (the classical dining philosophers, also used as a running example, and an industrial version of the leadership election algorithm) are presented to illustrate and validate the overall approach.

show abstract

Sound and mechanised compositional verification of input‐output conformance

Cited by 9 publications

References 39 publications

A Suspension-Trace Semantics for CSP

A Suspension-Trace Semantics for CSP

Inputs and Outputs in CSP

Rigorous development of component-based systems using component metadata and patterns

Contact Info

Product

Resources

About