Automatic Verification of Sequential Infinite-State Processes [electronic resource] /
Contributor(s): SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 1354Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1997.Description: X, 166 p. 1 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540696780.Subject(s): Computer science | Computer programming | Software engineering | Computer logic | Computer Science | Logics and Meanings of Programs | Software Engineering | Programming TechniquesOnline resources: Click here to access online
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.