Automatic Verification of Sequential Infinite-State Processes [electronic resource] / by Olaf Burkart.

By: Burkart, Olaf [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 1354Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1997Description: X, 166 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540696780Subject(s): Computer science | Software engineering | Logic design | Computer Science | Logics and Meanings of Programs | Software Engineering | Programming TechniquesAdditional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access online
Contents:
Background -- Pushdown Processes -- Model Checking -- Equivalence Checking -- Summary and Perspectives.
In: Springer eBooksSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK7320

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

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha