Specifying Software
A Hands-On Introduction
$59.99 (X)
- Author: R. D. Tennent, Queen's University, Ontario
- Date Published: February 2002
- availability: Available
- format: Paperback
- isbn: 9780521004015
$
59.99
(X)
Paperback
-
This innovative volume provides a hands-on introduction to techniques for specifying the behavior of software components. A text for a second-year undergraduate course in Computer Science and Computer Engineering programs, it is also suitable for self-study. This book will help students to improve their 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 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. The presentation is based on numerous examples and case studies appropriate to the level of programming expertise of the intended readership.
Read more- Theoretical material oriented to practical use
- Hands-on approach based on small programming examples
- Minimal prerequisites allow specification to be taught early in the undergraduate curriculum
Reviews & endorsements
"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..." Computing Reviews
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: February 2002
- format: Paperback
- isbn: 9780521004015
- length: 302 pages
- dimensions: 235 x 156 x 23 mm
- weight: 0.48kg
- contains: 29 b/w illus. 1 table 215 exercises
- availability: Available
Table of Contents
Introduction
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×