Introduction to VDM
Author(s)
Bibliographic Information
Introduction to VDM
(The McGraw-Hill international series in software engineering)
McGraw Hill Book Co., c1993
Available at 2 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes index
Description and Table of Contents
Description
Offering a tutorial introduction to the VDM formal notation, this text is designed for second- and third-year undergraduates of software engineering. Using notation that blends together both computing and mathematics, it covers the process of writing formal specification, developing abstract modules of data and operation, and design. Special attention is paid to the difficult topic of operation decomposition. The authors describe specific proof obligations, enabling students to develop their software so that the conformity of the design to the specification, and the program code to the design, is guaranteed. Teaching aims are highlighted at the start of each chapter, and the text is based on the Open University software engineering degree.
Table of Contents
- Part 1 The VDM specification language: the software development process
- formal methods and the development process
- specifying data
- specifying functions
- specifying operations
- constructing a VDM specification
- solutions to part 1 questions. Part 2 Formal specification: sets
- specifications using sets
- composite object types
- maps
- sequences
- defining complex states
- solutions to part 2 questions. Part 3 Reifying abstract data types: stacks and queues
- case-study
- solutions to part 3 questions. Part 4 Correctness statements and proof rules: proving programs containing loops
- case study
- using data structures
- solutions to part 4 questions.
by "Nielsen BookData"