Test sets generation from algebraic specifications using logic programming
Journal of Systems and Software
An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
Test Generation from LOTOS Specifications
IEEE Transactions on Computers - Special issue on protocol engineering
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Dataflow oriented test selection for LOTOS
Computer Networks and ISDN Systems
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Data Abstraction, Implementation, Specification, and Testing
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Discipline of Programming
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
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
On the testability of SDL specifications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new foundation for control dependence and slicing for modern program structures
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
A Theory of Pointers for the UTP
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Slicing communicating automata specifications: polynomial algorithms for model reduction
Formal Aspects of Computing
Formal Aspects of Computing
A process algebraic framework for specification and validation of real-time systems
Formal Aspects of Computing
Slotted-circus: a UTP-family of reactive theories
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on 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
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
| Hi-index | 0.00 |
The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing for Circus; it gives a symbolic characterisation of tests. Each symbolic test specifies constraints that capture the effect of the possibly nondeterministic state operations, and their interaction. This is a sound basis for testing techniques based on constraint solving for generation of concrete tests, but does not support well selection criteria based on the structure of the specification. We present here a labelled transition system that captures information about a Circus model and its structure. It is useful for testing techniques based on specification coverage. The soundness argument for the new transition system follows the UTP style, but relates the new transition relation to the Circus relational model and its operational semantics.