Computation Engineering: Applied Automata Theory and Logic

ISBN-13: 9780387244181 / Angielski / Twarda / 2006 / 472 str.

Ganesh Gopalakrishnan

Opis

It 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."

Recenzje

From the reviews:

"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 ... . Overall, this book is a good undergraduate theory text. ... It includes exercises, with software tools to aid in visualization of key ideas. ... The exercises are appropriate for an undergraduate-level class. ... It is a good text ... ." (M. D. Derk, Computing Reviews, December, 2006)

"The book under review shows, logic and automata theory can be combined to provide powerful tools for checking computer code ... . There is no doubt that the book was written with great care and that it caters for a real need. ... the book is written in a very lively style, which makes reading it quite pleasurable. ... many nice applications of automata that are peppered throughout the book." (S. C. Coutinho, SIGACT News, Vol. 39 (3), 2008)

Spis treści

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

Blurb

"This classroom-tested undergraduate textbook is unique in presenting logic and automata theory as a single subject...I highly recommend this book to you as the best route I know into the concepts underlying modern industrial formal verification." - Dr. Michael J.C. Gordon FRS, The University of Cambridge Computer Laboratory

 

"This is a valuable book in my opinion.  I learned a good deal from reading it, and encountered many attractive topic treatments and fresh insights, throughout.  I certainly plan to add it to my reference shelf and recommend it to my students and colleagues.  It covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field.  In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.  The book is well organized for coordinated use in several courses, ranging from core udnergraduate to senior and graduate level topics." - Professor Steven D. Johnson, Indiana University