NEU Grand Library | TRNC Library


	NEU GRAND LIBRARY Opening Hours: Monday-Saturday, 08:00-20:00 \| E-mail: library@neu.edu.tr

You are not logged in

Show Basket

Home

Advanced Search

Back

Add to Basket

Brief display

MARC Display

Reserve

Rigorous software development : (Almeida, Jose Bacelar.)

Bibliographical information (record 429147)

Rigorous software development :
Subtitle:	an introduction to program verification /
Author:	Almeida, Jose Bacelar. Search Author in Amazon Books
Publisher:	Springer,
ISBN:	9780857290175
Edition:	2011.
Classification:	QA76.758

Detailed notes

- Includes index.

- 1. Introduction -- 2. An Overview of Formal Methods Tools and Techniques -- 3. Propositional Logic -- 4. First-Order Logic -- 5. Hoare Logic -- 6. Generating Verification Conditions -- 7. Safety Properties -- 8. Procedures and Contracts -- 9. Specifying C Programs --10. Verifying C Programs -- Bibliography -- Index.

- The use of mathematical methods in the development of software is essential when reliable systems are sought; in particular they are now strongly recommended by the official norms adopted in the production of critical software. Program Verification is the area of computer science that studies mathematical methods for checking that a program conforms to its specification. This text is a self-contained introduction to program verification using logic-based methods, presented in the broader context of formal methods for software engineering. The idea of specifying the behaviour of individual software components by attaching contracts to them is now a widely followed approach in program development, which has given rise notably to the development of a number of behavioural interface specification languages and program verification tools. A foundation for the static verification of programs based on contract-annotated routines is laid out in the book. These can be independently verified, which provides a modular approach to the verification of software. The text assumes only basic knowledge of standard mathematical concepts that should be familiar to any computer science student. It includes a self-contained introduction to propositional logic and first-order reasoning with theories, followed by a study of program verification that combines theoretical and practical aspects - from a program logic (a variant of Hoare logic for programs containing user-provided annotations) to the use of a realistic tool for the verification of C programs (annotated using the ACSL specification language), through the generation of verification conditions and the static verification of runtime errors.