N.V. Shilov  Home/Search
Context
Related
| pllab.kaist.ac.kr/...Shilov00ictl.ps.gz 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: pllab.kaist.ac.kr/~kwang...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A so-called Program Scheme Technique (PST) is a self-contained, automata free technique for proving elementary decidability of program and polymodal propositional logics. A particular advantage of PST is its expressive power which is equal to the expressive power of Second Order Theory of Monadic Successors in Herbrand Models. This time it leads to decidability of CTL with double exponential upper time bound. Key words: full branching time logic, second order propositional dynamic ... (Update)
Active bibliography (related documents): More All
2.1: A New Proof of Exponential Decidability for the Propositional.. - Yi, Shilov (2000) (Correct)
0.7: A Note on Model Checking Reuse - Shilov, Yi (Correct)
0.5: Games with Second-Order Quantifiers which Decide Propositional.. - Shilov (2001) (Correct)
Similar documents based on text: More All
1.0: On Expressive and Model Checking Power of Propositional Program.. - Shilov (2001) (Correct)
0.9: On Expressive and Model Checking Power of Propositional Program .. - Shilov, Yi (2001) (Correct)
0.8: Program Logics Made Easy - Yi, Shilov (Correct)
BibTeX entry: (Update)
@misc{ shilov-new,
author = "N.V. Shilov",
title = "A New Decidability Proof for Full Branching Time Logic CPL",
url = "citeseer.ist.psu.edu/448209.html" }
Citations (may not include all citations):1180 The temporal logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1991
828 Model Checking - Clarke, Grumberg et al. - 1999
397 Design and Synthesis of synchronization skeletons using Bran.. (context) - Clarke, Emerson - 1982
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
222 The Complexity of Propositional Linear Temporal Logic (context) - Sistla, Clarke - 1985
206 Results on the Propositional Mu-Calculus (context) - Kozen - 1983
191 Temporal verification of reactive systems: safety (context) - Manna, Pnueli - 1995
131 The Complexity of Tree Automata and Logics of Programs (context) - Emerson, Jutla - 1999
120 Handbook of Theoretical Computer Science (context) - Temporal, Logic - 1990
59 Modalities for Model Checking: branching time strikes back (context) - Emerson, Lei - 1987
56 Reasoning about the past with two-way automata - Vardi - 1998
47 Theoretical Computer Science (context) - Logic, Programs - 1981
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985
35 Process Logic: Expressiveness (context) - Harel, Kozen et al. - 1982
31 Lecture Notes in Computer Science (context) - Dynamic - 1979
28 Propositional dynamic logic of regular programs (context) - Ladner - 1979
25 Deciding branching time logic (context) - Emerson, Sistla - 1984
20 Theory of Program Structures: Schemes (context) - Greibach - 1975
15 Handbook of Theoretical Computer Science (context) - Kozen, Tiuryn - 1990
12 Handbook of Logic in Computer Science (context) - Modal, Logics - 1992
8 Propositional Dynamic Logic of Flowcharts (context) - Harel, Sherman - 1985
7 automata for decidability of program logics (context) - schemata - 1997
7 Is the Interesting Part of Process Logic Uninteresting (context) - Sherman, Pnueli et al. - 1984
6 On expressive power of Modal Logic on Trees - Schlingloff - 1992
4 Non-deterministic Program Schemata and there relation to Dyn.. (context) - Shilov - 1988
4 Non-deterministic Program Schemata and there relation to Dyn.. (context) - Shilov - 1986
3 CTL and ECTL as fragments of the modal Mu-Calculus (context) - Dam - 1994
3 Propositional Dynamic Logic with Fixed Points: algorithmical.. (context) - Shilov - 1992
2 Program Schemata Technique for decidability of Propositional.. (context) - Shilov - 1988
1 Theory of Program Schemata (context) - Kotov, Sabelfeld - 1990
1 revised: On branching versus linear time temporal logic (context) - Emerson, Halpern - 1986
1 Program Schemata Technique Revised (context) - Shilov
Documents on the same site (http://pllab.kaist.ac.kr/~kwang/papers.html): More
Z1: A Data Flow Analyzer Generator - Yi, Harrison (Correct)
Automatic Generation and Management of Interprocedural.. - Yi, Harrison, III (1993) (Correct)
Compile-time Detection of Uncaught Exceptions in Standard ML Programs - Yi (1994) (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