Theoretical Computer Science
Efficient online monitoring of web-service SLAs
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Efficient traces' collection mechanisms for passive testing of Web Services
Information and Software Technology
Passive Testing of Timed Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Towards Automated WSDL-Based Testing of Web Services
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
On-The-Fly Model-Based Testing of Web Services with Jambition
Web Services and Formal Methods
Automatically Deriving Choreography-Conforming Systems of Services
SCC '09 Proceedings of the 2009 IEEE International Conference on Services Computing
A passive testing approach based on invariants: application to the WAP
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Formal Framework for Service Orchestration Testing Based on Symbolic Transition Systems
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Supporting the Extraction of Timed Properties for Passive Testing by Using Probabilistic User Models
QSIC '09 Proceedings of the 2009 Ninth International Conference on Quality Software
Formal Passive Testing of Service-Oriented Systems
SCC '10 Proceedings of the 2010 IEEE International Conference on Services Computing
| Hi-index | 0.00 |
This paper presents a methodology to perform passive testing based on invariants of distributed systems with time information. This approach is supported by the following idea: A set of invariants represents the most relevant expected properties of the implementation under test. Intuitively, an invariant expresses the fact that each time the system under test performs a given sequence of actions, then it must exhibit a behavior reflected in the invariant. We call these invariants local because they only check the correctness of the logs that have been recorded in each isolated system. We discuss the type of errors that are undetectable by using only local invariants. In order to cope with these limitations, this paper introduces a new family of invariants, called globals to deal with more subtle characteristics. They express properties of a set of systems, by making relations between the set of recorded local logs. In addition, we show that global invariants are able to detect the class of undetected errors for local invariants.