arrow
Return

A Logical Verification Methodology for Service-Oriented Computing

delete2012-07-03
delete17
delete
OA
AI
A
Alessandro Fantechi *
S
Stefania Gnesi
A
Alessandro Lapadula
F
Franco Mazzanti
R
Rosario Pugliese
F
Francesco Tiezzi
DOI:10.1145/2211616.2211619delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We introduce a logical verification methodology for checking behavioral properties of service-oriented computing systems. Service properties are described by means of SocL, a branching-time temporal logic that we have specifically designed for expressing in an effective way distinctive aspects of services, such as, acceptance of a request, provision of a response, correlation among service requests and responses, etc. Our approach allows service properties to be expressed in such a way that they can be independent of service domains and specifications. We show an instantiation of our general methodology that uses the formal language COWS to conveniently specify services and the expressly developed software tool CMC to assist the user in the task of verifying SocL formulas over service specifications. We demonstrate the feasibility and effectiveness of our methodology by means of the specification and analysis of a case study in the automotive domain.
Keywords:
Languages
Theory
Verification
Service-oriented computing
Web services
formal methods
process calculi
model checking
temporal logic
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

A
ACM Transactions on Software Engineering and Methodology
IF:
6.2
Papers:
1.2K
Citations:
3.4K

Organization

U
university of florence
Scholars:
4.2W
Papers: 3.1W
Citations: 42
C
consiglio nazionale delle ricerche (cnr)
Scholars:
6.2W
Papers: 5.7W
Citations: 48