Burkart, Olaf.
Automatic Verification of Sequential Infinite-State Processes [electronic resource] / by Olaf Burkart. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1997. - X, 166 p. online resource. - Lecture Notes in Computer Science, 1354 0302-9743 ; . - Lecture Notes in Computer Science, 1354 .
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.
9783540696780
10.1007/3-540-69678-4 doi
Computer science.
Software engineering.
Logic design.
Computer Science.
Logics and Meanings of Programs.
Software Engineering.
Programming Techniques.
QA76.9.L63 QA76.5913 QA76.63
005.1015113
Automatic Verification of Sequential Infinite-State Processes [electronic resource] / by Olaf Burkart. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1997. - X, 166 p. online resource. - Lecture Notes in Computer Science, 1354 0302-9743 ; . - Lecture Notes in Computer Science, 1354 .
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.
9783540696780
10.1007/3-540-69678-4 doi
Computer science.
Software engineering.
Logic design.
Computer Science.
Logics and Meanings of Programs.
Software Engineering.
Programming Techniques.
QA76.9.L63 QA76.5913 QA76.63
005.1015113