The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
On visual formalisms
Open accessAbstract
The higraph, a general kind of diagramming object, forms a visual formalism of topological nature. Higraphs are suited for a wide array of applications to databases, knowledge representation, and, most notably, the behavioral specification of complex concurrent systems using the higraph-based language of statecharts.
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
Harary, F. (1969) · Cited by 10,739
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
Self-citationThe Entity Relationship Model — Toward a Unified View of Data
Chen, P. P.-S. (2002) · Software Pioneers · doi:10.1007/978-3-642-59412-0_18 · Cited by 5,751
The visual display of quantitative information
(1985) · General Pharmacology: The Vascular System · doi:10.1016/0306-3623(85)90230-7 · Cited by 5,070
The entity-relationship model—toward a unified view of data
Chen, P. P.-S. (1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320440 · Cited by 4,708
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Hypertext: An Introduction and Survey
Conklin (1987) · Computer · doi:10.1109/mc.1987.1663693 · Cited by 2,718
Introduction to artificial intelligence
(2011) · Choice Reviews Online · doi:10.5860/choice.49-0903 · Cited by 1,085
The visual display of quantitative information
Azen, S. P. (1983) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(83)90110-x · Cited by 876
On the Development of Reactive Systems
Harel, D., & Pnueli, A. (1985) · Logics and Models of Concurrent Systems · doi:10.1007/978-3-642-82453-1_17 · Cited by 859
Self-citationWoods, W. A. (1975) · Representation and Understanding · doi:10.1016/b978-0-12-108550-6.50007-0 · Cited by 792
The Visual Display of Quantitative Information
Reidhaar, J. W., & Tufte, E. R. (1986) · Design Issues · doi:10.2307/1571646 · Cited by 781
Introduction to artificial intelligence
CHEESEMAN, P., & GEVARTER, W. (1986) · 24th Aerospace Sciences Meeting · doi:10.2514/6.1986-163 · Cited by 750
Brachman, R. J. (1979) · Associative Networks · doi:10.1016/b978-0-12-256380-5.50007-4 · Cited by 625
The mathematics of inheritance systems
Touretzky, D. S. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 590
Proving Liveness Properties of Concurrent Programs
Owicki, S., & Lamport, L. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357178 · Cited by 576
Pnueli, A. (1986) · Lecture Notes in Computer Science · doi:10.1007/bfb0027047 · Cited by 450
Associative Networks: The Representation and Use of Knowledge by Computers
Findler, N. V. (1979) · OLAC - Open Language Archives Community · Cited by 442
A semantics of multiple inheritance
Cardelli, L. (1984) · Lecture notes in computer science · doi:10.1007/3-540-13346-1_2 · Cited by 359
A simplied universal relation assumption and its properties
Fagin, R., Mendelzon, A. O., & Ullman, J. D. (1982) · ACM Transactions on Database Systems · doi:10.1145/319732.319735 · Cited by 296
What's in a Link: Foundations for Semantic Networks
Woods, W. A. (1975) · doi:10.21236/ada022584 · Cited by 245
Lefschetz, S. (1949) · Princeton University Press eBooks · doi:10.1515/9781400879946 · Cited by 237
Statistical Graphics: Design Principles and Practices
Wright, J., & Schmid, C. F. (1984) · Geographical Journal · doi:10.2307/635030 · Cited by 116
When do diagrams make good computer languages?
FITTER, M. J., & Green, T. R. G. (1979) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(79)80019-x · Cited by 91
Nonanalytic Aspects of Mathematics and Their Implication for Research and Education
Davis, P. J., & Anderson, J. A. (1979) · SIAM Review · doi:10.1137/1021008 · Cited by 24
Cited by
Moody, D. (2009) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2009.67 · Cited by 1,204
Alloy: a lightweight object modelling notation
Jackson, D. (2002) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/505145.505149 · Cited by 1,181
(2006) · Technical Report Series 936 · doi:10.2471/trs.02.935 · Cited by 1,096
Algorithms for drawing graphs: an annotated bibliography
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1994) · Computational Geometry · doi:10.1016/0925-7721(94)00014-x · Cited by 854
A specifier's introduction to formal methods
Wing, J. M. (1990) · Computer · doi:10.1109/2.58215 · Cited by 736
Metadata
- Authors
- Harel, D.
- Venue
- Communications of the ACM
- Published
- 1988-05
- Volume
- 31
- Issue
- 5
- Pages
- 514-530
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2064650227
- Cited by
- 1,269
- References
- 29
- FWCI
- 51.29
- Type
- journal article
- Language
- en
- Open access
- bronze
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.