2009
DOI: 10.1007/978-3-642-00590-9_24
|View full text |Cite
|
Sign up to set email alerts
|

Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services

Abstract: Abstract. Web services are distributed software components, that are decoupled from each other using interfaces with specified functional behaviors. However, such behavioral specifications are insufficient to demonstrate compliance with certain temporal non-functional policies. An example is demonstrating that a patient's health-related query sent to a health care service is answered only by a doctor (and not by a secretary). Demonstrating compliance with such policies is important for satisfying governmental … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 46 publications
0
9
0
Order By: Relevance
“…We model histicated global variable, it is modified between a do not attempt to specify focus on correctness and cts after a service call. posed in [13] employs a ormal methods techniques es. Policies include nony rules that should be mentation.…”
Section: A Contracting Framewo Web Servicmentioning
confidence: 99%
“…We model histicated global variable, it is modified between a do not attempt to specify focus on correctness and cts after a service call. posed in [13] employs a ormal methods techniques es. Policies include nony rules that should be mentation.…”
Section: A Contracting Framewo Web Servicmentioning
confidence: 99%
“…The Tisa language recently proposed in (Rajan et al 2009) employs a similar methodology by applying formal methods techniques to specify temporal service policies. Policies include non-functional regulations and privacy rules that should be maintained by a service implementation.…”
Section: Related Workmentioning
confidence: 99%
“…If a method runs when an event of type p is announced, then its implementation must refine the contract se of the event type p. For example, in Figure 2 the method update on lines 21-26 must refine the contract of the event type Changed on lines 12-17. There are four new expression forms that only appear in contracts: specification expressions, next expressions, abstract invoke expressions, and choice expressions. A specification expression (spec) hides implementation details (i.e., algorithms) and thus abstracts from a piece of code in a conforming implementation [22,24]. The most general form of specification expression is requires sp1 ensures sp2, where sp1 is a precondition expression and sp2 is a postcondition.…”
Section: Figure 4: Syntax For Writing Translucid Contractsmentioning
confidence: 99%
“…The most general form of specification expression is requires sp1 ensures sp2, where sp1 is a precondition expression and sp2 is a postcondition. Such a specification expression hides program details by specifying that a correct implementation contains a refining expression whose body expression, when started in a state that satisfies sp1, will terminate in a state that satisfies sp2 [22,24]. In examples we use the following syntactic sugars: preserves sp for requires sp ensures sp, and establishes sp for requires 1 ensures sp [22].…”
Section: Figure 4: Syntax For Writing Translucid Contractsmentioning
confidence: 99%
See 1 more Smart Citation