Automatic Verification of Sequential Infinite-State Processes

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 cent...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Burkart, Olaf (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
Έκδοση:1st ed. 1997.
Σειρά:Lecture Notes in Computer Science, 1354
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03261nam a2200541 4500
001 978-3-540-69678-0
003 DE-He213
005 20191026212642.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 |a 9783540696780  |9 978-3-540-69678-0 
024 7 |a 10.1007/3-540-69678-4  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.L63 
050 4 |a QA76.5913 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
072 7 |a UYF  |2 thema 
082 0 4 |a 005.1015113  |2 23 
100 1 |a Burkart, Olaf.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Automatic Verification of Sequential Infinite-State Processes  |h [electronic resource] /  |c by Olaf Burkart. 
250 |a 1st ed. 1997. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1997. 
300 |a X, 166 p. 1 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1354 
505 0 |a Background -- Pushdown Processes -- Model Checking -- Equivalence Checking -- Summary and Perspectives. 
520 |a 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. 
650 0 |a Computer logic. 
650 0 |a Software engineering. 
650 0 |a Computer programming. 
650 1 4 |a Logics and Meanings of Programs.  |0 http://scigraph.springernature.com/things/product-market-codes/I1603X 
650 2 4 |a Software Engineering.  |0 http://scigraph.springernature.com/things/product-market-codes/I14029 
650 2 4 |a Programming Techniques.  |0 http://scigraph.springernature.com/things/product-market-codes/I14010 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540639824 
776 0 8 |i Printed edition:  |z 9783662195864 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1354 
856 4 0 |u https://doi.org/10.1007/3-540-69678-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)