Robert P. Kurshan - Böcker

Formal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required to behave reliably. To be acceptable in an industrial setting, formal verification must be highly algorithmic; to cope with design complexity, it must support a top-down design methodology that leads from an abstract design to its detailed implementation. That combination of requirements points directly to the widely recognized solution of automata-theoretic verification, on account of its expressiveness, computational complexity, and perhaps general utility as well. This book develops the theory of automata-theoretic verification from its foundations, with a focus on algorithms and heuristics to reduce the computational complexity of analysis. It is suitable as a text for a one-or two-semester graduate course, and is recommended reading for anyone planning to use a verification tool, such as COSPAN or SMV.An extensive bibliography that points to the most recent sources, and extensive discussions of methodology and comparisons with other techniques, make this a useful resource for research or verification tool development, as well. Originally published in 1995. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Formal verification increasingly has become recognized as an answer to the problem of how to create ever more complex control systems, which nonetheless are required to behave reliably. To be acceptable in an industrial setting, formal verification must be highly algorithmic; to cope with design complexity, it must support a top-down design methodology that leads from an abstract design to its detailed implementation. That combination of requirements points directly to the widely recognized solution of automata-theoretic verification, on account of its expressiveness, computational complexity, and perhaps general utility as well. This book develops the theory of automata-theoretic verification from its foundations, with a focus on algorithms and heuristics to reduce the computational complexity of analysis. It is suitable as a text for a one-or two-semester graduate course, and is recommended reading for anyone planning to use a verification tool, such as COSPAN or SMV.An extensive bibliography that points to the most recent sources, and extensive discussions of methodology and comparisons with other techniques, make this a useful resource for research or verification tool development, as well. Originally published in 1995. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

It features simple mathematical calculations, an explanation of basic financial objects like stocks, bonds, ladders, CDs, ETFs, or annuities, a discussion of how to evaluate financial risk, examinations of insurance, fraud deterrence, dollar cost averaging, benefits of a mortgage, risks of a pension, and general advice about healthcare.

This volume contains the proceedings of the second workshopon Computer Aided Verification, held at DIMACS, RutgersUniversity, June 18-21, 1990. Itfeatures theoreticalresults that lead to new or more powerful verificationmethods. Among these are advances in the use of binarydecision diagrams, dense time, reductions based upon partialorder representations and proof-checking in controllerverification. The motivation for holding a workshop oncomputer aided verification was to bring together work oneffective algorithms or methodologies for formalverification - as distinguished, say,from attributes oflogics or formal languages. The considerable interestgenerated by the first workshop, held in Grenoble, June 1989(see LNCS 407), prompted this second meeting. The generalfocus of this volume is on the problem of making formalverification feasible for various models of computation. Specific emphasis is on models associated with distributedprograms, protocols, and digital circuits. The general testof algorithm feasibility is to embed it into a verificationtool, and exercise that tool on realistic examples: theworkshop included sessionsfor the demonstration of newverification tools.