Abstract.
In this article, I present an "event approach" used to formally develop sequential programs. It is based on the formalism of Action Systems [6] (and Guarded Commands [7]), which is is interesting because it involves a large number of pointer manipulations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Schorr, H., Waite, W.M.: An Efficient Machine-Independent Procedure for Garbage Collection in Various List Structures. CACM (August 1967)
Abrial, J.R.: The B-Book – Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)
Abrial, J.R., Cansell, D.: Click’n Prove: Interactive Proofs Within Set Theory. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 1–24. Springer, Heidelberg (2003)
Abrial, J.R., Cansell, D., Méry, D.: A Mechanically Proved and Incremental Development of IEEE Tree Identify Protocol. Formal Aspect of Computing 14 (2003)
Bornat, R.: Proving Pointer Programs in Hoare Logic. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837. Springer, Heidelberg (2000)
Back, R.J.R., Kurki-Suonio, R.: Decentralization of Process Nets with Centralized Control. In: 2nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (1983)
Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
Clearsy ATELIER B. User Manual. Aix-en-Provence (2001)
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. (2003). Event Based Sequential Program Development: Application to Constructing a Pointer Program. In: Araki, K., Gnesi, S., Mandrioli, D. (eds) FME 2003: Formal Methods. FME 2003. Lecture Notes in Computer Science, vol 2805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45236-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-45236-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40828-4
Online ISBN: 978-3-540-45236-2
eBook Packages: Springer Book Archive