Specified programming

  • Andrzej Blikle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)


The paper presents a method of mathematically supported correct programming. Totally correct programs are developed be means of transformation rules. These programs are considered and transformed together with their specifications. The specifications are of two types: global (pre- and post- conditions) and local (redundant tests). The transformations always preserve the total correctness of programs and are rather flexible; e.g. one may add or remove variables in the program or switch from one data type to another.


Transformation Rule Binary String Predicate Symbol Total Correctness Abstract Data Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bär, D.(1977) A methodology for simultaneously developing and verifying PASCAL programs, manuscript.Google Scholar
  2. Blikle, A.(1977A) A mathematical approach to the derivation of correct programs, In: Semantics of Programming Languages (Proc. International Workshop, Bad Honnef, FRG, March 1977), Abteilung Informatik, Universitat Dortmung, Bericht Nr 41 (1977), 25–29Google Scholar
  3. Blikle, A.(1977B) Toward mathematical structured programming, In: Formal Description of Programming Concepts (Proc. IFIP Working Conf. St.Andrews, N.B., Canada, August 1–5, 1977, E.J. Neuhold ed.), 183–202, North Holland, Amsterdam 1978Google Scholar
  4. Blikle, A.(1977C) An analytic approach to the verification of iterative programs, In: Information Processing (Proc. IFIP Congress 1977, B.Gilchrist ed.) North Holland 1977, 285–290Google Scholar
  5. Blikle, A.(1977D) A comparative review of some program verification methods, In: Mathematical Foundations of Computer Science (Proc. 6th Symposium, Tatranska Lomnica, September 1977, J. Gruska ed.) 17–33, Lecture Notes in Computer Science, Springer Verlag, Heidelberg 1977Google Scholar
  6. Burstal, R.M. and Darlington, J.(1977) A transformation system for developing recursive programs, Journal of ACM 24 (1977), 44–67Google Scholar
  7. Darlington, J.(1975) Applications of program transformation to program synthesis, Proc. Symp. on Proving and Improving Programs, Arc-et-Senans 1975, 133–144Google Scholar
  8. Darlington, J.(1976) Transforming specifications into efficient programs, In: New Directions in Algorithmic Languages 1976 (S.A. Schuman ed.) IRIA Rocquencourt 1976Google Scholar
  9. Dershowitz, N. and Manna, Z.(1975) On automating structured programming, Proc. Symp. on Proving and Improving Programs, Arc-et-Senans 1975Google Scholar
  10. Dijkstra, E.W.(1968) A constructive approach to the problem of program correctness, BIT 8 (1968), 174–186Google Scholar
  11. Dijkstra, E.W.(1972) Notes on structured programming, In: Structured Programming, by O.J. Dahl, E.W. Dijkstra, C.A.R. Hoare, Academic Press, London 1977Google Scholar
  12. Dijkstra, E.W.(1975) Guarded commands, non-determinancy and a calculus for the derivation of programs, Proc. 1975 Int. Conf. Reliable Software 1975, pp.2.0–2.13, also in Comm. ACM, 18 (1975) 453–457Google Scholar
  13. Emden van, M.H.(1975) Verification conditions as representations for programs, manuscript, Waterloo, Ontario, 1975Google Scholar
  14. Emden van, M.H.(1976) Unstructured systematic programming, Dept. of CS, University of Waterloo, CS-76-09 (1976)Google Scholar
  15. Irlik, J.(1976) Constructing iterative version of a system of recursive procedures, In: Mathematical Foundations of Computer Science (Proc. 5th Symposium, Gdansk, September 1976, A. Mazurkiewicz ed.), LNCS No 45, Springer Verlag, Heidelberg 1976Google Scholar
  16. Irlik, J.(1978) A system of recursive programming, In: Mathematical Foundations of Computer Science 1978 (Proc. 7th Symposium, Zakopane, September 1978, J. Winkowski ed.) LNCS, Springer Verlag, Heidelberg 1978Google Scholar
  17. Liskov, B.H. and Zilles, S.N.(1975) Specification techniques for data abstraction, IEEE Trans. on SE. Se-1 No 1 (1975), 7-19Google Scholar
  18. Meertens, L.(1976) From abstract variable to concrete representation, In: New Directions in Algorithmic Language 1976 (S.A. Schuman ed.) IRIA, Rocquencourt 1976Google Scholar
  19. Sinzoff, M.(1977) Inventing program construction rules, manuscriptGoogle Scholar
  20. Spitzen, J.M., Levitt, K.N. and Lawrence, R.(1976) An example of a hierarchial design and proof, In: New Directions in Algorithmic Languages 1976 (S.A. Schuman ed.) IRIA, Rocquencourt 1976Google Scholar
  21. Wegbreit, B.(1976) Goal-directed program transformations, IEEE Trans. SE, Vol.SE-2 No 2 (1976), 69–79Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Andrzej Blikle
    • 1
  1. 1.Polish Academy of Sciences, PKiNInstitute of Computer ScienceWarsawPoland

Personalised recommendations