Formal reasoning on a web coordination system

Authors:
Eloy J. Mata;Pedro Álvarez;José A. Bañares;Julio Rubio
Affiliations:
Departamento de Matemáticas y Computación, Universidad de La Rioja, Logroño, La Rioja, Spain;Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, Zaragoza, Spain;Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, Zaragoza, Spain;Departamento de Matemáticas y Computación, Universidad de La Rioja, Logroño, La Rioja, Spain
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 6
Cited 0

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
Production matching for large learning systems

Production matching for large learning systems
Solving the Linda multiple rd problem using the copy-collect primitive

Science of Computer Programming
Coordination models: a guided tour

Coordination of Internet agents
Tuple-Based Coordination Models in Event-Based Scenarios

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Formal modelling of a coordination system: from practice to theory, and back again

ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII

Quantified Score

Hi-index	0.00

Visualization

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).