Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions

  • Luciano Baresi
  • Domenico Bianculli
  • Sam Guinea
  • Paola Spoletini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5522)


Service compositions leverage remote services to deliver added-value distributed applications. Since services are administered and run by independent parties, the governance of service compositions is intrinsically decentralized and services may evolve independently over time. In this context, pre-deployment verification can only provide limited guarantees, while continuous run-time verification is needed to probe and guarantee the correctness of compositions at run time.

This paper addresses the issue of efficiency in the run-time verification of service compositions described in BPEL. It considers an existing monitoring approach based on ALBERT, which is a temporal logic language suitable for asserting both functional and non-functional properties, and shows how to obtain the efficient run-time verification of ALBERT formulae. The paper introduces an operational semantics for ALBERT through an extension of alternating automata, and explains how to optimize it to produce smarter, and thus more efficient, encodings of defined formulae. The optimized operational semantics can then be the basis for an efficient implementation of the run-time verification framework.


Temporal Logic Service Composition Operational Semantic Linear Temporal Logic Standard Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Andrews, T., et al.: Business Process Execution Language for Web Services, Version 1.1. BPEL4WS specification (2003)Google Scholar
  2. 2.
    Baresi, L., Bianculli, D., Ghezzi, C., Guinea, S., Spoletini, P.: Validation of web service compositions. IET Softw. 1(6), 219–232 (2007)CrossRefGoogle Scholar
  3. 3.
    Bianculli, D., Ghezzi, C., Spoletini, P., Baresi, L., Guinea, S.: A guided tour through SAVVY-WS: a methodology for specifying and validating web service compositions. In: Börger, E., Cisternino, A. (eds.) Advances in Software Engineering. LNCS, vol. 5316, pp. 130–161. Springer, Heidelberg (2008)Google Scholar
  4. 4.
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)CrossRefzbMATHGoogle Scholar
  5. 5.
    Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  6. 6.
    Baresi, L., Bianculli, D., Guinea, S., Spoletini, P.: Keep it small, keep it real: Efficient run-time verification of web service compositions. Technical Report 2009.9, Politecnico di Milano - Dipartimento di Elettronica e Informazione (2009)Google Scholar
  7. 7.
    Georges, A., Buytaert, D., Eeckhout, L.: Statistically rigorous Java performance evaluation. In: Proceedings of OOPSLA 2007, pp. 57–76. ACM, New York (2007)Google Scholar
  8. 8.
    Raimondi, F., Skene, J., Emmerich, W.: Efficient online monitoring of web-service SLAs. In: Proc. of SIGSOFT 2008/FSE-16, pp. 170–180. ACM, New York (2008)CrossRefGoogle Scholar
  9. 9.
    Simmonds, J., Chechik, M., Nejati, S.: Property patterns for runtime monitoring of web service conversations. In: Proc. of RV 2008 (2008)Google Scholar
  10. 10.
    Drusinsky, D.: On-line monitoring of metric temporal logic with time-series constraints using alternating finite automata. JUCS 12(5), 482–498 (2006)Google Scholar
  11. 11.
    Finkbeiner, B., Sipma, H.B.: Checking finite traces using alternating automata. Electr. Notes Theor. Comput. Sci. 55(2), 44–60 (2001)CrossRefzbMATHGoogle Scholar
  12. 12.
    Giannakopoulou, D., Havelund, K.: Runtime analysis of linear temporal logic specifications. In: Proc. of ASE 2001, pp. 412–416. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  13. 13.
    Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 260–272. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2009

Authors and Affiliations

  • Luciano Baresi
    • 1
  • Domenico Bianculli
    • 2
  • Sam Guinea
    • 1
  • Paola Spoletini
    • 3
  1. 1.Politecnico di Milano - DEEP-SE Group - DEI, MilanoItaly
  2. 2.Faculty of InformaticsUniversity of LuganoLuganoSwitzerland
  3. 3.Università dell’Insubria - DSCPI, ComoItaly

Personalised recommendations