Communicating sequential processes
Communicating sequential processes
Test sets generation from algebraic specifications using logic programming
Journal of Systems and Software
The Z notation: a reference manual
The Z notation: a reference manual
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Journal of Systems and Software - Special issue on applying specification, verification, and validation techniques to industrial software systems
The ASTOOT approach to testing object-oriented programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
An experiment in automatic generation of test suites for protocols with verification technology
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Data Abstraction, Implementation, Specification, and Testing
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Test Generation with Inputs, Outputs, and Quiescence
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Automating Test Case Generation from Z Specifications with Isabelle
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Automating the Generation and Sequencing of Test Cases from Model-Based Specifications
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Test Automation for Safety-Critical Systems: Industrial Application and Future Developments
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Unit Testing for C88 ASL Architectural Specifications
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Challenging Formal Specifications by Mutation: a CSP security example
APSEC '03 Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Controlling test case explosion in test generation from B formal models: Research Articles
Software Testing, Verification & Reliability
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Guided Test Generation from CSP Models
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Compositional Verification of Input-Output Conformance via CSP Refinement Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A note on traces refinement and the conf relation in the unifying theories of programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Testing techniques in software engineering
Testing techniques in software engineering
Specification coverage for testing in circus
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Conformance relations for distributed testing based on CSP
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Global and local testing from Message Sequence Charts
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Testing with inputs and outputs in CSP
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Hi-index | 0.00 |
CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective tool have encouraged much work on algebraic reasoning and model checking. Testing techniques based on CSP, however, have not been widely explored, and in this paper we take a first step by instantiating Gaudel et al's theory of formal testing to CSP. We identify the testability hypothesis that we consider necessary to use CSP models as a basis for testing. We also define test sets that we prove to be exhaustive with respect to traces and failures refinement, and consider optimisations, inputs and outputs, and selection strategies. Our results are proved in terms of the CSP denotational models; they are a sound foundation for the development of test-generation techniques.