2010
DOI: 10.1007/978-3-642-16074-5_4
|View full text |Cite
|
Sign up to set email alerts
|

Modular Plans for Secure Service Composition

Abstract: Abstract. Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from the composition of many services. We address here the problem of statically guaranteeing security of open services, i.e. services with unknown components. Security constraints are expressed by local policies that service components must obey. We present here a type and effect system that safely over-approximates, in the for… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 19 publications
0
7
0
Order By: Relevance
“…During this process, several analysis on the validity of history expressions can be carried out in order to prevent illegal service compositions. For a description of these techniques we refer the interested reader to [4,12]. Example 9.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…During this process, several analysis on the validity of history expressions can be carried out in order to prevent illegal service compositions. For a description of these techniques we refer the interested reader to [4,12]. Example 9.…”
Section: Discussionmentioning
confidence: 99%
“…In this paper we propose an extension of previous work (see [12,13]) on secure service orchestration integrating facilities for composing and verifying security metrics. In particular, we start from the service model proposed by Bartoletti et al [4].…”
Section: Introductionmentioning
confidence: 99%
“…A number of languages for the definition and orchestration of services have been put forward, see, e.g., [6,12,26,9,2]. Some of these frameworks can automatically generate service compositions that satisfy functional or security goals.…”
Section: Related Workmentioning
confidence: 99%
“…Constants for nodes and networks are assigned to distinct identifiers, i.e., positive numbers (lines 2-6), while time constants are mapped to specific, possibly overlapping minutes of the scenario duration (line 8). 12 Functions (lines 10-12) are slightly more complex. They consist of a finite composition of conditional statements (if-then-else, ite) testing the value of (some of) the formal parameters of a function to decide the result.…”
Section: K Otherwisementioning
confidence: 99%
“…However, we argue that their solutions are still incomplete in terms of modeling program behavior as their models take only into account sequences of operations in a program. In our view, program behavior is better represented by a history of states mutated in order during program execution [6]. To be specific, every computational step in a program is a transition from one state to another.…”
Section: Introductionmentioning
confidence: 99%