Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Automatic Verification of Sequential Infinite-State Processes

Automatic Verification of Sequential Infinite-State Processes

Burkart, Olaf

Paperback

Series: Lecture Notes in Computer Science, Book 1354

General MathematicsProgramming

ISBN10: 3540639829
ISBN13: 9783540639824
Publisher: Springer Nature
Published: Dec 17 1997
Pages: 166
Weight: 0.57
Height: 0.38 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics

View All