N.V. Shilov, K. Yi  Home/Search
Context
Related
| pllab.kaist.ac.kr/...hilovYi01psi.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: We examine expressive power of second order propositional program logics: logic 2M of C. Stirling and a new Second Order Elementary Propositional Dynamic Logic (SOEPDL). We demonstrate that SOEPDL is more expressive than 2M , and them both are more expressive than the propositional -Calculus of D. Kozen (C). We give also an "external" characteristic of SOEPDL expressive power: SOEPDL is as expressive as Second order Logic of monadic Successors of M. Rabin (S(n)S-Logic) in spite of... (Update)
Active bibliography (related documents): More All
0.4: Games with Second-Order Quantifiers which Decide Propositional.. - Shilov (2001) (Correct)
0.4: A Note on Model Checking Reuse - Shilov, Yi (Correct)
0.4: On Expressive and Model Checking Power of Propositional Program .. - Shilov, Yi (2001) (Correct)
Similar documents based on text: More All
2.2: On Expressive and Model Checking Power of Propositional Program.. - Shilov (2001) (Correct)
0.7: Program Logics Made Easy - Yi, Shilov (Correct)
0.4: Model Checking Puzzles in µ-Calculus - Shilov, Yi (Correct)
BibTeX entry: (Update)
@misc{ shilov-expressive,
author = "N.V. Shilov and K. Yi",
title = "On Expressive Power of Second Order Propositional Program Logics (Extended
Abstract)",
url = "citeseer.ist.psu.edu/452345.html" }
Citations (may not include all citations):828 Model Checking - Clarke, Grumberg et al. - 1999
779 Symbolic Model Checking: 10 20 states and beyond - Burch, Clarke et al. - 1992
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
206 Results on the Propositional Mu-Calculus (context) - Kozen - 1983
131 The Complexity of Tree Automata and Logics of Programs (context) - Emerson, Jutla - 1999
120 Handbook of Theoretical Computer Science (context) - Temporal, Logic - 1990
81 The Complementation Problem for Buchi Automata with Applicat.. (context) - Sistla, Vardi et al. - 1987
70 The Classical Decision Problem (context) - Borger, Gradel et al. - 1997
51 Decidable Theories (context) - Rabin - 1977
16 Lecture Notes in Computer Science (context) - Games, Mu-Calculus - 1996
15 Handbook of Theoretical Computer Science (context) - Kozen, Tiuryn - 1990
7 automata for decidability of program logics (context) - schemata - 1997
6 On expressive power of Modal Logic on Trees - Schlingloff - 1992
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