Cantitate/Preț
Produs

Automatic Verification of Sequential Infinite-State Processes

Autor Olaf Burkart
en Limba Engleză Paperback – 17 dec 1997
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.
Citește tot Restrânge

Preț: 31505 lei

Preț vechi: 39382 lei
-20% Nou

Puncte Express: 473

Preț estimativ în valută:
5575 6537$ 4896£

Carte tipărită la comandă

Livrare economică 06-20 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540639824
ISBN-10: 3540639829
Pagini: 180
Ilustrații: X, 166 p. 1 illus.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.28 kg
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Background.- Pushdown Processes.- Model Checking.- Equivalence Checking.- Summary and Perspectives.

Textul de pe ultima copertă

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. Two new algorithms are introduced allowing for automatic verification of important aspects such as safety or liveness properites of a given infinite-state system. The formal framework developed involves recent results from various theoretical areas like process algebras, fixpoint theory, modal logics and model checking.

Caracteristici

Includes supplementary material: sn.pub/extras