Test sets generation from algebraic specifications using logic programming
Journal of Systems and Software
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
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
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Testing Processes from Formal Specifications with Inputs, Outputs and Data Types
ISSRE '02 Proceedings of the 13th International Symposium on Software Reliability Engineering
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
More Relational Concurrent Refinement: Traces and Partial Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Aspects of Computing
Formal Aspects of Computing
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Specification coverage for testing in circus
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Unifying theories in Isabelle/HOL
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
FM'11 Proceedings of the 17th international conference on Formal methods
| Hi-index | 0.00 |
There is a close relation between the failures-divergences and the UTP models of CSP, but they are not equivalent. For example, miracles are not available in the failures-divergences model; the UTP theory is richer and can be used to give semantics to data-rich process algebras like Circus. Previously, we have defined functions that calculate the failures-divergences model of a CSP process characterised by a UTP relation. In this note, we use these functions to calculate the UTP characterisations of traces refinement and of the conf relation that is widely used in testing. In addition, we prove that the combination of traces refinement and conf corresponds to refinement of processes in Circus. This result is the basis for a formal testing technique based on Circus; as usual in testing, we restrict ourselves to divergence-free processes.