Abstract
In this paper, a first step toward the use of Artificial Intelligence tools (namely proof assistants) in the formal analysis of programs for Web services coordination is presented. This first attempt consists in the formal modeling of a system with transactional capabilities. The model is devised on a variant of the well-known Linda model for generative communication. We explore then the role of the Rete algorithm to implement efficiently a transactional read operation, opening the way for a further formal analysis of it, by means of automated testing against a certified program (i.e. a program verified with the help of a proof assistant).
Partially supported by Comunidad Autónoma de La Rioja, project ANGI2005/19, and Ministerio de Educación y Ciencia, projects MTM2006-06513, TIN2006-13301.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrés, M., Lambán, L., Rubio, J.: Executing in Common Lisp, Proving in ACL2. In: Calculemus 2007. LNCS, vol. 4573, pp. 1–12. Springer, Heidelberg (2007)
Gelernter, D.: Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)
Viroli, M., Ricci, A.: Tuple-Based Coordination Models in Event-Based Scenarios. In: IEEE 22nd International Conference on Distributed Computing Systems (ICDCS 2002 Workshops) - DEBS 2002 International Workshop on Distributed Event-Based Systems, Vienna, Austria (July 2002)
Mata, E., Álvarez, P., Bañares, J.A., Rubio, J.: Towards and Efficient Rule-Based Coordination of Web Services. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 73–82. Springer, Heidelberg (2004)
Mata, E., Álvarez, P., Bañares, J.A., Rubio, J.: Formal Modelling of a Coordination System: from Practice to Theory and back again. In: Mata, E., Álvarez, P. (eds.) Engineering Societies in the Agents World VII, ESAW 2006, Dublin, Ireland. LNCS (LNAI), Springer, Heidelberg (2007)
Forgy, C.: A fast algorithm for many pattern / many object pattern match problem. Artificial Intelligence 19, 17–37 (1982)
Doorenbos, R.B.: Production Matching for Large Learning Systems (Rete/UL). PhD thesis, Carnegie Mellon University (1995)
Álvarez, P., Bañares, J.A., Muro-Medrano, P.: An Architectural Pattern to Extend the Interaction Model between Web-Services: The Location-Based Service Context. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 271–286. Springer, Heidelberg (2003)
Busi, N., Ciancarini, P., Gorrieri, R., Zavattaro, G.: Coordination Models: A Guided Tour. In: Coordination of Internet Agents, pp. 6–24. Springer, Heidelberg (2001)
Rowstron, A., Wood, A.: Solving the Linda multiple rd problem using the copy-collect primitive. Science of Computer Programming 31(2-3), 335–358 (1998)
Zavattaro, G.: Coordination Models and Languages: Semantics and expressiveness. PhD thesis, Department of Computer Science, University of Bologna, Italy (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mata, E.J., Álvarez, P., Bañares, J.A., Rubio, J. (2007). Formal Reasoning on a Web Coordination System. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-75867-9_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75866-2
Online ISBN: 978-3-540-75867-9
eBook Packages: Computer ScienceComputer Science (R0)