Specifying Software
PAYBACK Punkte
53 °P sammeln!
Provides an innovative hands-on introduction to techniques for specifying the behaviour of software components. It is primarily intended for use as a text book for a course in the 2nd or 3rd year of Computer Science and Computer Engineering programs, but it is also suitable for self-study. Using this book will help the reader improve programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The presentation is based on numerous examples and case ...
Provides an innovative hands-on introduction to techniques for specifying the behaviour of software components. It is primarily intended for use as a text book for a course in the 2nd or 3rd year of Computer Science and Computer Engineering programs, but it is also suitable for self-study. Using this book will help the reader improve programming skills and gain a sound foundation and motivation for subsequent courses in advanced algorithms and data structures, software design, formal methods, compilers, programming languages, and theory. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership. The main topics covered are techniques for using programmer-friendly assertional notations to specify, develop, and verify small but non-trivial algorithms and data representations, and the use of state diagrams, grammars, and regular expressions to specify and develop recognizers for formal languages.
Table of contents:
Introduction; Part A: 1. Specifying algorithms; 2. Verifying algorithms: basic techniques; 3. Verifying algorithms: some examples; 4. Additional techniques and examples; Part B: 5. Case study: a simple data base; 6. Examples of data representations; Part C. Language Recognizers: 7. Basic concepts; 8. State-transition diagrams; 9. Regular languages; 10. Context-free languages; 11. Parsing; 12. Unimplementable specifications; Hints for selected exercises; Index.
An introductory textbook on software specifications suitable for programming students with some background in discrete mathematics and logic. The author adopts a unique 'hands-on' approach, presenting basic concepts in the context of numerous small programming examples. Topics include assertional notations, state diagrams, grammars, and regular expressions.
An innovative hands-on introduction to techniques for specifying the behaviour of software components
Table of contents:
Introduction; Part A: 1. Specifying algorithms; 2. Verifying algorithms: basic techniques; 3. Verifying algorithms: some examples; 4. Additional techniques and examples; Part B: 5. Case study: a simple data base; 6. Examples of data representations; Part C. Language Recognizers: 7. Basic concepts; 8. State-transition diagrams; 9. Regular languages; 10. Context-free languages; 11. Parsing; 12. Unimplementable specifications; Hints for selected exercises; Index.
An introductory textbook on software specifications suitable for programming students with some background in discrete mathematics and logic. The author adopts a unique 'hands-on' approach, presenting basic concepts in the context of numerous small programming examples. Topics include assertional notations, state diagrams, grammars, and regular expressions.
An innovative hands-on introduction to techniques for specifying the behaviour of software components
Andere Kunden interessierten sich für
