D. Kozen andJ. Tiuryn. Handbook of Theoretical Computer Science, pages790--840. Elsevier Science Publishers (NorthHolland) Amsterdam,1990. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
The Logic In Computer Science Collumn - Yuri Gurevich How (Correct)
On Expressive and Model Checking Power of Propositional Program .. - Shilov, Yi (2001) (1 citation) (Correct)
Program Logics Made Easy - Yi, Shilov (Correct)
Program Logics: theory and applications - Shilov (Correct)
On Expressive Power of Second Order Propositional Program.. - Shilov, Yi (Correct)
A New Decidability Proof for Full Branching Time Logic CPL - Shilov (Correct)
Explicit Provability and Constructive Semantics - Artemov (2000) (1 citation) (Correct)
Branching vs. Linear Time: Final Showdown - Vardi (2001) (1 citation) (Correct)
Engaging Students with Theory through ACM Collegiate.. - Shilov, Yi (2000) (Correct)
Linear vs. Branching Time: A Complexity-Theoretic Perspective - Vardi (1998) (2 citations) (Correct)
The Mincer Metaphor: A New View on Problem-Solving.. - Fensel, Straatman.. (1995) (2 citations) (Correct)
Moving a Robot: - The Krr Approachatwork (Correct)
Explicit Provability And Constructive Semantics - Artemov (2001) (1 citation) (Correct)
Unknown - Comprehensive Survey Of (Correct)
A Note On The Completeness Of Kozen's Axiomatisation Of The.. - Walukiewicz (1996) (3 citations) Self-citation (Kozen) (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