Skip to main content
SpringerLink
Log in
Book cover

Mathematical Studies of Information Processing pp 228–251Cite as

Specified programming

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 75))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bär, D.(1977) A methodology for simultaneously developing and verifying PASCAL programs, manuscript.

    Google Scholar 

  • 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–29

    Google Scholar 

  • 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 1978

    Google Scholar 

  • 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–290

    Google Scholar 

  • 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 1977

    Google Scholar 

  • Burstal, R.M. and Darlington, J.(1977) A transformation system for developing recursive programs, Journal of ACM 24 (1977), 44–67

    Google Scholar 

  • Darlington, J.(1975) Applications of program transformation to program synthesis, Proc. Symp. on Proving and Improving Programs, Arc-et-Senans 1975, 133–144

    Google Scholar 

  • Darlington, J.(1976) Transforming specifications into efficient programs, In: New Directions in Algorithmic Languages 1976 (S.A. Schuman ed.) IRIA Rocquencourt 1976

    Google Scholar 

  • Dershowitz, N. and Manna, Z.(1975) On automating structured programming, Proc. Symp. on Proving and Improving Programs, Arc-et-Senans 1975

    Google Scholar 

  • Dijkstra, E.W.(1968) A constructive approach to the problem of program correctness, BIT 8 (1968), 174–186

    Google Scholar 

  • 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 1977

    Google Scholar 

  • 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–457

    Google Scholar 

  • Emden van, M.H.(1975) Verification conditions as representations for programs, manuscript, Waterloo, Ontario, 1975

    Google Scholar 

  • Emden van, M.H.(1976) Unstructured systematic programming, Dept. of CS, University of Waterloo, CS-76-09 (1976)

    Google Scholar 

  • 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 1976

    Google Scholar 

  • 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 1978

    Google Scholar 

  • Liskov, B.H. and Zilles, S.N.(1975) Specification techniques for data abstraction, IEEE Trans. on SE. Se-1 No 1 (1975), 7-19

    Google Scholar 

  • Meertens, L.(1976) From abstract variable to concrete representation, In: New Directions in Algorithmic Language 1976 (S.A. Schuman ed.) IRIA, Rocquencourt 1976

    Google Scholar 

  • Sinzoff, M.(1977) Inventing program construction rules, manuscript

    Google Scholar 

  • 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 1976

    Google Scholar 

  • Wegbreit, B.(1976) Goal-directed program transformations, IEEE Trans. SE, Vol.SE-2 No 2 (1976), 69–79

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Polish Academy of Sciences, PKiN, Institute of Computer Science, P.O.Box 22, 00-901, Warsaw, Poland

    Andrzej Blikle

Authors
  1. Andrzej Blikle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. K. Blum M. Paul S. Takasu

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blikle, A. (1979). Specified programming. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-09541-1_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09541-5

  • Online ISBN: 978-3-540-35010-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation