Computation Engineering: Applied Automata Theory and Logic
It takes more effort 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 verification is increasing (one estimate is that verification complexity rises as the square of design complexity). Although this verification 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 first such method was equivalence checking, which automates Boolean algebra calculations.Nextcamemodelchecking,whichcanautomatically verify that designs have – or don’t have – behaviours of interest specified 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 from mathematicians and philosophers before modern computers were invented, have come to underlie computer aided tools for creating hardware designs. The recent success of ’formal’ approaches to hardware verification 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 verification that is changing: new mathematical approaches to software verification are starting to be - ployed. Microsoft provides windows driver developers with verification tools based on symbolic methods.
1111328687
Computation Engineering: Applied Automata Theory and Logic
It takes more effort 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 verification is increasing (one estimate is that verification complexity rises as the square of design complexity). Although this verification 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 first such method was equivalence checking, which automates Boolean algebra calculations.Nextcamemodelchecking,whichcanautomatically verify that designs have – or don’t have – behaviours of interest specified 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 from mathematicians and philosophers before modern computers were invented, have come to underlie computer aided tools for creating hardware designs. The recent success of ’formal’ approaches to hardware verification 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 verification that is changing: new mathematical approaches to software verification are starting to be - ployed. Microsoft provides windows driver developers with verification tools based on symbolic methods.
124.0
Out Of Stock
5
1
Computation Engineering: Applied Automata Theory and Logic
472
Computation Engineering: Applied Automata Theory and Logic
472Related collections and offers
124.0
Out Of Stock
Product Details
| ISBN-13: | 9780387244181 |
|---|---|
| Publisher: | Springer US |
| Publication date: | 06/02/2006 |
| Edition description: | 2006 |
| Pages: | 472 |
| Product dimensions: | 6.10(w) x 9.25(h) x 0.04(d) |
From the B&N Reads Blog