000 | 03620nam a2200613 i 4500 | ||
---|---|---|---|
001 | AH33175226 | ||
003 | StDuBDS | ||
005 | 20230127143125.0 | ||
006 | a|||||s|||| 00| 0 | ||
007 | cr ||||||||||| | ||
008 | 200225s2017 sz a gs 000|0|eng d | ||
020 | _a9783319640211 (e-book) | ||
040 |
_aStDuBDS _beng _cStDuBDS _erda _dUkPrAHLS |
||
072 | 7 |
_aPBWH _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aUYD _2bicssc |
|
072 | 7 |
_aMAT _2ukslc |
|
072 | 7 |
_aPBWH _2thema |
|
072 | 7 |
_aUYA _2thema |
|
072 | 7 |
_aUMZ _2thema |
|
072 | 7 |
_aUYD _2thema |
|
072 | 7 |
_aPBCD _2thema |
|
072 | 7 |
_aPBW _2thema |
|
072 | 7 |
_aUK _2thema |
|
072 | 7 |
_aUM _2thema |
|
072 | 7 |
_aUYQM _2thema |
|
100 | 1 |
_aO'Regan, Gerard, _eauthor. |
|
245 | 1 | 0 |
_aConcise guide to formal methods : _btheory, fundamentals and industry applications / _cGerard O'Regan. |
250 | _a1st edition | ||
264 | 1 |
_aCham : _bSpringer, _c2017. |
|
300 |
_a322 pages : _billustrations (black and white, and colour) |
||
336 |
_atext _2rdacontent |
||
337 |
_acomputer _2rdamedia |
||
338 |
_aonline resource _2rdacarrier |
||
366 | _b20170824 | ||
490 | 0 | _aUndergraduate Topics in Computer Science | |
520 | 8 | _aThis invaluable textbook/reference provides an easy-to-read guide to the fundamentals of formal methods, highlighting the rich applications of formal methods across a diverse range of areas of computing.Topics and features: introduces the key concepts in software engineering, software reliability and dependability, formal methods, and discrete mathematics; presents a short history of logic, from Aristotle's syllogistic logic and the logic of the Stoics, through Boole's symbolic logic, to Frege's work on predicate logic; covers propositional and predicate logic, as well as more advanced topics such as fuzzy logic, temporal logic, intuitionistic logic, undefined values, and the applications of logic to AI; examines the Z specification language, the Vienna Development Method (VDM) and Irish School of VDM, and the unified modelling language (UML); discusses Dijkstra's calculus of weakest preconditions, Hoare's axiomatic semantics of programming languages, and the classical approach of Parnas and his tabular expressions; provides coverage of automata theory, probability and statistics, model checking, and the nature of proof and theorem proving; reviews a selection of tools available to support the formal methodist, and considers the transfer of formal methods to industry; includes review questions and highlights key topics in every chapter, and supplies a helpful glossary at the end of the book.This stimulating guide provides a broad and accessible overview of formal methods for students of computer science and mathematics curious as to how formal methods are applied to the field of computing. | |
530 | _aAlso available in printed form ISBN 9783319640204 | ||
533 |
_aElectronic reproduction. _cAskews and Holts. _nMode of access: World Wide Web. |
||
650 | 7 |
_aMathematics _2ukslc |
|
650 | 7 |
_aMathematical modelling _2thema |
|
650 | 7 |
_aMathematical theory of computation _2thema |
|
650 | 7 |
_aSoftware Engineering _2thema |
|
650 | 7 |
_aSystems analysis & design _2thema |
|
650 | 7 |
_aMathematical logic _2thema |
|
650 | 7 |
_aApplied mathematics _2thema |
|
650 | 7 |
_aComputer hardware _2thema |
|
650 | 7 |
_aComputer programming / software engineering _2thema |
|
650 | 7 |
_aMachine learning _2thema |
|
655 | 7 | _2lcsh | |
856 | 4 | 0 |
_uhttps://www.vlebooks.com/vleweb/product/openreader?id=WestLondon&isbn=9783319640211 _zOpen e-book |
942 | _2ddc | ||
999 |
_c66087 _d66087 |