Monthly Archive for April, 2008

Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance

Niels Lohmann. Correcting deadlocking service choreographies using a simulation-based graph edit distance. In Marlon Dumas, Manfred Reichert, and Ming-Chien Shan, editors, Business Process Management, 6th International Conference, BPM 2008, Milan, Italy, September 1–4, 2008, Proceedings, volume 5240 of Lecture Notes in Computer Science, pages 132–147. Springer-Verlag, September 2008.

finding the most similar correct service

finding the most similar correct service

Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defective services is usually done manually. This paper introduces a graph-based approach to calculate the minimal edit distance between a given defective service and synthesized correct services. This edit distance helps to automatically fix found errors while keeping the rest of the service untouched. A prototypic implementation shows that the approach is applicable to real-life services.

Fixing Deadlocking Service Choreographies Using a Simulation-based Graph Edit Distance

Niels Lohmann. Fixing deadlocking service choreographies using a simulation-based graph edit distance. In Monika Solanki, Barry Norton, and Stephan Reiff-Marganiec, editors, 3rd Young Researchers Workshop on Service Oriented Computing (YR-SOC 2008), June 2008.

Abstract. Many work has been conducted to analyze services and service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defective services is usually done manually. This paper introduces a graph-based approach to calculate the minimal edit distance between a given defective service and synthesized correct services. This edit distance helps to automatically fix found errors while keeping the rest of the service untouched.

Automatic Test Case Generation for Services

Kathrin Kaschner and Niels Lohmann. Automatic test case generation for services. In Monika Solanki, Barry Norton, and Stephan Reiff-Marganiec, editors, 3rd Young Researchers Workshop on Service Oriented Computing (YR-SOC 2008), June 2008.

black box testing for Web services

black box testing for Web services

Abstract. Service-oriented computing (SOC) proposes loosely coupled interacting services as building blocks for distributed applications. This distributed nature makes the guarantee of correctness a challenging task. Based on the specification of a service (the public view), we introduce an approach to automatically generate test cases for black-box testing to check for compliance between the specification and the implementation of a service whose internal behavior might be secret.