| Automatic Verification of Sequential Infinite-State Processes Contributor(s): Burkart, Olaf (Author) |
|
 |
ISBN: 3540639829 ISBN-13: 9783540639824 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback Published: December 1997 |
| Additional Information |
| BISAC Categories: - Mathematics | Infinity - Computers | Software Development & Engineering - General - Computers | Programming - General |
| Dewey: 515.24 |
| LCCN: 98008413 |
| Series: Lecture Notes in Computer Science, |
| Physical Information: 0.38" H x 6.14" W x 9.21" (0.57 lbs) 166 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: A common approach in software engineering is to apply during the design phase a variety of structured techniques like top-down design, decomposition and abstraction, while only subsequently, in the implementation phase, is the design tested to ensure reliability. But this approach neglects that central aspects of software design and program development have a strong formal character which admits tool support for the construction of reliable and correct computer systems based on formal reasoning. This monograph provides much information both for theoreticians interested in algebraic theories, and for software engineers building practically relevant tools. The author presents the theoretical foundations needed for the verification of reactive, sequential infinite-state systems. |