Communicating sequential processes
Communicating sequential processes
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
The RAISE specification language
The RAISE specification language
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
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
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Mutation testing for the new century
Mutation testing for the new century
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Towards a Time Model for Circus
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Testing Concurrent Systems: A Formal Approach
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
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
From Testing Theory to Test Driver Implementation
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
An Approach to Symbolic Test Generation
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
An Overview of Lutess: A Specification-Based Tool for Testing Synchronous Software
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
Introduction: Service-oriented computing
Communications of the ACM - Service-oriented computing
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Test Case Generation by OCL Mutation and Constraint Solving
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
rCOS: a refinement calculus of object systems
Theoretical Computer Science - Components and objects
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
A Denotational Semantics for Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing Programs with the Aid of a Compiler
IEEE Transactions on Software Engineering
Language and Automata Theory and Applications
Formal Aspects of Computing
Fault-Based Test Case Generation for Component Connectors
TASE '09 Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
An Integrated Development Environment for Pattern Matching Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
The science of killing bugs in a black box
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Model-based mutation testing of reactive systems: from semantics to automated test-case generation
Theories of Programming and Formal Methods
Hi-index | 0.00 |
Over the past years, the need for high-confidence coordination mechanisms has intensified as new technologies have appeared for the development of service-oriented applications, making formalization of coordination mechanisms critical. Unifying Theories of Programming (UTP) provide a formal semantic foundation not only for programming languages but also for various expressive specification languages. A key concept in UTP is design: the familiar pre/post-condition pair that describes a contract. In this paper we use UTP to formalize Reo connectors, whereby connectors are interpreted as designs in UTP. This model can be used as a semantic foundation for proving properties of connectors, such as equivalence and refinement relations between connectors. Furthermore, it can be used as a reference document for developing tool support for Reo, such as test case generators. A fault-based method to generate test cases for component connectors from specifications is also provided in this paper. For connectors, faults are caused by possible errors during the development process, such as wrongly used channels, missing or redundant subcircuits, or circuits with wrongly constructed topology. We give test cases and connectors a unifying formal semantics by using the notion of design in UTP, and generate test cases by solving constraints obtained from a specification and a faulty implementation. A prototype serves to demonstrate the automatization of the approach.