Skip to main content
SpringerLink
Log in

Dynamic Logic

  • Chapter
Handbook of Philosophical Logic

Part of the book series: Synthese Library ((SYLI,volume 165))

Abstract

This chapter presents a detailed overview of a certain approach to the field of study in theoretical computer science sometimes referred to as logics programs, or programming logics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abrahamson, K.: 1980, ‘Decidability and expressiveness of logics of processes’, PhD thesis, Tech. Rep. 80-08-01, Dept. of Comput. Sci., Univ. of Washington, Seattle, WA.

    Google Scholar 

  • Andréka, H., Németi, I., and Sain, I.: 1982, ‘A complete logic for reasoning about programs via nonstandard model theory’, Parts I and II, Theor. Comput. Sci. 17, 193–212, 259-278.

    Article  Google Scholar 

  • Apt, K. R.: 1981, ‘Ten years of Hoare’s logic: a survey-Part 1’, ACM Trans. Prog. Lang. Syst. 3, 431–483.

    Article  Google Scholar 

  • De Bakker, J.: 1980, Mathematical Theory of Program Correctness, Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  • Banachowski, L., Kreczmar, A., Mirkowska, G., Rasiowa, H., and Salwicki, A.: 1977, ‘An introduction to algorithmic logic: metamathematical investigations in the theory of programs’, in Mazurkiewitz and Pawlak (eds.), Mathematical Foundations of Computer Science, Banach Center Publications, Warsaw, pp. 7–99.

    Google Scholar 

  • Ben-Ari, M., Halpern, J. Y., and Pnueli, A.: 1982. ‘Deterministic propositional dynamic logic: finite models, complexity and completeness’, J. Comput. Syst. Sci. 25, 402–417.

    Article  Google Scholar 

  • Berman, F.: 1978, ‘Expressiveness hierarchy for PDL with rich tests’, Tech. Rep. 78-11-01, Dept. of Comput. Sci., Univ. of Washington, Seattle, WA.

    Google Scholar 

  • Berman, F.: 1979, ‘A completeness technique for D-axiomatizable semantics’, Proc. 11th ACM Symp. Theory of Comput., pp. 160–166.

    Google Scholar 

  • Berman, F.: 1982, ‘Semantics of looping programs in propositional dynamic logic’, Math. Syst. Theory, 15, 285–294.

    Article  Google Scholar 

  • Berman, F. and Paterson,M.: 1977, ‘Test-free propositional dynamic logic is strictly weaker than PDL’, Tech. Rep. 77-10-02, Dept. of Comput. Science, Univ. of Washington, Seattle, WA.

    Google Scholar 

  • Berman, F. and Paterson,M.: 1981, ‘Propositional dynamic logic is weaker without tests’, Theor. Comput. Sci. 16, 321–328.

    Article  Google Scholar 

  • Berman, P., Halpern, J. Y., and Tiuryn, J.: 1982. ‘On the power of nondeterminism in dynamic logic’, Proc. 9th Int. Colloq. Automata Lang. Programming, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, New York, pp. 48–60.

    Chapter  Google Scholar 

  • Burstall, R. M.: 1974, ‘Program proving as hand simulation with a little induction’, in Information Processing’ 74, North-Holland, Amsterdam, pp. 308–312.

    Google Scholar 

  • Constable, R. L.: 1977, ‘On the theory of programming logics’, Proc. 9th ACM Symp. Theory of Comput. pp. 269–285.

    Google Scholar 

  • Emerson, E. A. and Halpern, J. Y.: 1982, ‘Decision procedures and expressiveness in the temporal logic of branching time’, Proc. 14th ACM Symp. Theory of Comput. pp. 169–180.

    Google Scholar 

  • Engeler, E.: 1967, ‘Algorithmic properties of structures’, Math. Syst. Theory 1, 183–195.

    Article  Google Scholar 

  • Feldman, Y. A. and Harel, D.: 1982, ‘A probabilistic dynamic logic’, Proc. 14th ACM Symp. Theory of Comput. pp. 181–195. Also to appear in J. Comput. Syst. Sci.

    Google Scholar 

  • Fischer, M. J. and Ladner, R. E.: 1977, ‘Propositional modal logic of programs’, Proc. 9th ACM Symp. Theory of Comput. pp. 286–294.

    Google Scholar 

  • Fischer, M. J. and Ladner, R. E.: 1979, ‘Propositional dynamic logic of regular programs’, J. Comput. Syst. Sci. 18, 194–211.

    Article  Google Scholar 

  • Floyd,R.W.: 1967, ‘Assigning meanings to programs’, Proc. AMS Symp. Applied Math., Vol. 19, American Math. Society, Providence, RI, pp. 19–31.

    Google Scholar 

  • Friedman, H.: 1971, ‘Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory’, in Gandy and Yates (eds.), Logic Colloquium’ 69, North-Holland, Amsterdam, pp. 361–390.

    Chapter  Google Scholar 

  • Gabbay, D.: 1977, ‘Axiomatizations of logics of programs’, Manuscript, Bar-Han Univ., Ramat-Gan, Israel.

    Google Scholar 

  • Gabbay, D.., Pnueli, A., Shelah, S., and Stavi,J.: 1980, ‘On the temporal analysis of fairness’, Proc. 7th ACM Symp. Principles Prog. Lang. pp. 163–173.

    Google Scholar 

  • Hajek, P. and Kůrka, P.: 1981, ‘A second-order dynamic logic with array assignments’, Fund. Informaticae 4, 919–933.

    Google Scholar 

  • Halpern, J. Y.: 1981, ‘On the expressive power of dynamic logic, II’, Tech. Rep. TM-204, Mass. Inst. Tech., Lab. for Comput. Sci., Cambridge, MA.

    Google Scholar 

  • Halpern, J. Y.: 1982, ‘Deterministic process logic is elementary’, Proc. 23rd IEEE Symp. Found. Comput. Sci. pp. 204–216.

    Google Scholar 

  • Halpern, J. Y. and Reif, J. H.: 1983, ‘The propositional dynamic logic of deterministic well-structured programs’, Theor. Comput. Sci. 27, 127–165.

    Article  Google Scholar 

  • Harel, D.: 1979, First-Order Dynamic Logic, Lecture Notes in Computer Science, Vol. 68, Springer-Verlag, New York.

    Google Scholar 

  • Harel, D.: 1980, ‘Proving the correctness of regular deterministic programs: a unifying survey using dynamic logic’, Theor. Comput. Sci. 12, 61–81.

    Article  Google Scholar 

  • Harel, D. and Kozen, D.: 1982, ‘A programming language for the inductive sets, and applications’, in Proc. 9th Int. Colloq. Automata Lang. Programming, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, New York, pp. 313–329.

    Chapter  Google Scholar 

  • Harel, D., Kozen, D., and Parikh, R.: 1982, ‘Process logic: expressiveness, decidability, completeness’, J. Comput. Syst. Sci. 25, 144–170.

    Article  Google Scholar 

  • Harel, D., Meyer, A. R., and Pratt, V.R.: 1977, ‘Computability and completeness in logics of programs’, Proc. 9th ACM Symp. Theory of Comput. pp. 261–268.

    Google Scholar 

  • Harel, D., Pnueli, A., and Stavi, J.: 1983, ‘Propositional dynamic logic of nonregular programs’, J. Comput. Syst. Sci. 26, 222–243.

    Article  Google Scholar 

  • Harel, D., Pnueli, A., and Vardi, M.: 1982, ‘Two dimensional temporal logic and PDL with intersection’, Manuscript, The Weizmann Inst., Rehovot, Israel.

    Google Scholar 

  • Harel, D. and Pratt, V.R.: 1978, ‘Nondeterminism in logics of programs’, Proc. 5th ACM Symp. Principles Prog. Lang. pp. 203–213.

    Google Scholar 

  • Harel, D. and Sherman, R.: 1982a, ‘Propositional dynamic logic of flowcharts,’ Proc. Conf. Found. Comput. Theory, Lecture Notes in Computer Science, Vol. 158, Springer-Verlag, New York, pp. 195–206.

    Google Scholar 

  • Harel, D. and Sherman, R.: 1982b, ‘Looping vs. repeating in dynamic logic’, Inf. and Control 55, 175–192.

    Article  Google Scholar 

  • Hart, S., Shark, M., and Pnueli, A.: 1982, ‘Termination of probabilistic concurrent programs’, Proc. 9th ACM Symp. Principles Prog. Lang. pp. 1–6.

    Google Scholar 

  • Hitchcock, P. and Park, D.: 1973, ‘Induction rules and termination proofs’, in M. Nivat (ed.),Automata, Languages and Programming, North Holland, Amsterdam.

    Google Scholar 

  • Hoare, C. A. R.: 1969, An axiomatic basis for computer programming’, Comm. Assoc. Comput. Mach. 12, 576–580, 583.

    Google Scholar 

  • Hopcroft, J. E. and Ullman, J. D.: 1979, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA.

    Google Scholar 

  • Ianov, Y.I.: 1960, ‘The logical schemes of algorithms’, in Problems of Cybernetics, Vol. 1, Pergamon Press, New York, pp. 82–140.

    Google Scholar 

  • Keisler, J.: 1971,Model Theory for Infiniiary Logic, North Holland, Amsterdam.

    Google Scholar 

  • Kozen, D.: 1979, ‘A representation theorem for models of *-free PDL’, Tech. Rep. RC7864, IBM Research, Yorktown Heights, NY. Also in Lecture Notes in Computer Science, Vol. 85, Springer-Verlag, New York, 1980, pp. 351–362.

    Google Scholar 

  • Kozen, D.: 1981, ‘Semantics of probabilistic programs’, J. Comput. Syst. Sci. 22, 328–350.

    Article  Google Scholar 

  • Kozen, D.: 1982, ‘Results on the proposition μ-calculus’, Proc. 9th Int. Colloq. Automata Lang. Programming, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, New York, pp. 348–359.

    Chapter  Google Scholar 

  • Kozen, D. and Parikh, R.: 1982, ‘An elementary proof of the completeness of PDL’, Theor. Comput. Sci. 14, 113–118.

    Article  Google Scholar 

  • Lamport, L.: 1980, ‘“Sometime” is Sometimes “Not Never”’, Proc. 7th ACM Symp. Principles Prog. Lang. pp. 174–185.

    Google Scholar 

  • Lehmann, D. and Shelah, S.: 1982, ‘Reasoning with time and chance’, Inf. and Cont. 53, 165–198.

    Article  Google Scholar 

  • Luckham, D. C., Park, D., and Paterson, M.: 1970, ‘On formalized computer programs’, J. Comput. Syst. Sci. 4, 220–249.

    Article  Google Scholar 

  • Makowski, J. A.: 1980, ‘Measuring the expressive power of dynamic logics: an application of abstract model theory’, Proc. 7th Int. Colloq. Automata, Lang. Programming, Lecture Notes in Computer Science, Vol. 80, Springer-Verlag, New York, pp.409–421.

    Google Scholar 

  • Manders, K. L. and Daley, R. F.: 1982, ‘The complexity of the validity problem for dynamic logic’, Inf. and Cont. 54, 48–69.

    Article  Google Scholar 

  • Manna, Z.: 1974, Mathematical Theory of Computation, McGraw-Hill, New York.

    Google Scholar 

  • Manna, Z. and Pnueli, A.: 1981, ‘Verification of concurrent programs: temporal proof principles’, in D. Kozen (ed.), Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science, Vol. 131, Springer-Verlag, New York, pp. 200–252.

    Google Scholar 

  • Meyer, A. R.: 1980, ‘Ten thousand and one logics of programming’, Bull. European Assoc. Theor. Comput. Sci. 10, 11–29.

    Google Scholar 

  • Meyer, A. R. and Halpern, J. Y.: 1982, ‘Axiomatic definitions of programming languages: a theoretical assessment’, J. Assoc. Comput. Mach. 29, 555–576.

    Google Scholar 

  • Meyer, A. R. and Mitchell, J. C.: 1982, ‘Termination assertions for recursive programs: completeness and axiomatic definability’, Tech. Rep. TM-214, Mass. Inst. Tech., Lab. for Comput. Sci., Cambridge, MA.

    Google Scholar 

  • Meyer, A. R. and Parikh, R.: 1981, ‘Definability in dynamic logic’, J. Comput. Syst. Sci. 23, 279–298.

    Article  Google Scholar 

  • Meyer, A. R., Streett, R. S., and Mirkowska, G.: 198L ‘The deducibility problem in propositional dynamic logic’, in E. Engeler (ed.), Proc. Workshop Logic of Programs, Lecture Notes in Computer Science, Vol. 125, Springer-Verlag, New York, pp. 12–22.

    Google Scholar 

  • Meyer, A. R. and Tiuryn, J.: 1981, ‘A note on equivalences among logics of programs’, in D. Kozen (ed.), Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science, Vol. 131, Springer-Verlag, New York, pp. 282–299.

    Google Scholar 

  • Meyer, A. R. and Winklmann, K.: 1982, ‘Expressing program looping in regular dynamic logic’, Theor. Comput. Sci. 18, 301–323.

    Article  Google Scholar 

  • Mirko wska, G.: 1971, ‘On formalized systems of algorithmic logic’, Bull. Acad. Polon. Sci., Ser. Sci. Math. Astron. Phys. 19, 421–428.

    Google Scholar 

  • Mirko wska, G.: 1980, ‘Algorithmic logic with nondeterministic programs’, Fund. Informaticae 3, 45–64.

    Google Scholar 

  • Mirkowska, G.: 1981, ‘PAL-propositional algorithmic logic’, Fund. Informaticae 4, 675–760. Also, in Lecture Notes in Computer Science, Vol. 125, Springer-Verlag, New York, pp. 23-101.

    Google Scholar 

  • Moschovakis, Y. N.: 1974, Elementary Induction on Abstract Structures, North-Holland, Amsterdam.

    Google Scholar 

  • Nishimura, H.: 1979, ‘Sequential method in proportional dynamic logic’, Acta Informatica 12, 377–400.

    Article  Google Scholar 

  • Nishimura, H.: 1980, ‘Descriptively complete process logic’, Acta Informatica 14, 359–369.

    Article  Google Scholar 

  • Nishimura, H.: 1981, ‘Arithmetical completeness in first-order dynamic logic for concurrent programs’, Publ. Res. Inst. Math. Sci, Kyoto Univ. 17, 297–309.

    Article  Google Scholar 

  • Olshanski, T. and Pnueli, A.: 1981, ‘There exist decidable context free propositional dynamic logics’, Manuscript, The Weizmann Inst., Rehovot, Israel.

    Google Scholar 

  • Park, D.: 1976, ‘Finiteness is mu-ineffable’, Theor. Comput. Sci. 3, 173–181.

    Article  Google Scholar 

  • Parikh, R.: 1978a, ‘The completeness of propositional dynamic logic’, in Proc. 7th Symp. on Math. Found, of Comput. Sci., Lecture Notes in Computer Science, Vol. 64, Springer-Verlag, New York, pp. 403–415.

    Google Scholar 

  • Parikh, R.: 1978b, ‘A decidability result for a second order process logic’, Proc. 19th IEEE Symp. Found. Comput. Sci. pp. 177–183.

    Google Scholar 

  • Parikh, R.: 1981, ‘Propositional dynamic logics of programs: a survey’, in E. Engeler (ed.), Proc. Workshop on Logics of Programs Lecture Notes in Computer Science, Vol. 125, Springer-Verlag, New York, pp. 102–144.

    Google Scholar 

  • Paterson, M. and Hewitt, C.E.: 1970, ‘Comparative schematology’, in Proc. Project MAC Conf. Concurrent Syst. Parallel Comp., ACM, New York, pp. 119–128.

    Google Scholar 

  • Peterson, G. L.: 1978, ‘The power of tests in propositional dynamic logic’, Tech. Rep. 47, Dept. of Comput. Sci., Univ. of Rochester, NY.

    Google Scholar 

  • Pnueli, A.: 1977, ‘The temporal logic of programs’, Proc. 18th IEEE Symp. Found. Comput. Sci. pp. 46–57.

    Google Scholar 

  • Pratt, V. R.: 1976, ‘Semantical considerations on Floyd-Hoare logic’, Proc. 17th IEEE Symp. Found. Comput Sci. pp. 109–121.

    Google Scholar 

  • Pratt, V.R.: 1978, ‘A practical decision method for propositional dynamic logic’, Proc. 10th ACM Symp. Theory of Comput. pp. 326–337.

    Google Scholar 

  • Pratt, V.R.: 1979a, ‘Process logic’, Proc. 6th ACM Symp. Principles Prog. Lang. pp. 93–100.

    Google Scholar 

  • Pratt, V.R.: 1979b, ‘Models of program logics’, Proc. 20th IEEE Symp. Comput. Sci. pp.115–122.

    Google Scholar 

  • Pratt, V. R.: 1981a, “Using graphs to understand PDL”, in D. Kozen (ed.), Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science, Vol. 131, Springer-Verlag, New York, pp. 387–396.

    Google Scholar 

  • Pratt, V.R.: 1981b, ‘A decidable mu-calculus: preliminary report’, Proc. 22nd IEEE Symp. Found. Comput. Sci. pp. 421–427.

    Google Scholar 

  • Rabin, M. O.: 1969, ‘Decidability of second order theories and automata on infinite trees’, Trans. American Math. Soc. 141, 1–35.

    Google Scholar 

  • Rabin, M. O.: 1976, ‘Probabilistic algorithms’, in J.F. Traub (ed.), Algorithms and Complexity, Academic Press, New York.

    Google Scholar 

  • Ramshaw, L. H.: 1981, ‘Formalizing the analysis of algorithms’, PhD thesis, Stanford Univ; also Tech. Rep., Xerox Corp., Palo Alto.

    Google Scholar 

  • Rasiowa, H. and Sikorski, R.: 1963, Mathematics of Metamathematics, Warsaw.

    Google Scholar 

  • Rogers, H.: 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.

    Google Scholar 

  • Salwicki, A.: 1970, ‘Formalized algorithmic languages’, Bull Acad. Polon. Sci., Ser. Sci. Math. Astron. phys. 18, 227–232.

    Google Scholar 

  • Scott,D.S. and de Bakker, J. W.: 1969, ‘A theory of programs’, Unpublished Notes. IBM, Vienna.

    Google Scholar 

  • Sherman, R. and Harel, D.: 1982, ‘A combined proof of one-exponential decidability and completeness for PDL’, Proc. 1st Int. Workshop on Found. Theoret Comput. Sci., GTI, Paderborn, Fed. Rep. of Germany.

    Google Scholar 

  • Shoenfield, J. R.: 1967, Mathematical Logic, Addison-Wesley, Reading, MA.

    Google Scholar 

  • Sistla, A. P. and Clarke, E. M.: 1982, ‘The complexity of propositional linear temporal logics’,proc. 14th ACM Symp. Theory of Comput. pp. 159–168.

    Google Scholar 

  • Sokolowski, S.: 1980, ‘Programs as term transformers’, Fund. Informaticae 3, 419–432.

    Google Scholar 

  • Streett, R. S.: 1981, ‘Propositional dynamic logic of looping and converse’, Proc. 13th ACM Symp. Theory of Comput. pp.375–381.

    Google Scholar 

  • Streett, R. S.: 1982, ‘Propositional dynamic logic of looping and converse is elementarily decidable’, Inf. and Cont. 54, 121–141.

    Article  Google Scholar 

  • Tiuryn, J.: 1981a, ‘Unbounded program memory adds to the expressive power of first-order dynamic logic’, Proc. 22nd IEEE Symp. Found. Comput. Sci. pp. 335–339.

    Google Scholar 

  • Tiuryn, J.: 1981b, ‘A survey of the logic of effective definitions’, in E. Engeler (ed.), Proc. Workshop on Logics of Programs Lecture Notes in Computer Science, Vol. 125, Springer-Verlag, New York, pp. 198–245.

    Google Scholar 

  • Valiev, M. K.: 1980, ‘Decision complexity of variants of propositional dynamic logic’, Proc. 9th Symp. Math. Found. Comput. Sci, Lect. Notes in Comput. Sci. 88, 656–664.

    Google Scholar 

Download references

Authors
  1. David Harel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, Bar-Ilan University, Israel

    D. Gabbay

  2. Neuphilologische Fakultaet, University of Tuebingen, West Germany

    F. Guenthner

Rights and permissions

Reprints and permissions

Copyright information

© 1984 D. Reidel Publishing Company

About this chapter

Cite this chapter

Harel, D. (1984). Dynamic Logic. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic. Synthese Library, vol 165. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-6259-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-6259-0_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-6261-3

  • Online ISBN: 978-94-009-6259-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation