David Harel

• D. Harel and R. Sherman. Looping vs. repeating in dynamic logic. Information and Control, 55(1-3):175-192, October/November/December 1982. Abstract, References, and Citations.

• D. Harel and D. Peleg. On static logics, dynamic logics, and complexity classes. Information and Control, 60(1-3):86-102, January/February/March 1984. Abstract and Citations.

• David Harel and Dexter Kozen. A programming language for the inductive sets, and applications. Information and Control, 63(1/2):118-139, October/November 1984. Abstract and Citations.

• D. Harel and R. Sherman. Propositional dynamic logic of flowcharts. Information and Control, 64(1-3):119-135, January/February/March 1985. Abstract and Citations.

• David Harel and Danny Raz. Deciding emptiness for stack automata on infinite trees. Information and Computation, 113(2):278-299, September 1994. Abstract and References.

• David Harel and Eli Singerman. More on nonregular PDL: Finite models and Fibonacci-like programs. Information and Computation, 128(2):109-118, 1 August 1996. Abstract and References.

Shortcuts: