000 03128nam a22005535i 4500
001 978-3-540-69678-0
003 DE-He213
005 20240423132513.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540696780
_9978-3-540-69678-0
024 7 _a10.1007/3-540-69678-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _aBurkart, Olaf.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aAutomatic Verification of Sequential Infinite-State Processes
_h[electronic resource] /
_cby Olaf Burkart.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aX, 166 p. 1 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1354
505 0 _aBackground -- Pushdown Processes -- Model Checking -- Equivalence Checking -- Summary and Perspectives.
520 _aA 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer programming.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Techniques.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540639824
776 0 8 _iPrinted edition:
_z9783662195864
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1354
856 4 0 _uhttps://doi.org/10.1007/3-540-69678-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188480
_d188480