Yuri Gurevich How to nd a coin: propositional program logics made easy N.V....  Home/Search
Context
Related
| ropas.kaist.ac.kr/~k...01eatcsshyi.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/~kwang...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: model Abstraction can overcome the de cit of the power of modern computers and solve the metaprogram problem: let's consider amounts of coins instead of coin numbers. This idea is natural: when somebody is solving puzzles he/she operates in terms of amounts of coins of di erent kinds not in terms of their numbers! Let us present this hint in formal terms as an abstract model game(N,M) (N 1, M 0). Positions in this parameterized game are tuples (u; l; h; v; q) where u is the amount of... (Update)
Similar documents (at the sentence level):
16.2%: Program Logics: theory and applications - Shilov (Correct)
10.5%: Program Logics Made Easy - Yi, Shilov (Correct)
Active bibliography (related documents): More All
0.5: S5 is a Paraconsistent Logic and so is Classical First-Order Logic - Beziau (2000) (Correct)
0.3: A Note on Model Checking Reuse - Shilov, Yi (Correct)
0.2: Games with Second-Order Quantifiers which Decide Propositional.. - Shilov (2001) (Correct)
Similar documents based on text: More All
0.3: Puzzles for Learning Model Checking, Model Checking for.. - Shilov, Yi (Correct)
0.3: On Expressive Power of Second Order Propositional Program.. - Shilov, Yi (Correct)
0.2: Model Checking Puzzles in µ-Calculus - Shilov, Yi (Correct)
BibTeX entry: (Update)
@misc{ how-logic,
author = "Yuri Gurevich How",
title = "The Logic In Computer Science Collumn",
url = "citeseer.ist.psu.edu/607475.html" }
Citations (may not include all citations):1180 The temporal logic of Reactive and Concurrent Systems (context) - Manna, Pnueli
828 Model Checking - Clarke, Grumberg et al. - 1999
779 Symbolic Model Checking: 10 states and beyond - Burch, Clarke et al. - 1992
604 Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
397 Design and Synthesis of synchronization skeletons using Bran.. (context) - Clarke, Emerson - 1982
392 A Computational Logic (context) - Boyer, Moor - 1979
362 Dynamic Logic - Harel, Kozen et al. - 2000
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
31 Lecture Notes in Computer Science (context) - Dynamic - 1979
28 Propositional dynamic logic of regular programs (context) - Ladner - 1979
21 On model-checking for fragments of Mu-Calculus (context) - Emerson, Jutla et al. - 1993
15 Handbook of Theoretical Computer Science (context) - Kozen, Tiuryn - 1990
13 Handbook of Philosophical Logic (context) - Logic
8 Faster Model-Checking for Mu-Calculus (context) - Cleaveland, Klain et al. - 1993
2 Handbook of Philosophical Logic (context) - Bull, Segerberg
1 ective model-checking of realtime nite-state machines in Mu-.. (context) - Berezine, Shilov et al. - 1994
http://www.csl.sri.com/sri-csl-fm.html
Documents on the same site (http://ropas.kaist.ac.kr/~kwang/papers.html): More
SUIF Program Analysis Using System Z2 - Kim, Yi, Eo, Choe (Correct)
Efficient Computation of Fixpoints that Arise in.. - Chen.. (Correct)
Assessing the Overhead of ML Exceptions by Selective CPS.. - Kim, Yi, Danvy (1998) (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