David Harel, Dexter Kozen, Jerzy Tiuryn  Home/Search
Context Related
| wisdom.weizmann.ac.il...DynamicLogic.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.il/~dharel/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not... (Update)
Cited by: More
Artificial Intelligence and Rational Self-Government - Doyle (1988) (Correct)
Fragments of Language - Ian Pratt-Hartmann Department (Correct)
Modal Kleene Algebra and Applications - Survey Jules Desharnais (Correct)
Active bibliography (related documents): More All
2.0: Dynamic Algebras: Examples, Constructions, Applications - Pratt (Correct)
1.8: Process Logic: Expressiveness, Decidability, Completeness - Harel, Kozen, Parikh (1982) (Correct)
1.8: Kleene Algebra with Tests - Kozen (1999) (Correct)
Similar documents based on text: More All
0.2: On the Completeness of Propositional Hoare Logic - Kozen, Tiuryn (2001) (Correct)
0.2: The Complexity of Simple Subtyping Systems - Rehof (1998) (Correct)
0.1: Unconventional Programming - Us (Correct)
Related documents from co-citation: More All
16: Logics of programs (context) - Kozen, Tiuryn - 1990
14: Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
13: Semantical considerations on Floyd-Hoare logic - Pratt - 1976
BibTeX entry: (Update)
D. Harel. Dynamic logic. In D.M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, chapter 10, pages 497--604. D. Reidel, Dordrecht, 1984. http://citeseer.ist.psu.edu/harel84dynamic.html More
@incollection{ harel84dynamic,
author = "D. Harel",
title = "Dynamic Logic",
booktitle = "Handbook of Philosophical Logic Volume {II} --- Extensions of Classical Logic",
publisher = "D.~Reidel Publishing Company: Dordrecht, The Netherlands",
editor = "D. Gabbay and F. Guenther",
pages = "497--604",
year = "1984",
url = "citeseer.ist.psu.edu/harel84dynamic.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1975
725 Temporal and modal logic (context) - Emerson - 1990 ACM DBLP
650 An axiomatic basis for computer programming (context) - Hoare - 1969 ACM DBLP
539 The temporal logic of programs (context) - Pnueli - 1977 ACM DBLP
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
362 Dynamic logic - Harel - 1984 ACM
343 Modal Logic: An Introduction (context) - Chellas - 1980
291 A logical calculus of the ideas immanent in nervous activity (context) - McCulloch, Pitts - 1943 ACM
275 The Science of Programming (context) - Gries - 1981
259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967 ACM
223 Assigning meanings to programs (context) - Floyd - 1967
222 The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1982 ACM DBLP
203 An Introduction to Modal Logic (context) - Hughes, Cresswell - 1968
202 Modal and temporal logics (context) - Stirling - 1992 ACM
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979 DBLP
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
190 Results on the propositional -calculus (context) - Kozen - 1982
190 Results on the propositional -calculus (context) - Kozen - 1983
181 Mathematical Logic (context) - Shoenfield - 1967
177 Temporal logic can be more expressive (context) - Wolper - 1983 DBLP
177 Temporal logic can be more expressive (context) - Wolper - 1981 DBLP
174 Probabilistic simulations for probabilistic processes - Segala, Lynch - 1994 ACM DBLP
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
162 Automata-theoretic techniques for modal logics of programs (context) - Vardi, Wolper - 1986 ACM DBLP
143 Logics of programs (context) - Kozen, Tiuryn - 1990 ACM DBLP
140 Tense logics and the theory of linear order (context) - Kamp - 1968
133 Mathematical Theory of Computation (context) - Manna - 1974 ACM
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988 ACM DBLP
130 Efficient model checking in fragments of the propositional .. (context) - Emerson, Lei - 1986
128 Automatic verification of probabilistic concurrent finite-st.. (context) - Vardi - 1985 DBLP
126 Semantical considerations on Floyd-Hoare logic - Pratt - 1976 ACM DBLP
122 Temporal Logic: Mathematical Foundations and Computational A.. (context) - Gabbay, Hodkinson et al. - 1994
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
105 Word problems requiring exponential time (context) - Stockmeyer, Meyer - 1973
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
95 Verification of Sequential and Concurrent Programs (context) - Apt, Olderog - 1991 ACM
92 Riemann's hypothesis and tests for primality (context) - Miller - 1976
85 First-Order Dynamic Logic (context) - Harel - 1979
84 The Design and Analysis of Algorithms (context) - Kozen - 1991 ACM
84 A completeness theorem for Kleene algebras and the algebra o.. - Kozen - 1991 ACM DBLP
84 Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985 ACM DBLP
84 A completeness theorem for Kleene algebras and the algebra o.. - Kozen - 1994 ACM DBLP
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
78 Probabilistic algorithms for testing primality (context) - Rabin - 1980
75 Semantics of probabilistic programs (context) - Kozen - 1981 DBLP
68 Ten years of Hoare's logic: a survey---part (context) - Apt - 1981
64 A logic for reasoning about time and probability (context) - Hansson, Jonsson - 1994
61 Countable nondeterminism and random assignment (context) - Apt, Plotkin - 1986 ACM DBLP
59 Modalities for model checking: branching time strikes back (context) - Emerson, Lei - 1987 DBLP
59 Two complete axiom systems for the algebra of regular events (context) - Salomaa - 1966 ACM DBLP
59 Models of program logics (context) - Pratt - 1979 DBLP
57 Propositional dynamic logic of looping and converse (context) - Streett - 1981 ACM DBLP
57 Propositional dynamic logic of looping and converse is eleme.. (context) - Streett - 1982 DBLP
56 Reasoning about the past with two-way automata - Vardi - 1998 ACM DBLP
52 Specification and verification of concurrent programs by 8-a.. (context) - Manna, Pnueli - 1987
52 Center for the Study of Language and Information (context) - Goldblatt, time et al. - 1987
51 Soundness and completeness of an axiom system for program ve.. (context) - Cook - 1978 DBLP
49 Methods and logics for proving programs (context) - Cousot - 1990 ACM DBLP
45 Deciding full branching-time logic (context) - Emerson, Sistla - 1984
44 Quantitative analysis and model checking - Huth, Kwiatkowska - 1997 ACM DBLP
43 Verification of concurrent programs: temporal proof principl.. (context) - Manna, Pnueli - 1981 DBLP
40 Verifying temporal properties of finite-state probabilistic .. (context) - Courcoubetis, Yannakakis - 1988 DBLP
40 Improved upper and lower bounds for modal logics of programs.. (context) - Vardi, Stockmeyer - 1985 DBLP
40 congruences and complete axiomatizations for probabilistic p.. (context) - Jou, Smolka - 1990
39 Algebras of feasible functions (context) - Gurevich - 1983 DBLP
39 A probabilistic PDL (context) - Kozen - 1985 ACM DBLP
37 Action logic and pure induction - Pratt - 1990 ACM DBLP
36 Probabilistic predicate transformers - Morgan, McIver et al. - 1999 ACM DBLP
35 Process logic: Expressiveness (context) - Harel, Kozen et al. - 1982
34 is sometimes (context) - Lamport - 1980
34 Concurrent dynamic logic (context) - Peleg - 1987 ACM DBLP
33 Relation Algebras with Transitive Closure (context) - Ng - 1984
33 On defining relations for the algebra of regular events (context) - Redko - 1964
33 Mathematical Theory of Program Correctness (context) - de Bakker - 1980 ACM
33 Relation algebras with transitive closure (context) - Ng, Tarski - 1977
32 Algorithmics: The Spirit of Computing (context) - Harel - 1992 ACM
31 An elementary proof of the completeness of PDL (context) - Kozen, Parikh - 1981
29 Axiomatising the Logic of Computer Programming (context) - Goldblatt - 1982 ACM
28 A completeness theorem in the modal logic of programs (context) - Segerberg - 1977
28 A near-optimal method for reasoning about actions (context) - Pratt - 1980
27 Recurring dominoes: Making the highly undecidable highly und.. (context) - Harel - 1985 ACM
27 Automata and Computability (context) - Kozen - 1997 ACM
27 Efficient local model checking for fragments of the modal -.. - Bhat, Cleaveland - 1996
26 Weak alternating automata give a simple explanation of why m.. (context) - Muller, Saoudi et al. - 1988
25 and temporal logics (context) - Emerson, tableax - 1985
24 Program Construction and Verification (context) - Backhouse - 1986 ACM
23 Induction rules and termination proofs (context) - Hitchcock, Park - 1972 DBLP
22 Process logic (context) - Pratt - 1979 ACM DBLP
22 Model Theory for Infinitary Logic (context) - Keisler - 1971
22 Programming language constructs for which it is impossible t.. (context) - Clarke - 1979 ACM DBLP
21 Program proving as hand simulation with a little induction (context) - Burstall - 1974 DBLP
21 Dynamic algebras as a well-behaved fragment of relation alge.. - Pratt - 1988 ACM DBLP
21 and Languages: Fundamentals of Theoretical Computer Science (context) - Davis, Sigal et al. - 1994
21 Comparative schematology (context) - Paterson, Hewitt - 1970 ACM
21 Termination of probabilistic concurrent programs (context) - Hart, Sharir et al. - 1982 ACM DBLP
19 Polynomial computability and recursivity in finite domains (context) - Sazonov - 1980 DBLP
19 A practical decision method for propositional dynamic logic (context) - Pratt - 1978
18 Verification of Modal Properties Using Boolean Equation Syst.. (context) - Mader - 1997
18 Verification of concurrent programs: the automata-theoretic .. - Vardi - 1987 DBLP
17 The Kleene and Parikh theorem in complete semirings (context) - Kuich - 1987
16 Chapman and Hall (context) - Conway, Algebra et al. - 1971
16 and Jerzy Tiuryn (context) - Harel, Kozen - 2000
16 The propositional dynamic logic of deterministic (context) - Halpern, Reif - 1983
16 The propositional dynamic logic of deterministic (context) - Halpern, Reif - 1981
15 Propositional dynamic logics of programs: a survey (context) - Parikh - 1981 DBLP
14 Polish Scientific Publishers (context) - Rasiowa, Sikorski et al. - 1963
14 On Hoare logic and Kleene algebra with tests - Kozen - 1999 ACM DBLP
13 The taming of the converse: reasoning about two-way computat.. (context) - Vardi - 1985
13 On simultaneously determinizing and complementing (context) - Emerson, Jutla - 1989
13 On induction vs (context) - Kozen - 1981
13 A semiring on convex polygons and zero-sum cycle problems (context) - Iwano, Steiglitz - 1990 ACM DBLP
13 Theoretical Computer Science (context) - Krob, system et al. - 1991
13 the verification of qualitative properties of probabilistic .. - Baier, Kwiatkowska - 1998
12 Some relationships between logics of programs and complexity.. (context) - Tiuryn, Urzyczyn - 1983 ACM DBLP
12 the duality of dynamic algebras and Kripke models (context) - Kozen - 1979
12 calculus alternation hierarchy is strict (context) - Bradfield - 1996
12 Transactions on Programming Languages and Systems (context) - Kozen, with - 1997
12 On Kleene algebras and closed semirings - Kozen - 1990
12 Computer Science Department (context) - Kozen, algebra - 1998
12 Some relationships between logics of programs and complexity.. (context) - Tiuryn, Urzyczyn - 1988 ACM DBLP
12 Hypotheses in Kleene algebra - Cohen - 1994
12 Kleene algebra with tests: Completeness and decidability - Kozen, Smith - 1996 ACM DBLP
11 The completeness of propositional dynamic logic (context) - Parikh - 1978
11 Propositional dynamic logic of nonregular programs - Harel, Pnueli et al. - 1983 DBLP
11 Dynamic algebras and the nature of induction (context) - Pratt - 1980 ACM DBLP
11 Dynamic algebras: examples (context) - Pratt - 1979
11 The complexity of Kleene algebra with tests - Cohen, Kozen et al. - 1996 ACM
10 A finite model theorem for the propositional -calculus (context) - Kozen - 1988
10 Equational axioms for regular sets (context) - Bloom, Esik - 1993 DBLP
10 A representation theorem for models of *-free PDL (context) - Kozen - 1980 ACM DBLP
9 On formalized computer programs (context) - Luckham, Park et al. - 1970
9 Efficient model checking via the equational -calculus (context) - Cleaveland - 1996
9 A probabilistic dynamic logic (context) - Feldman, Harel - 1984 ACM DBLP
9 Full abstraction for a simple programming language (context) - Hennessy, Plotkin - 1979
9 Local model checking in the modal -calculus (context) - Stirling, Walker - 1989
9 Descriptively complete process logic (context) - Nishimura - 1980 DBLP
8 branching time: a complexity-theoretic perspective (context) - Vardi - 1998
8 Propositional modal logic of programs (context) - Fischer, Ladner - 1977 ACM
8 Propositional dynamic logic of flowcharts (context) - Harel, Sherman - 1985 ACM DBLP
8 Using Kleene algebra to reason about concurrency control (context) - Cohen - 1994
8 A theory of programs (context) - Scott, de Bakker - 1969
7 A decidability result for second order process logic (context) - Parikh - 1978
7 Kleene algebra with tests and commutativity conditions (context) - Kozen - 1996 ACM
6 A unified approach to path problems (context) - Tarjan - 1981
6 Communication in concurrent dynamic logic (context) - Peleg - 1987 ACM DBLP
6 Using graphs to understand PDL (context) - Pratt - 1981 ACM DBLP
6 Deciding properties of nonregular programs (context) - Harel, Raz - 1993 ACM DBLP
6 Deterministic propositional dynamic logic: finite models (context) - Ben-Ari, Halpern et al. - 1982
6 volume 36 of Lecture Notes in Computer Science (context) - Greibach, Program et al. - 1975
6 Deciding emptiness for stack automata on infinite trees - Harel, Raz - 1994 ACM DBLP
6 Duality and the completeness of the modal -calculus (context) - Ambler, Kwiatkowska et al. - 1995
6 A decidable propositional dynamic logic with explicit probab.. (context) - Feldman - 1984 ACM DBLP
6 A new incompleteness result for Hoare's system (context) - Wand - 1978 ACM DBLP
6 The Burnside Problem and Identities in Groups (context) - Adian - 1979
5 Formalizing the analysis of algorithms (context) - Ramshaw - 1981
5 PAL---propositional algorithmic logic (context) - Mirkowska - 1981
5 PAL---propositional algorithmic logic (context) - Mirkowska - 1981
5 Decidability and expressiveness of logics of processes (context) - Abrahamson - 1980 ACM
5 Reasoning with time and chance (context) - Lehmann, Shelah - 1982 DBLP
5 Formalized algorithmic languages (context) - Salwicki - 1970
5 Parikh's theorem in commutative Kleene algebra - Hopkins, Kozen - 1999 ACM DBLP
4 A new finite complete solvable quasiequational calculus for .. (context) - Archangelsky - 1992
4 Axiomatizations of logics of programs (context) - Gabbay - 1977
4 The deducibility problem in propositional dynamic logic (context) - Meyer, Streett et al. - 1981 ACM DBLP
4 the theory of programming logics (context) - Constable - 1977
4 Propositional game logic (context) - Parikh - 1983 DBLP
4 The logical schemes of algorithms (context) - Ianov - 1960
4 A survey of the logic of effective definitions (context) - Tiuryn - 1981 ACM DBLP
4 Using Automata to Characterise Fixed Point Temporal Logics - Kaivola - 1997
4 Unbounded program memory adds to the expressive power of fir.. (context) - Tiuryn - 1981
4 A completeness technique for D-axiomatizable semantics (context) - Berman - 1979 ACM DBLP
4 the expressive power of programming logics (context) - Erimbetov - 1981
4 Algorithmic properties of structures (context) - Engeler - 1967 ACM DBLP
4 Definability by programs in first-order structures (context) - Kfoury - 1983 DBLP
4 Re-interpreting the modal -calculus (context) - Bonsangue, Kwiatkowska - 1995
4 the complexity of reasoning in Kleene algebra - Kozen - 1997
4 Springer-Verlag (context) - Kuich, Salomaa et al. - 1986
4 Kleene's theorem revisited: A formal path from Kleene to Cho.. (context) - Sakarovitch - 1987
4 Unbounded program memory adds to the expressive power of fir.. (context) - Tiuryn - 1984
3 Une remarque sur les systemes complets d'identites rationnel.. (context) - Boffa - 1990
3 A Programming Logic (context) - Constable, O'Donnell - 1978
3 Sequential method in propositional dynamic logic (context) - Nishimura - 1979 DBLP
3 A decision procedure for the propositional -calculus (context) - Kozen, Parikh - 1983
3 Deterministic process logic is elementary (context) - Halpern - 1982 ACM DBLP
3 Fixpoints and program looping: reductions from the propositi.. (context) - Streett - 1985
3 Deterministic process logic is elementary (context) - Halpern - 1983 ACM DBLP
3 A necessary and sufficient condition for the existence of Ho.. (context) - Lipton - 1977 DBLP
3 the complementation of Buchi automata (context) - Pecuchet - 1986
3 the representation of dynamic algebras (context) - Kozen - 1979
3 the representation of dynamic algebras II (context) - Kozen - 1980
3 A programming language for the inductive sets (context) - Harel, Kozen - 1984
3 Nondeterminism in logics of programs (context) - Harel, Pratt - 1978 ACM DBLP
3 and Larry Stockmeyer (context) - Chandra, Kozen - 1981
3 On action algebras - Kozen - 1994
3 repeating in dynamic logic (context) - Harel, Sherman - 1982
3 Definability in dynamic logic (context) - Meyer, Parikh - 1981 ACM DBLP
3 Iterated pushdown automata and complexity classes (context) - Engelfriet - 1983 ACM DBLP
3 Program correctness and matricial iteration theories (context) - Bloom, Esik - 1992 ACM DBLP
3 Computability and completeness in logics of programs (context) - Harel, Meyer et al. - 1977
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.wisdom.weizmann.ac.il/~dharel/papers/): More
A Multi-Scale Algorithm for the Linear Arrangement Problem - Koren, Harel (2002) (Correct)
Rhapsody: A Complete Lifecycle Model-Based Development System - Gery, Harel, Palatshy (Correct)
Drawing Graphs with Non-Uniform Vertices - Harel, Koren (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC