Free Delivery Over $100
|
|
|||
|
||||
OverviewIt takes more e?ort to verify that digital system designs are correct than it does to design them, and as systems get more complex the proportion of cost spent on veri?cation is increasing (one estimate is that veri?cation complexity rises as the square of design complexity). Although this veri?cation crisis was predicted decades ago, it is only recently that powerful methods based on mathematical logic and automata theory have come to the designers’ rescue. The ?rst such method was equivalence checking, which automates Boolean algebra calculations.Nextcamemodelchecking,whichcanautomatically verify that designs have – or don’t have – behaviours of interest speci?ed in temporal logic. Both these methods are available today in tools sold by all the major design automation vendors. It is an amazing fact that ideas like Boolean algebra and modal logic, originating frommathematicians andphilosophersbeforemodern computers were invented, have come to underlie computer aided tools for creating hardware designs. The recent success of ’formal’ approaches to hardware veri?cation has lead to the creation of a new methodology: assertion based design, in which formal properties are incorporated into designs and are then validated by a combination of dynamic simulation and static model checking. Two industrial strength property languages based on tem- ral logic are undergoing IEEE standardisation. It is not only hardwaredesignand veri?cation that is changing: new mathematical approaches to software veri?cation are starting to be - ployed. Microsoft provides windows driver developers with veri?cation tools based on symbolic methods. Full Product DetailsAuthor: Ganesh GopalakrishnanPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 2006 ed. Dimensions: Width: 15.50cm , Height: 2.80cm , Length: 23.50cm Weight: 1.950kg ISBN: 9780387244181ISBN 10: 0387244182 Pages: 472 Publication Date: 02 June 2006 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsMathematical Preliminaries.- Cardinalities and Diagonalization.- Binary Relations.- Mathematical Logic, Induction, Proofs.- Dealing with Recursion.- Strings and Languages.- Machines, Languages, DFA.- NFA and Regular Expressions.- Operations on Regular Machinery.- The Automaton/Logic Connection, Symbolic Techniques.- The ‘Pumping’ Lemma.- Context-free Languages.- Push-down Automata and Context-free Grammars.- Turing Machines.- Basic Undecidability Proofs.- Advanced Undecidability Proofs.- Basic Notions in Logic including SAT.- Complexity Theory and NP-Completeness.- DFA for Presburger Arithmetic.- Model Checking: Basics.- Model Checking: Temporal Logics.- Model Checking: Algorithms.- Conclusions.ReviewsFrom the reviews: <p> One of the constant challenges faced by computer science faculty is how to tie in the theory of computing with applications. This text attempts to do just that a ] . Overall, this book is a good undergraduate theory text. a ] It includes exercises, with software tools to aid in visualization of key ideas. a ] The exercises are appropriate for an undergraduate-level class. a ] It is a good text a ] . (M. D. Derk, Computing Reviews, December, 2006) <p> The book under review shows, logic and automata theory can be combined to provide powerful tools for checking computer code a ] . There is no doubt that the book was written with great care and that it caters for a real need. a ] the book is written in a very lively style, which makes reading it quite pleasurable. a ] many nice applications of automata that are peppered throughout the book. (S. C. Coutinho, SIGACT News, Vol. 39 (3), 2008) Author InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
