000 02986nam a22005415i 4500
001 978-3-540-69678-0
003 DE-He213
005 20160624102059.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 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aBurkart, Olaf.
_eauthor.
245 1 0 _aAutomatic Verification of Sequential Infinite-State Processes
_h[electronic resource] /
_cby Olaf Burkart.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aX, 166 p.
_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,
_x0302-9743 ;
_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 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Techniques.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540639824
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1354
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-69678-4
942 _2EBK7320
_cEBK
999 _c36614
_d36614