N. V. Shilov, K. Yi  Home/Search
Context Related
| ropas.kaist.ac.kr/~shilov/psi.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: ropas.kaist.ac.kr/~shilov/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We examine when a model checker for a propositional program logic can be used for checking another propositional program logic in spite of lack of expressive power of the first logic. We prove that (1) a branching time Computation Tree Logic CTL, (2) the propositional -Calculus of D. Kozen C , and (3) the second-order propositional program logic 2M of C. Stirling enjoy the equal model checking power in spite of difference in their expressive powers CTL ! C ! 2M: every listed logic has a... (Update)
Cited by: More
Liveness Checking as Safety Checking for Infinite State Spaces - Schuppan, Biere (2005) (Correct)
Similar documents (at the sentence level):
7.3%: A Note on Model Checking Reuse - Shilov, Yi (Correct)
Active bibliography (related documents): More All
0.5: Games with Second-Order Quantifiers which Decide Propositional.. - Shilov (2001) (Correct)
0.4: Program Logics: theory and applications - Shilov (Correct)
0.4: Program Logics Made Easy - Yi, Shilov (Correct)
Similar documents based on text: More All
1.9: On Expressive Power of Second Order Propositional Program.. - Shilov, Yi (Correct)
1.9: On Expressive and Model Checking Power of Propositional Program.. - Shilov (2001) (Correct)
0.9: A New Decidability Proof for Full Branching Time Logic CPL - Shilov (Correct)
BibTeX entry: (Update)
Shilov, N. and K. Yi, On expressive and model checking power of propositional program logics, in: D. Bjrner, M. Broy and A. Zamulin, editors, PSI'01, LNCS 2244 (2001), pp. 39--46. http://citeseer.ist.psu.edu/article/shilov01expressive.html More
@article{ shilov01expressive,
author = "Nikolai V. Shilov and Kwang Yi",
title = "On Expressive and Model Checking Power of Propositional Program Logics",
journal = "Lecture Notes in Computer Science",
volume = "2244",
pages = "39--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/shilov01expressive.html" }
Citations (may not include all citations):828 Model Checking - Clarke, Grumberg et al. - 1999 ACM DBLP
779 Symbolic Model Checking: 10 20 states and beyond - Burch, Clarke et al. - 1992
604 Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
206 Results on the Propositional Mu-Calculus (context) - Kozen - 1983
120 Handbook of Theoretical Computer Science (context) - Temporal, Logic - 1990 ACM
70 The Classical Decision Problem (context) - Borger, Gradel et al. - 1997
51 Decidable Theories (context) - Rabin - 1977
19 Practical Model Checking Using Games - Steven, Stirling - 1998
16 Lecture Notes in Computer Science (context) - Model, Games - 1995
16 Lecture Notes in Computer Science (context) - Games, Mu-Calculus - 1996
15 Handbook of Theoretical Computer Science (context) - Kozen, Tiuryn - 1990
12 Handbook of Logic in Computer Science (context) - Modal, Logics - 1992 ACM
10 Descriptive Complexity: a Logician's Approach to Computation - Immerman
8 Faster Model-Checking for Mu-Calculus (context) - Cleaveland, Klain et al. - 1993
6 On expressive power of Modal Logic on Trees - Schlingloff - 1992
5 Handbook of Philosophical Logic (context) - Bull, Segerberg
http://www.elsevier.nl/gej-ng/31/29/23/show/Products/notes/
Documents on the same site (http://ropas.kaist.ac.kr/~shilov/): More
Program Logics: theory and applications - Shilov (Correct)
Engaging Students with Theory through ACM Collegiate.. - Shilov, Yi (2000) (Correct)
Program Logics Made Easy - Yi, Shilov (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