ACM Home Page
Please provide us with feedback. Feedback
Verification of communicating data-driven web services
Full text PdfPdf (178 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Chicago, IL, USA
SESSION: Analysis of queries and workflows table of contents
Pages: 90 - 99  
Year of Publication: 2006
ISBN:1-59593-318-2
Authors
Alin Deutsch  University of California, San Diego
Liying Sui  University of California, San Diego
Victor Vianu  University of California, San Diego
Dayou Zhou  University of California, San Diego
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 93,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142351.1142364
What is a DOI?

ABSTRACT

We study the verification of compositions of Web Service peers which interact asynchronously by exchanging messages. Each peer has access to a local database and reacts to user input and incoming messages by performing various actions and sending messages. The reaction is described by queries over the database, internal state, user input and received messages. We consider two formalisms for specification of correctness properties of compositions, namely Linear Temporal First-Order Logic and Conversation Protocols. For both formalisms, we map the boundaries of verification decidability, showing that they include expressive classes of compositions and properties. We also address modular verification, in which the correctness of a composition is predicated on the properties of its environment.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Wave demo. http://www.db.ucsd.edu/wave.
 
2
 
3
P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91--101, 1996.
4
 
5
6
 
7
 
8
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
 
9
F. Curbera, Y. Goland, J. Klein, F. Leymann, D. Roller, S. Thatte, and S. Weerawarana. Business process execution language for Web services. http://dev2dev.bea.com/techtrack/BPEL4WS.jsp.
 
10
11
12
 
13
A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven web services. Technical Report CS2006-0853, University of California, San Diego, March 2006. Available from http://www.db.ucsd.edu.
 
14
 
15
H. Foster, S. Uchitel, J. Magee, and J. Kramer. Model-based verification of web service compositions. In International Conference on Automated Software Engineering (ASE), 2003.
16
 
17
 
18
 
19
 
20
G. Holzmann. The Spin Model Checker - Primer and Reference Manual. Addison-Wesley, 2003.
 
21
22
23
24
 
25
26
 
27
 
28
M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Symp. on Logic in Computer Science, 1986.
 
29
Web Services Flow Language(WSFL 1.0), 2001. http://www-3.ibm.com/ software/ solutions/webservices/pdf/WSFL.pdf.


Collaborative Colleagues:
Alin Deutsch: colleagues
Liying Sui: colleagues
Victor Vianu: colleagues
Dayou Zhou: colleagues