Unifying Theories of Programming
A number of formal notations and theories have now emerged and proved themselves effective as tools for the practising software engineer. Within these theories we see a number of common themes, such as abstraction, refinement, choice, termination, feasibility, concurrency and communication. The commonality of such themes opens perspectives for unifying theories, an activity which can increase our ability to use existing methods and notations, to recognise their limitations, and to extend and generalise them.
To provide a wider arena for this important area and in recognition of the pioneering work already done we are organising UTP'06, The First International Symposium on Unifying Theories of Programming. http://www.scm.tees.ac.uk/utpsymposium
- S. E. Dunne and W. J. Stoddart, editors. UTP'06, First International Symposium on Unifying Theories of Programming, volume 4010 of Lecture Notes in Computer Science. Springer, June 2006.
- S. E. Dunne and S. Conroy. Process refinement in B. In H. Treharne, S. King, M. C. Henson, and S. Schneider, editors, ZB2005: Formal Specification and Development in Z and B, number 3455 in Lecture Notes in Computer Science, pages 45-64. Springer, 2005.
- S. E. Dunne. Introducing backward refinement into B. In D. Bert, J. P. Bowen, S. King, and M. Walden, editors, ZB2003: Formal Specification and Development in Z and B: Third International Conference of B and Z Users, number 2651 in Lecture Notes in Computer Science, pages 178-196. Springer-Verlag, 2003.
- S. E. Dunne. Recasting Hoare and He's unifying theory of programs in the context of general correctness. In A. Butterfield, G. Strong, and C. Pahl, editors, Proceedings of the 5th Irish Workshop in Formal Methods, IWFM 2001, Workshops in Computing. British Computer Society, 2001. http://ewic.bcs.org/conferences/2001/5thformal/papers.