The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Logic in computer science: modelling and reasoning about systems
Abstract
From the Publisher: Provides a simple and clear presentation, covering propositional and predicate logic and some specialized logics used for reasoning about the correctness of computer systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
(1994) · Mathematical Social Sciences · doi:10.1016/0165-4896(94)90005-1 · Cited by 3,517
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
Symbolic Boolean manipulation with ordered binary-decision diagrams
Bryant, R. E. (1992) · ACM Computing Surveys · doi:10.1145/136035.136043 · Cited by 2,015
Design and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
Results on the propositional μ-calculus
Kozen, D. C. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(82)90125-6 · Cited by 1,881
Akers (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675141 · Cited by 1,828
Chellas, B. F. (1980) · Cited by 1,806
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Specification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
Model checking and abstraction
Clarke, E. M., Grumberg, O., & Long, D. E. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186051 · Cited by 1,211
(1965) · Medical Entomology and Zoology · Cited by 1,141
First-Order Logic and Automated Theorem Proving
Fitting, M. (1996) · Springer eBooks · doi:10.1007/978-1-4612-2360-3 · Cited by 950
Temporal Verification of Reactive Systems: Safety
Manna, Z., & Pnueli, A. (1995) · Medical Entomology and Zoology · Cited by 947
Investigations into Logical Deduction
Gentzen, G. (1964) · American Philosophical Quarterly · Cited by 659
Paulson, L. C. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811326 · Cited by 593
Logics of Time and Computation
Goldblatt, R. (1987) · Cited by 587
Automata-theoretic techniques for modal logics of programs
Vardi, M. Y., & Wolper, P. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90026-7 · Cited by 522
The proof theory and semantics of intuitionistic modal logic
Simpson, A. K. (1994) · Cited by 353
Gallier, J. H. (1985) · Cited by 217
Hodges, W. (1983) · Springer eBooks · doi:10.1007/978-94-009-7066-3_1 · Cited by 152
A modal analysis of staged computation
Davies, R., & Pfenning, F. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237788 · Cited by 143
A note on a standard strategy for developing loop invariants and loops
Gries, D. J. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(83)90015-1 · Cited by 68
Cited by
Introduction to Software Testing
(2021) · Essentials of Software Testing · doi:10.1017/9781108974073.004 · Cited by 1,056
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
Towards Reasoning in Large Language Models: A Survey
Huang, J., & Chang, K. C.-C. (2023) · Findings of the Association for Computational Linguistics: ACL 2023 · doi:10.18653/v1/2023.findings-acl.67 · Cited by 428
Enabling Flexibility in Process-Aware Information Systems
Reichert, M., & Weber, B. (2012) · Springer eBooks · doi:10.1007/978-3-642-30409-5 · Cited by 414
Receding Horizon Temporal Logic Planning
Wongpiromsarn, T., Topcu, U., & Murray, R. M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2195811 · Cited by 292
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2005-03-01
- Volume
- 42
- Issue
- 07
- Pages
- 42-4069-42-4069
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W1679534293
- Cited by
- 857
- References
- 24
- Type
- book review
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.