Bisher € 101,32
Lieferbar innert 2 Wochen
BeschreibungAn innovative hands-on introduction to techniques for specifying the behaviour of software components.
InhaltsverzeichnisIntroduction; Part I. Algorithms: 1. Specifying algorithms; 2. Verifying algorithms: basic techniques; 3. Verifying algorithms: some examples; 4. Additional verification techniques; Part II. Data Representations: 5. Data representation: a case study; 6. Data representation: additional examples; Part III. Language Recognizers: 7. Basic concepts; 8. State-transition diagrams; 9. Regular languages; 10. Context-free languages; 11. Parsing; 12. A taste of computability theory; Appendix A: programming language reference; Appendix B: hints for selected exercises; Index.
Pressestimmen'The treatment of state diagrams or grammars as specialized specification languages and embedding them into a more general context of specifying algorithms and data representations is an interesting approach that is quite novel ... I would like to single out both the author's approach and his style of presentation as very positive features of the book. Reading this book is definitely inspiring, and not just for a student.' Computing Reviews 'This book was written to support a short course in the second or third year of an undergraduate computer science, software engineering, or software design program. The prerequisites are fairly modest: some programming experience and some exposure to the most basic concepts of discrete mathematics and to the language of elementary logic. Using this book will help readers improve their programming skills and develop a solid foundation for subsequent courses in advanced algorithms and data structures, software design, formal methods, and compilers.' Zentralblatt fur Mathematik
Untertitel: Sprache: Englisch.
Verlag: CAMBRIDGE UNIV PR
Erscheinungsdatum: Januar 2015
Seitenanzahl: 302 Seiten