000			03281nam a2200505 i 4500
001			6267400
003			IEEE
005			20220712204654.0
006			m o d
007			cr |n|||||||||
008			151223s2000 maua ob 001 eng d
020			_a9780262274951 _qebook
020			_z0262274957 _qelectronic
020			_z9780262527668 _qprint
035			_a(CaBNVSL)mat06267400
035			_a(IDAMS)0b000064818b43d8
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.9.L63 _bH37 2000eb
100	1		_aHarel, David, _d1950- _922598
245	1	0	_aDynamic logic / _cDavid Harel, Dexter Kozen, Jerzy Tiuryn.
264		1	_aCambridge, Massachusetts : _bMIT Press, _c2000.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2000]
300			_a1 PDF (xv, 459 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aFoundations of computing.
504			_aIncludes bibliographical references and index.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aAmong the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications.This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/23/2015.
650		0	_aFormal methods (Computer science) _93854
650		0	_aComputer logic. _922599
655		0	_aElectronic books. _93294
700	1		_aKozen, Dexter, _d1951- _922600
700	1		_aTiuryn, Jerzy. _922601
710	2		_aIEEE Xplore (Online Service), _edistributor. _922602
710	2		_aMIT Press, _epublisher. _922603
776	0	8	_iPrint version _z9780262527668
830		0	_aFoundations of computing. _922604
856	4	2	_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267400
942			_cEBK
999			_c73054 _d73054