Modular verification of web services using efficient symbolic encoding and summarization

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2008, Pages 192-202

  Yu, Fang ^a   Wang, Chao ^b   Gupta, Aarti ^b   Bultan, Tevfik ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

BPEL; Modular Verification; Summarization

Indexed keywords

CONCURRENCY SEMANTICS; CONCURRENT PROCESS; FIXPOINT COMPUTATIONS; MODULAR FRAMEWORK; MODULAR VERIFICATION; MULTI-THREADING; NOVEL METHODS; SCALABLE METHODS; TECHNICAL CONTRIBUTION; WEB SERVICE COMPOSITION;

COMPUTER SOFTWARE; ENCODING (SYMBOLS); MESSAGE PASSING; SCALABILITY;

WEB SERVICES;

EID: 70349707526     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1453101.1453127     Document Type: Conference Paper

References (30)

1. R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: Modularity in model checking. In Computer Aided Verification, pages 521-525. Springer, 1998. LNCS 1427.
2. D. Beyer, A. Chakrabarti, and T. A. Henzinger. Web service interfaces. In International Conference on World Wide Web, pages 148-159. ACM, 2005.
3. T. Bultan, R. Gerber, and C. League. Composite model-checking: verification with type-specific symbolic representations. ACM Trans. Softw. Eng. Methodol., 9(1):3-50, 2000.
4. S. Chaki, E. Clarke, A. Groce, J. Ouaknine, O. Strichman, and K. Yorav. Efficient verification of sequential and concurrent C programs. Formal Methods in System Design, 2004.
5. R. Cleaveland and S. Sims. The ncsu concurrency workbench. In Computer Aided Verification, pages 394-397. Springer, 1996. LNCS 1102.
6. J. M. Cobleigh, D. Giannakopoulou, and C. S. Pasareanu. Learning assumptions for compositional verification. In Tools and Algorithms for the Construction and Analysis of Systems, pages 331-346. Springer, 2003. LNCS 2619.
7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Principles of Programming Languages, pages 238-252, Los Angeles, California, 1977.
8. Z. Duan, A. J. Bernstein, P. M. Lewis, and S. Lu. A model for abstract process specification, verification and composition. In International Conference on Service-Oriented Computing, pages 232-241. ACM, 2004.
9. Z. Duan, A. J. Bernstein, P. M. Lewis, and S. Lu. Semantics based verification and synthesis of BPEL4WS abstract processes. In International Conference on Web Services, pages 734-737. IEEE Computer Society, 2004.
10. J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In Principles of Programming Languages, pages 1-11, 2000.
11. J. Klein F. Leymann D. Roller F. Curbera, Y. Goland and S. Weerawarana. Business process execution language for web services, version 1.1. 2003.
12. R. Farahbod, U. Glässer, and M. Vajihollahi. An abstract machine architecture for web service based business process management. In Business Process Management, pages 144-157. Springer, 2005. LNCS 3812.
13. C. Flanagan, S. N. Freund, S. Qadeer, and S. A. Seshia. Modular verification of multithreaded programs. Theor. Comput. Sci., 338(1-3):153-183, 2005.
14. H. Foster, S. Uchitel, J. Magee, and J. Kramer. Compatibility verification for web service choreography. In International Conference on Web Services, pages 738-741, 2004.
15. X. Fu, T. Bultan, and J. Su. Analysis of interacting BPEL web services. In International Conference on World Wide Web, pages 621-630. ACM, 2004. (Pubitemid 40752796)
16. X. Fu, T. Bultan, and J. Su. Model checking XML manipulating software. In International Symposium on Software Testing and Analysis, pages 252-262, 2004.
17. S. Haddad, T. Melliti, P. Moreaux, and S. Rampacek. Modelling web services interoperability. In International Conference on Enterprise Information Systems, pages 287-295, 2004.
18. C. A. R. Hoare. Communicating sequential processes. Commun. ACM, 21(8):666-677, 1978.
19. G. J. Holzmann. The Spin model checker. IEEE Transactions on Software Engineering, 23:279-295, 1997.
20. K. Huynh. Analysis through reflction: walking the EMF model of BPEL4WS. Master's thesis, York University, Toronto, Canada, 2005.
21. N. Lohmann, P. Massuthe, C. Stahl, and D. Weinberg. Analyzing interacting bpel processes. In Business Process Management, pages 17-32. Springer, 2006. LNCS 4102.
22. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1994.
23. S. Nakajima. Model-checking behavioral specification of BPEL applications. Electr. Notes Theor. Comput. Sci., 151(2):89-105, 2006.
24. S. Qadeer, S. K. Rajamani, and J. Rehof. Summarizing procedures in concurrent programs. In Principles of Programming Languages, pages 245-255. ACM, 2004.
25. Z. Qiu, S. Wang, G. Pu, and X. Zhao. Semantics of BPEL4WS-like fault and compensation handling. In International Symposium of Formal Methods, pages 350-365. Springer, 2005. LNCS 3582.
26. R. K. Ranjan, A. Aziz, R. K. Brayton, B. F. Plessier, and C. Pixley. Efficient BDD algorithms for FSM synthesis and verification. May 1995.
27. N. Sharygina K. Wallnau S. Chaki, J. Ivers. The comfort reasoning framework. In Computer Aided Verification, pages 164-169, 2005.
28. N. Sharygina, S. Chaki, E. M. Clarke, and N. Sinha. Dynamic component substitutability analysis. In International Symposium of Formal Methods Europe, pages 512-528. Springer, 2005. LNCS 3582.
29. Z. Yang, C. Wang, F. Ivaňcíc, and A. Gupta. Mixed symbolic representations for model checking software programs. In Formal Methods and Models for Codesign, pages 17-24, July 2006.
30. T. Yavuz-Kahveci and T. Bultan. A symbolic manipulator for automated verification of reactive systems with heterogeneous data types. STTT, 5(1):15-33, 2003.