Abstract
In this paper, an example of developing and proving of a distributed functional program is shown. The chosen example is the looking for non-trivial repetitions in Pascal's triangle. A sketch of a proof of the sequential implementation is carried out following [10]. The results of that proof are also applied to the distributed version, which is derived from the sequential one by transforming some common programming patterns. The distributed program has been implemented and tested using a distributed extension of the functional language Objective Caml described in [11]
Work partially supported by XUGA10505B96 and XUGA10504B96
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Agha. ACTORS: A Model of Concurrent Computation in Distributed Systems. The MIT Press, Cambridge, Massachusetts 02142, 1990.
W. Dijkstra, E. Dijkstra A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ, 1976.
J.L. Freire, V.M. Gulias, and B.B. Fraguela. Extending Caml Light to perform distributed computations. In Joint Conference on Declarative Programming (GULP-PRODE'95), Salerno, Italy, September 1995.
D. Gries. The Science of Programming. Springer-Verlag, New York, 1981.
Victor M. Gulías, Juan J. Quintela, and Jose L. Freire. Distributed computing using objective caml. In 8th International Workshop on Implementation of Functional Languages IFL'96, Bonn, Germany, September 1996.
V.M. Gulías and A. Valderruten. Une interface graphique distribuée pour le λ-calcul supportée par des serveurs fonctionnels. In Journées Francophones des langages applicatifs (JFLA'95), pages 229–246, Bois d'Amont, France, January 1995. Published in INRIA Collection Didactique, 13.
R. H. Halstead. Multilisp: a language for concurrent symbolic computation. ACM Trans. Prog. Lang. and Sys., 7(4):501–538, October 1985.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ, 1985.
Jack Dongarra and others. A Users' Guide to PVM Parallel Virtual Machine. Oak Ridge National Laboratory, July 1991.
J. Santiago Jorge, Víctor M. Gulías, and Antonio Blanco. Búsqueda de repetidos en et triángulo de pascal: Prueba formal. Technical Report (to appear), Department of Computer Science, University of La Coruña, 1997.
Xavier Leroy. The Objective Caml system, documentation and user's guide Release 1.03. INRIA, 1996.
J. Mills, L. Clarke, and A. Trew. CHIMP Concepts and Development. Technical Report EPCC-TR94-14, The University of Edinburgh, March 1994.
J.M. Molinelli, J.L. Freire, and A. Blanco. Computer-looking for nontrivial repetitions in the pascal triangle. SIGSMALL/PC NOTES, 16(4):3–26, December 1990.
L. C. Paulson. ML for the working programmer. Cambridge Univ. Press, 1991.
Klaus E. Schauser and Seth C. Goldstein. How much non-strictness do lenient programs Require? In FPCA, San Diego, CA, June 1995.
R. Stevens. UNIX Network Programming. Prentice-Hall, Englewood Cliffs, New Jersey, USA, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gulfas, V.M., Jorge, J.S., Quintela, J.J., Freire, J.L. (1997). From sequential to distributed formal proofs. In: Pichler, F., Moreno-Díaz, R. (eds) Computer Aided Systems Theory — EUROCAST'97. EUROCAST 1997. Lecture Notes in Computer Science, vol 1333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025070
Download citation
DOI: https://doi.org/10.1007/BFb0025070
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63811-7
Online ISBN: 978-3-540-69651-3
eBook Packages: Springer Book Archive