Dynamic logic /

Saved in:
Bibliographic Details
Author / Creator:Harel, David, 1950-
Imprint:Cambridge, Mass. : MIT Press, 2000.
Description:1 online resource (xv, 459 pages) : illustrations.
Language:English
Series:Foundations of computing.
Foundations of computing.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11138829
Hidden Bibliographic Details
Other authors / contributors:Kozen, Dexter, 1951-
Tiuryn, Jerzy.
ISBN:9780262274951
0262274957
1423728335
9781423728337
0262082896 (alk. hc)
9780262527668
0262527669
Notes:Includes bibliographical references and index.
English.
Print version record.
Summary:Among 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.
Other form:Print version: Harel, David, 1950- Dynamic logic. Cambridge, Mass. : MIT Press, 2000 0262082896

MARC

LEADER 00000cam a22000004a 4500
001 11138829
005 20210426223158.8
006 m o d
007 cr cnu---unuuu
008 051006s2000 maua ob 001 0 eng d
010 |z  00030380  
015 |a GBA1-5923 
019 |a 1033566843  |a 1057976598  |a 1108936087  |a 1112964140  |a 1127102682  |a 1154981981  |a 1156860252  |a 1159644854  |a 1167254484  |a 1241943896 
020 |a 9780262274951  |q (electronic bk.) 
020 |a 0262274957  |q (electronic bk.) 
020 |a 1423728335 
020 |a 9781423728337 
020 |z 0262082896 (alk. hc) 
020 |a 9780262527668  |q (print) 
020 |a 0262527669 
035 |a (OCoLC)61848680  |z (OCoLC)1033566843  |z (OCoLC)1057976598  |z (OCoLC)1108936087  |z (OCoLC)1112964140  |z (OCoLC)1127102682  |z (OCoLC)1154981981  |z (OCoLC)1156860252  |z (OCoLC)1159644854  |z (OCoLC)1167254484  |z (OCoLC)1241943896 
035 9 |a (OCLCCM-CC)61848680 
037 |a 2516  |b MIT Press 
037 |a 9780262274951  |b MIT Press 
040 |a N$T  |b eng  |e pn  |c N$T  |d OCLCQ  |d OCLCG  |d OCLCQ  |d N$T  |d OCLCQ  |d OCLCO  |d OCLCQ  |d IEEEE  |d OCLCF  |d NLGGC  |d OCLCQ  |d YDXCP  |d OCLCQ  |d ESU  |d U3W  |d INARC  |d VTS  |d MERER  |d AGLDB  |d OCLCQ  |d AU@  |d MITPR  |d STF  |d LEAUB  |d HS0  |d UKBTH  |d EBLCP  |d UKSSU  |d LDP  |d LUN 
049 |a MAIN 
050 4 |a QA76.9.L63  |b H37 2000eb 
072 7 |a COM  |x 052000  |2 bisacsh 
072 7 |a COM  |x 037000  |2 bisacsh 
072 7 |a COM  |x 013000  |2 bisacsh 
072 7 |a COM  |x 032000  |2 bisacsh 
072 7 |a COM  |x 018000  |2 bisacsh 
072 7 |a COM  |x 014000  |2 bisacsh 
072 7 |a COM  |x 067000  |2 bisacsh 
100 1 |a Harel, David,  |d 1950-  |0 http://id.loc.gov/authorities/names/n79038969 
245 1 0 |a Dynamic logic /  |c David Harel, Dexter Kozen, Jerzy Tiuryn. 
260 |a Cambridge, Mass. :  |b MIT Press,  |c 2000. 
300 |a 1 online resource (xv, 459 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Foundations of computing. 
504 |a Includes bibliographical references and index. 
588 0 |a Print version record. 
520 |a Among 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. 
505 0 |a I. Fundamental Concepts -- 1. Mathematical Preliminaries -- 2. Computability and Complexity -- 3. Logic -- 4. Reasoning About Programs -- II. Propositional Dynamic Logic -- 5. Propositional Dynamic Logic -- 6. Filtration and Decidability -- 7. Deductive Completeness -- 8. Complexity of PDL -- 9. Nonregular PDL -- 10. Other Variants of PDL -- III. First-Order Dynamic Logic -- 11. First-Order Dynamic Logic -- 12. Relationships with Static Logics -- 13. Complexity -- 14. Axiomatization -- 15. Expressive Power -- 16. Variants of DL -- 17. Other Approaches. 
546 |a English. 
650 0 |a Computer logic.  |0 http://id.loc.gov/authorities/subjects/sh97004631 
650 0 |a Formal methods (Computer science)  |0 http://id.loc.gov/authorities/subjects/sh99003622 
650 6 |a Logique informatique. 
650 6 |a Méthodes formelles (Informatique) 
650 7 |a COMPUTERS  |x Reference.  |2 bisacsh 
650 7 |a COMPUTERS  |x Machine Theory.  |2 bisacsh 
650 7 |a COMPUTERS  |x Computer Literacy.  |2 bisacsh 
650 7 |a COMPUTERS  |x Information Technology.  |2 bisacsh 
650 7 |a COMPUTERS  |x Data Processing.  |2 bisacsh 
650 7 |a COMPUTERS  |x Computer Science.  |2 bisacsh 
650 7 |a COMPUTERS  |x Hardware  |x General.  |2 bisacsh 
650 7 |a Computer logic.  |2 fast  |0 (OCoLC)fst00872265 
650 7 |a Formal methods (Computer science)  |2 fast  |0 (OCoLC)fst00932926 
650 7 |a Engineering & Applied Sciences.  |2 hilcc 
650 7 |a Computer Science.  |2 hilcc 
653 |a COMPUTER SCIENCE/Theoretical Computer Science 
655 0 |a Electronic books. 
655 4 |a Electronic books. 
700 1 |a Kozen, Dexter,  |d 1951-  |0 http://id.loc.gov/authorities/names/n82026953 
700 1 |a Tiuryn, Jerzy. 
776 0 8 |i Print version:  |a Harel, David, 1950-  |t Dynamic logic.  |d Cambridge, Mass. : MIT Press, 2000  |z 0262082896  |w (DLC) 00030380  |w (OCoLC)43894182 
830 0 |a Foundations of computing.  |0 http://id.loc.gov/authorities/names/n83731477 
903 |a HeVa 
929 |a oclccm 
999 f f |i 0172daf4-62a6-5de6-b092-f0d1dc95276d  |s c3bbb5bc-53ae-55e2-a01e-6ec54a070b70 
928 |t Library of Congress classification  |a QA76.9.L63 H37 2000eb  |l Online  |c UC-FullText  |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=e000xna&AN=138542  |z eBooks on EBSCOhost  |g ebooks  |i 12229484