2012
DOI: 10.1007/978-3-642-27269-1_7
|View full text |Cite
|
Sign up to set email alerts
|

Model Checking Adaptive Multilevel Service Compositions

Abstract: Abstract. In this paper we present a logic-based technique for verifying both security and correctness properties of multilevel service compositions. We define modal µ-calculus formulae interpreted over service configurations. Our formulae characterize those compositions which satisfy a non-interference property and are compliant, i.e., are both deadlock and livelock free. Moreover, we use filters as prescriptions of behavior (coercions to prevent service misbehavior) and we devise a model checking algorithm f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 21 publications
0
9
0
Order By: Relevance
“…Test cases were used to verify whether the implementation of Web services meet pre-specified BPEL behavior. Rossi [47] proposed a model checking algorithm for adaptive service compositions. She employed a logic-based technique for verification of security and correctness properties using modal µ-calculus.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Test cases were used to verify whether the implementation of Web services meet pre-specified BPEL behavior. Rossi [47] proposed a model checking algorithm for adaptive service compositions. She employed a logic-based technique for verification of security and correctness properties using modal µ-calculus.…”
Section: Related Workmentioning
confidence: 99%
“…She employed a logic-based technique for verification of security and correctness properties using modal µ-calculus. Collectively, we differ from all the said model checking based techniques [33], [12], [44], [45], [46], [47] in that our verification technique employ possible trace-based phenomenon for verification instead of classical possible-world phenomenon and explicit system modeling (specifications of the system provided by the designer) is not required.…”
Section: Related Workmentioning
confidence: 99%
“…Nakajima [11] verifies the information flow of composite services in BPEL (Business Process Execution Language) based on model checking. Rossi et al [12] expand Nakajima's model [11] to support more flexible and dynamic security policies rather than security labels based on a simple lattice-based model. The contributions using type system and program analysis mainly focus on the information flow enforcement on programming languages, while model checking can be used to validate both programs and models in abstract forms.…”
Section: Introductionmentioning
confidence: 99%
“…So when user's initial inputs change, the verification process needs to be rebuilt, which brings extra cost for the secure service composition. Although model checking [11,12,15] can be used to analyze secure information flow precisely, the traditional model checking approaches must perform a global verification on the composite service. It is impractical to employ a centralized entity in multiple clouds to verify the information flow security in a global way.…”
Section: Introductionmentioning
confidence: 99%
“…This paper revises the work in [20] and extends it to include a new, more expressive version of the calculus, proofs of the main results, an updated analysis of related work, as well an analysis of the effectiveness of our verification techniques on a realistic case study.…”
Section: Introductionmentioning
confidence: 99%