Skip to main content
SpringerLink
Log in

Understanding and Expressing Software Construction

  • Conference paper
Program Transformation and Programming Environments

Part of the book series: NATO ASI Series ((NATO ASI F,volume 8))

Abstract

The aim of this working memorandum is to foster thinking on the following topics: the nature of software construction; the need and the possibility of organizing and expressing it; the help of notational and computational systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial, J.R., Formal programming, Manuscript, March 1982.

    Google Scholar 

  2. Backus, J., Can programming be liberated from the von Neuman style? A functional style and its algebra of programs, Comm. ACM 21 (8), 613–641, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  3. Bauer, F.L., et al., Programming in a wide spectrum language: a collection of examples, Sci. Comp. Programming 1 (1), 73–114, 1981.

    Article  MATH  Google Scholar 

  4. Burstall, R.M., and J.A. Goguen, An informal introduction to specifications using Clear, in: The Correctness Problem in Computer Science, Acad. Press, London, 1981, 185–213.

    Google Scholar 

  5. Codd, E.F., A relational model for large shared data banks, Comm. ACM 13 (6), 377–387, 1970.

    Article  MATH  Google Scholar 

  6. Constable, R.L., Programs as proofs: a synopsis, Inform. Processing Letters 16 (3), 105–112, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  7. Darlington, J., The structured descriptions of algorithm derivations, in: Proc. Intern. Symp. on Algorithmic Languages, North-Holland, Amsterdam, 1982.

    Google Scholar 

  8. Dijkstra E.W., A Discipline of Programmning, Prentice-Hall, Englewood Cliffs NJ, 1976.

    Google Scholar 

  9. Ershov, A.P., Mixed computation: potential applications and problem for study, Theor. Comp. Sci. 18 (1), 41–67, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  10. Floyd, R.W., The paradigms of programming, Comm. ACM 22 (8), 455–460, 1979.

    Article  Google Scholar 

  11. Ganzinger, H., Increasing modularity and language-independence in automatically generated compilers, Sci. Comp. Programming 3 (3), 223–279, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  12. Gordon, M., R. Milner and C. Wadsworth, Edinburgh LCF: A Mechanized Logic of Computation, LNCS 78, Springer-Verlag, Berlin, 1978.

    Google Scholar 

  13. Gries, D., The Science of Programming, Springer-Verlag, New York, 1981.

    MATH  Google Scholar 

  14. von Henke, F.W., On generating programs from types: an approach to automatic programming, in: Proc. Coll. on Proving and Improving Programs Arc-et-Senans, INRIA, Le Chesnay, 1975, 57–69.

    Google Scholar 

  15. Jackson, M., Principles of Program Design, Acad. Press, London, 1975.

    Google Scholar 

  16. Jackson, M., System Development, Prentice-Hall Intern., London, 1983.

    MATH  Google Scholar 

  17. Jones, C.B., Specification and design of (parallel) programs, in: Information Processing 83, North-Holland, Amsterdam, 1983, 321–332.

    Google Scholar 

  18. Kahn, G., et al., Metal: a formalism to specify formalisms, Sci. Comp. Programming 3 (2), 151–188, 1983

    Article  Google Scholar 

  19. Knuth, D.E., and P.B. Bendix, Simple word problems in universal algebras, in: Computational Problems in Abstract Algebra, Pergamon Press, Oxford, 1970, 263–297.

    Google Scholar 

  20. MacLennan, B.J., Relational programming, Tech. Rep. NPS 52-83-012, Naval Postgraduate School, Monterey Calif., Sept. 1983.

    Google Scholar 

  21. Melliar-Smith, P.M., and R.L. Schwartz, Hierarchical specification of the SIFT fault-tolerant flight control system, Tech. Rep. CSL-123, SRI Int., Menlo Park Calif., March 1981.

    Google Scholar 

  22. Naur, P., and B. Randell (eds.), Software Engineering, NATO Science Committee, Brussels, 1969.

    Google Scholar 

  23. Nordströra, B., and K. Petersson, Types and specifications, in: Information Processing 83, North-Holland, Amsterdam, 1983, 915–920.

    Google Scholar 

  24. Paige, R.A., Formal Differentiation: A Program Synthesis Technique, UMI Research Press, Ann Arbor Mich., 1981.

    Google Scholar 

  25. Sintzoff, M., Eliminating blind-alleys from acktrack programs, in: Proc. 3rd Int. Coll. on Automata, Languages and Programming, Edinburgh University Press, 1976, 531–557.

    Google Scholar 

  26. Sintzoff, M., Properties, feasibility and usefulness of a language for programming programs, Algol Bull. 43, 84–90, 1978.

    Google Scholar 

  27. Sintzoff, M., Suggestions for composing and specifying program design decisions, in: Proc. 4th Int. Symp. on Programming, LNCS 70, Springer-Verlag, Berlin, 1980, 337–347.

    Google Scholar 

  28. Sintzoff, M., Proof-oriented and applicative valuations in definitions of algorithms, in: Proc. Conf. on Functional Programming Languages and Computer Architecture, ACM, New York, 1981, 155–162.

    Chapter  Google Scholar 

  29. Sintzoff, M., Issues in the methodical design of concurrent programs, in: Computer Program Synthesis Methodologies, Reidel, Dordrecht, 1983, 51–78.

    Google Scholar 

  30. Lampson, B., and E.E. Schmidt, Practical use of a polymorphic applicative language, in: Proc. 10th Conf. on Principles of Programming Languages, ACM, New York, 1983, 237–255.

    Google Scholar 

  31. Thorelli, L.-E., A linker allowing hierarchic composition of program modules, in: Information Processing 83, North-Holland, Amsterdam, 1983, 101–106.

    Google Scholar 

  32. van Lamsweerde, A., and M. Sintzoff, Formal derivation of strongly concurent programs, Acta Informatica 12 (1), 1–31, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  33. Warnier, J.D., Logical Construction of Programs, Van Nostrand Reinhold, New York, 1974.

    Google Scholar 

  34. Wile, D.S., Program developments: formal explanations of implementations, Comm. ACM 26 (11), 902–911, 1983.

    Article  Google Scholar 

  35. Polya, G., Induction and Analogy in Mathematics, Princeton Univ. Press, Princeton NJ, 1954.

    MATH  Google Scholar 

  36. Scherlis, W.L., and D. Scott, First steps towards inferential programming, in: Information Processing 83, North-Holland, Amsterdam, 1983, 199–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Unité d’ Informatique, Université Catholique de Louvain, Louvain-la-Neuve, B-1348, Belgium

    M. Sintzoff

Authors
  1. M. Sintzoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Federal Republic of Germany

    Peter Pepper

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sintzoff, M. (1984). Understanding and Expressing Software Construction. In: Pepper, P. (eds) Program Transformation and Programming Environments. NATO ASI Series, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46490-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46490-4_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-46492-8

  • Online ISBN: 978-3-642-46490-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation