Abstract
Graphs algorithms and graph-theoretical problems provide a challenging battle field for the incremental development of proved models. The B event-based approach implements the incremental and proved development of abstract models which are translated into algorithms; we focus our methodology on the minimum spanning tree problem and on Prim’s algorithm. The correctness of the resulting solution is based on properties over trees and we show how the greedy strategy is efficient in this case. We compare properties proven mechanically to the properties found in a classical algorithms textbook.
Supported in part by PRST Intelligence Logicielle/QSL/DIXIT project and by PRST Intelligence Logicielle/QSL/ADHOC project
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
J.-R. Abrial. A formal approach to large software constructions. In J. L. A van de Snepscheut, editor, Mathematics for Program Construction, pages 1–20. Springer-Verlag, june 1989. LNCS 375.
J.-R. Abrial. Extending B without changing it (for developing distributed systems). In H. Habrias, editor, 1 st Conference on the B method, pages 169–190, November 1996.
J.-R. Abrial, D. Cansell, and D. Méry. A mechanically proved and incremental development of the IEEE 1394 Tree Identify Protocol. Formal Aspects of Computing, ??(??), 2002. accepted for publication.
J.-R. Abrial and L. Mussat. Introducing dynamic constraints in B. In D. Bert, editor, B’ 98: Recent Advances in the Development and Use of the B Method, volume 1393 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
J.R. Abrial. The B Book — Assigning Programs to Meanings. Cambridge University Press, 1996. ISBN 0-521-49619-5.
R. J. R. Back. On correct refinement of programs. Journal of Computer and System Sciences, 23(1): 49–68, 1979.
Dominique Cansell, Ganesh Gopalakrishnan, Mike Jones, Dominique Méry, and Airy Weinzoepflen. Incremental proof of the producer/consumer property for the pci protocol. In D. Bert, editor, ZB 2002, Lecture Notes in Computer Science. Springer-Verlag, January 2002.
Dominique Cansell and Dominique Méry. Développement de fonctions définies récursivement en b. Technical report, LORIA, 2002.
K. M. Chandy and J. Misra. Parallel Program Design A Foundation. Addison-Wesley Publishing Company, 1988. ISBN 0-201-05866-9.
ClearSy, Aix-en-Provence (F). Atelier B, 2002. Version 3.6.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein. Introduction to Algorithms. MIT Press and McGraw-Hill, 2001.
E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
R. Fraer. Formal Development in B of a Minimum Spanning Tree Algorithm. In H. Habrias, editor, 1 st Conference on the B method, pages 169–190, November 1996.
E. Pascal Gribomont. Concurrency without toil: a systematic method for parallel program design. Science of Computer Programming, 21:1–56, 1993.
Y. Gurevitch. Specification and Validation Methods, chapter “Evolving Algebras 1993: Lipari Guide”, pages 9–36. Oxford University Press, 1995. Ed. E. Börger.
J. B. Kruskal. On the shortest spanning subtree and the traveling salesman problem. Proc. Am. Math. Soc., 7:48–50, 1956.
L. Lamport. A temporal logic of actions. Transactions On Programming Languages and Systems, 16(3): 872–923, May 1994.
Leslie Lamport. Specifying Systems: The TLA + Language and Tools for Hardware and Software Engineers. Addison-Wesley, 2002.
C. Morgan. Programming from Specifications. Prentice Hall International Series in Computer Science. Prentice Hall, 1990.
R. C. Prim. Shortest connection and some generalizations. Bell Syst. Tech. J., 36, 1957.
K. Stroetmann. The constrained shortest path problem: A case study in using ASMs. J. of Universal Computer Science, 3(4):304–319, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abrial, JR., Cansell, D., Méry, D. (2003). Formal Derivation of Spanning Trees Algorithms. In: Bert, D., Bowen, J.P., King, S., Waldén, M. (eds) ZB 2003: Formal Specification and Development in Z and B. ZB 2003. Lecture Notes in Computer Science, vol 2651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44880-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-44880-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40253-4
Online ISBN: 978-3-540-44880-8
eBook Packages: Springer Book Archive