Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu  Home/Search
Context Related
| rice.edu/~vardi/pape...aaas99.jsl.ps.gz cmu.edu/~rwh/papers/unreasona...basl.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: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Syntax of MinML ` x : (x) ` n : int ` e 1 : int ` e 2 : int ` e 1 e 2 : int ` true : bool ` false : bool ` e 1 : int ` e 2 : int ` e 1 =e 2 : bool ` e : bool ` e 1 : ` e 2 : ` if e then e 1 else e 2 : ; f : 1 ! 2 ; x: 1 ` e : 2 ` fun f(x: 1 ): 2 is e : 1 ! 2 ` e 1 : 2 ! ` e 2 : 2 ` e 1 (e 2 ) : Figure 2: Type System of MinML restrictions on the formation of programs to ensure that a large class of errors, those that arise from misinterpretation of values,... (Update)
Cited by: More
CTL Model Checking for Processing Simple XPath Queries - Afanasiev, Franceschet.. (2004) (Correct)
Similar documents (at the sentence level): More
9.7%: Automated Verification: Graphs, Logic, and Automata - Moshe Vardi Rice (Correct)
6.7%: Reasoning About Knowledge: A Survey - Halpern (1995) (Correct)
6.7%: Branching vs. Linear Time: Final Showdown - Vardi (2001) (Correct)
Active bibliography (related documents): More All
1.9: On the Unusual Effectiveness of Logic in Computer Science - Halpern, Harper.. (2001) (Correct)
0.5: A Characterization of First-Order Definable Subsets on.. - Kfoury, Wymann-Böni (1993) (Correct)
0.4: Pattern Transfer: bridging the gap between theory and practice - Benton (Correct)
Similar documents based on text: More All
0.5: Infinitary Logic and Inductive Definability over Finite.. - Dawar, Lindell (1995) (Correct)
0.3: First Order Logic, Fixed Point Logic and Linear Order - Dawar, Lindell, al. (1995) (Correct)
0.3: Fixpoint Logics, Relational Machines, and Computational.. - Abiteboul, Vardi, Vianu (1997) (Correct)
BibTeX entry: (Update)
J. Y. Halpern, R. Harper, N. Immerman, P. G. Kolaitis, M. Vardi, and V. Vianu. On the unusual effectiveness of logic in computer science. The Bulletin of Symbolic Logic, 7(2):213--236, 2001. http://citeseer.ist.psu.edu/article/halpern00unusual.html More
@article{ halpern01unusual,
author = "Joseph Y. Halpern and Robert Harper and Neil Immerman and Phokion G. Kolaitis and Moshe Y. Vardi and Victor Vianu",
title = "On the unusual effectiveness of logic in computer science",
journal = "The Bulletin of Symbolic Logic",
volume = "7",
number = "2",
pages = "213--236",
year = "2001",
url = "citeseer.ist.psu.edu/article/halpern00unusual.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPcom.. (context) - Garey, Johnson - 1979
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
981 Principles of Database and Knowledge Base Systems (context) - Ullman - 1988
906 A structural approach to operational semantics - Plotkin - 1981
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1992
775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
604 Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
379 The complexity of relational query languages (context) - Vardi - 1982
345 Notes on database operating systems (context) - Gray - 1978
294 Finite Model Theory (context) - Ebbinghaus, Flum - 1995
283 A relational model of data for large shared data banks (context) - Codd - 1970
267 Computer Aided Verification of Coordinating Processes (context) - Kurshan - 1994
263 Database System Concepts (context) - Silberschatz, Korth et al. - 1997
245 Relational queries computable in polynomial time - Immerman - 1986
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
229 Foundations for Programming Languages (context) - Mitchell - 1996
221 Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981
210 Generalized first--order spectra and polynomial--time recogn.. (context) - Fagin - 1974
210 TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1996
200 The Theory of Relational Databases (context) - Maier - 1983
194 Knowledge and Belief (context) - Hintikka - 1962
170 Nondeterministic space is closed under complement - Immerman - 1988
139 Reasoning about infinite computations - Vardi, Wolper - 1994
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996
115 An application of games to the completeness problem for form.. (context) - Ehrenfeucht - 1961
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
110 Descriptive Complexity (context) - Immerman - 1999
95 On computable numbers with an application to the Entscheidun.. (context) - Turing - 1936
88 Elements of relational database theory (context) - Kanellakis - 1991
85 Special issue on Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
85 Upper and lower bounds for first-order expressibility (context) - Immerman - 1982
68 Uber formal unentscheidbare Satze der Principia Mathematica .. (context) - Godel - 1931
47 volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
38 Languages which capture complexity classes (context) - Immerman - 1987
36 Number of quantifiers is better than number of tape cells (context) - Immerman - 1981
28 A note on the Entscheidungsproblem (context) - Church - 1936
26 Formal verification in a commercial setting - Kurshan - 1997
26 The Logical Basis for Computer Programming (context) - Manna, Waldinger - 1985
23 Der Wahrheitsbegriff in den formalisierten Sprachen (context) - Tarski - 1935
17 volume 141 of Studies in Logic and the Foundations of Mathem.. (context) - Jacobs, Type - 1999
11 The unreasonable effectiveness of mathematics in the natural.. (context) - Wigner - 1960
10 Descriptive complexity: a logician's a approach to computati.. - Immerman - 1995
5 Model checking expands verification's scope (context) - Goering - 1997
4 Databases and finite-model theory - Vianu - 1997
3 Checking the finite-state concurrent programs satisfy their .. (context) - Lichtenstein, Pnueli - 1985
3 The unreasonable effectiveness of mathematics (context) - Hamming - 1980
2 Influences of mathematical logic on computer science (context) - Davis - 1988
2 Sur quelques classifications des systemes de relations (context) - isse - 1954
1 Teories of Programming Languages (context) - Reynolds - 1998
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (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