VDM 1991: VDM '91 Formal Software Development Methods pp 141-237 | Cite as
Tutorial lecture notes on the Irish School of the VDM
Conference paper
First Online:
Keywords
Adjacency Matrix Formal Method Basic Part Inverse Image Semantic Function
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.
Preview
Unable to display preview. Download preview PDF.
References
- [1]Dines Bjørner. Stepwise transformation of software architectures. In Dines Bjørner and Cliff B. Jones, editors, Formal Specification & Software Development, chapter 11, pages 353–77. Prentice/Hall International, Englewood Cliffs, New Jersey, 1982.Google Scholar
- [2]Dines Bjørner. Software Architectures and Programming Systems Design, Vol. II. Basic Abstraction Principles. Department of Computer Science, Technical University of Denmark, Lyngby, Denmark, September 1988. The material constituted the Lecture Notes of Dines Bjørner for the CEC sponsored VDM'88 Symposium Tutorial, Trinity College, Dublin, Ireland. It is a draft of a publication to appear.Google Scholar
- [3]Dines Bjørner and Cliff B. Jones, editors. The Vienna Development Method: The Meta-Language, Lecture Notes in Computer Science 61. Springer-Verlag, Berlin, 1978.Google Scholar
- [4]Dines Bjørner and Cliff B. Jones, editors. Formal Specification and Software Development. Prentice/Hall International, Englewood Cliffs, New Jersey, 1982.Google Scholar
- [5]G. Pólya. How to Solve It, A New Aspect of Mathematical Method. Princeton University Press, second edition, 1957.Google Scholar
- [6]Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, Massachusetts, 1974.Google Scholar
- [7]Douglas Bridges and Osvald Demuth. On the Lebesgue Measurability of Continuous Functions in Constructive Analysis. BULLETIN (New Series) of the American Mathematical Society, 24(2):259–76, April 1991.Google Scholar
- [8]Antoni Diller. Z: An Introduction to Formal Methods. John Wiley & Sons, Chichester, England, 1990.Google Scholar
- [9]Samuel Eilenberg. Automata, Languages, and Machines, Volume A. Academic Press, New York, 1974.Google Scholar
- [10]Samuel Eilenberg. Automata, Languages, and Machines, Volume B. Academic Press, New York, 1976.Google Scholar
- [11]Shimon Even. Graph Algorithms. Computer Science Press, Inc., 9125 Fall River Lane, Potomac, Maryland, 1979.Google Scholar
- [12]Heinrich W. Guggenheimer. Differential Geometry. Constable and Company, Ltd., London, 1963. The 1977 Dover edition is cited.Google Scholar
- [13]Sir Thomas Heath. A History of Greek Mathematics, Volume I: From Thales to Euclid. Clarendon Press, Oxford, 1921. The Dover Publications 1981 reprint is cited.Google Scholar
- [14]Sir Thomas Heath. A History of Greek Mathematics, Volume II: From Aristarchus to Diophantus. Clarendon Press, Oxford, 1921. The Dover Publications 1981 reprint is cited.Google Scholar
- [15]Cliff B. Jones. Software Development: A Rigorous Approach. Prentice-Hall International, London, 1980.Google Scholar
- [16]Cliff B. Jones. Modelling concepts of programming languages. In Dines Bjørner and Cliff B. Jones, editors, Formal Specification & Software Development, chapter 4, pages 85–123. Prentice/Hall International, Englewood Cliffs, New Jersey, 1982.Google Scholar
- [17]Immanuel Kant. Critique of Pure Reason. Macmillan Education, Ltd., London, 1781, 1787. Translated from the German by Norman Kemp Smith, 1921.Google Scholar
- [18]Rudolfus Kassel, editor. ARISTOTELIS DE ARTE POETICA LIBER. Oxford University Press, Oxford, 1965.Google Scholar
- [19]Morris Kline. Mathematical Thought from Ancient to Modern Times. Oxford University Press, Oxford, 1972.Google Scholar
- [20]Imre Lakatos. Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press, 1976. Edited by John Worrall and Elie Zahar.Google Scholar
- [21]Mícheál Mac an Airchinnigh. Mathematical Structures and their Morphisms in Meta-IV. In D. Bjørner, C. B. Jones, M. Mac an Airchinnigh, and E. J. Neuhold, editors, VDM '87, VDM—A Formal Method at Work, Lecture Notes in Computer Science 252, pages 287–320. Springer-Verlag, Berlin, 1987.Google Scholar
- [22]Mícheál Mac an Airchinnigh. Conceptual Models and Computing. Department of Computer Science, Trinity College, Dublin, Ireland, 1990.Google Scholar
- [23]Robert Matthews. The Chip with a sting in its tale. New Scientist, (1777):20–1, 13 July 1991.Google Scholar
- [24]T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms. North-Holland, Amsterdam, 1988.Google Scholar
- [25]J. N. Oliveira. A Reification Calculus for Model-Oriented Software Specification. Formal Aspects of Computing, 2(1):1–23, 1990.CrossRefGoogle Scholar
- [26]Joseph E. Stoy. Foundations of Denotational Semantics. In Dines Bjørner, editor, Abstract Software Specifications, Lecture Notes in Computer Science 86, pages 43–99. Springer-Verlag, Berlin, 1980.Google Scholar
- [27]Joseph E. Stoy. Mathematical Foundations. In Dines Bjørner and Cliff B. Jones, editors, Formal Specification and Software Development, pages 47–81. Prentice/Hall International, Englewood Cliffs, New Jersey, 1982.Google Scholar
- [28]Robert Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146–160, June 1972.CrossRefGoogle Scholar
- [29]Andrzej Tarlecki and Morten Wieth. A Naive Domain Universe for VDM. In D. Bjørner, C. A. R. Hoare, and H. Langmaack, editors, VDM'90, VDM and Z-Formal Methods in Software Development, Lecture Notes in Computer Science 428, pages 552–79. Springer-Verlag, Berlin, 1990.Google Scholar
- [30]Thomas E. Vollmann, William L. Berry, and D. Clay Whybark. Manufacturing Planning and Control Systems. Richard D. Irwin, Ltd., Homewood, Illinois, 1984.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1991