Skip to main content

Abstract Reachability Graph for Verifying Web Service Interfaces

  • Conference paper
High Confidence Software Reuse in Large Systems (ICSR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5030))

Included in the following conference series:

Abstract

Web Service Interface Control Flow Automata(WCFA) is presented to model web service interfaces. An Abstract Reachability Graph(ARG) is constructed for the composite web service based on available WCFAs. Nodes in ARG are equipped with a state formula which is an overestimation of the concrete reachable state properties. The algorithm we present to compute the ARG is a variation of the depth first search algorithm. State formulas are computed at the same time with the construction of ARG. Assertions can be made at control points(nodes)to express certain properties. A SAT solver is used to check whether assertions are logical consequences of the state formulas. Then the answer(valid or invalid) will give designers enough information to decide whether the composite web service works as intended.

This work is funded by the Support Program of the National ’11th Five-Year-Plan’ of China under Grant No. 2006BAH02A00 and the National High Technology Development Program of China under Grant No. 2006AA010101.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Necula, G.C., McPeak, S., Rahul, S.P., Weimer, W.: CIL: Intermediate language and tools for analysis and transformation of c programs. In: Computational Complexity, pp. 213–228 (2002)

    Google Scholar 

  2. Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker Blast: Applications to software engineering. Int. Journal on Software Tools for Technology Transfer (STTT) 9(5-6), 505–525 (2007); Invited to special issue of selected papers from FASE (2004/05)

    Article  Google Scholar 

  3. Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 515–518. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hong Mei

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, X., Xing, C., Zhou, L. (2008). Abstract Reachability Graph for Verifying Web Service Interfaces. In: Mei, H. (eds) High Confidence Software Reuse in Large Systems. ICSR 2008. Lecture Notes in Computer Science, vol 5030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68073-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68073-4_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68062-8

  • Online ISBN: 978-3-540-68073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics