On visual formalisms

Communications of the ACM

Volumn 31, Issue 5, 1988, Pages 514-530

  Harel, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED; DATABASE SYSTEMS;

CONCURRENT SYSTEMS; HIGRAPHS; KNOWLEDGE REPRESENTATION; STATECHARTS;

MATHEMATICAL TECHNIQUES;

EID: 0024016415     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/42411.42414     Document Type: Article

References (51)

1. Berge, C. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.
2. Berry, G., and Cosserat, I. The ESTEREL synchronous programming language and its mathematical semantics. In Seminar on Concurrency, S. Brookes and G. Winskel, Eds. Lecture Notes in Computer Science, vol. 197. Springer-Verlag, New York, 1985. pp. 389–448.
3. Biggs, N.L., Lloyd, E.K., and Wilson, R.J. Graph Theory: 1736-1936. Clarendon Press, Oxford, 1976.
4. Brachman, R.J. On the epistemological status of semantic networks. In Associative Networks: Representation and Use of Knowledge by Computer, N.V. Findler, Ed. Academic Press, New York, 1979, pp. 3–50.
5. Cardelli, L.A. Semantics of multiple inheritance in semantics of data types. Kahn, G. el al. Lecture Notes in Computer Science, vol. 173, Springer-Verlag, 1984, pp. 51–67.
6. Charniak, E., and McDermott, D. Introduction to Artificial Intelligence. Addison-Wesley, Reading, Mass., 1985.
7. Chen, P.P.-S. The entity-relationship model—toward a unified view of data. ACM Trans. Database Syst. I, 1 (Mar. 1976). 9–36.
8. Conklin, J. Hypertext: An introduction and survey. IEEE Computer 20, 9 (Sept. 1987), 17–41.
9. Davis, P.J., Anderson, J.A. Nonanalytic aspects on mathematics and their implication on research and education. SIAM Review 21, 1 (Jan. 1979), 112–127.
10. dos Santos, C.S., Neuhold, E.J., and Furtado, A.L. A data type approach to the entity-relationship model. In Entity-Relationship Approach to Systems Analysis and Design, P.P. Chen, Ed. North-Holland, Amsterdam, 1980, pp. 103–119.
11. Dugundji, J. Topology. Allyn and Bacon, Boston, Mass., 1966.
12. Euler, L. Solutio problematis ad geometriam situs pertinentis. Comm. Acad. Sci. Imp. Petropol. 8 (1736), 128–140.
13. Euler, L. Lettres à une Princesse d'Allemagne. Vol. 2. 1772 (letters 102–108).
14. Fagin, R. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 3 (July 1983), 514–550.
15. Fagin, R., Mendelzon, A., and Ullman, J. A simplified universal relation assumption and its properties. ACM Trans. Database Syst. 7, 3 (Sept. 1982), 343–360.
16. al-Fedaghi, S.S. An entity-relationship approach to modelling petroleum engineering database. In Entity-Relationship Approach to Software Engineering, C.G. Davis et al., Eds. Elsevier Science Publishers, Amsterdam, 1983, pp. 761–779.
17. Findler, N.V., Ed. Associative Networks: Representation and Use of Knowledge by Computer. Academic Press, New York, 1979.
18. Fitter, M., and Green, T.R.G. When do diagrams make good computer languages? Int. J. Man-Mach. Stud. 11,2 (March 1979), 235–261.
19. Gardner, M. Logic Machines and Diagrams. 2nd ed. University of Chicago Press, Chicago, Ill., 1982.
20. Green, T.R. Pictures of programs and other processes, or how to do things with lines. Behav. Inf. Technol. 1, 1 (1982), 3–36.
21. Harel, D. Statecharts: A visual formalism for complex systems. Sci Comput. Program. 8, 3 (June 1987), 231–274.
22. Harel, D., and Pnueli, A. On the development of reactive systems. In Logics and Models of Concurrent Systems, NATO, ASI Series, vol. 13, K.R. Apt, Ed. Springer-Verlag, New York, 1985, pp. 477–498.
23. Harel, D., Pnueli, A., Schmidt, J.P., and Sherman, R. On the formal semantics of Statecharts. In Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (Ithaca, N.Y., June 22-24). IEEE Press, New York, 1987, pp. 54–64.
24. Harel, D., Lachover, H., Naamad, A., Pnueli, A., Politi. M., Sherman, R., and Shtul-Trauring, A. STATEMENT: A working environment for the development of complex reactive systems. In Proceedings of the Tenth IEEE International Conference on Software Engineering (Singapore, April 13-15). IEEE Press, New York, 1988.
25. Hendrix, G.G. Expanding the utility of semantic networks through partitioning. In Proceedings of the 4th International Conference on Artificial Intelligence (Tbilisi, Georgia, USSR, Sept. 3-8). International Joint Council on Artificial Intelligence, Cambridge, Mass., 1975, pp. 115–121.
26. Hoare, C.A.R. Communicating sequential processes. Commun. ACM 21, 8 (Aug. 1978), 666–677.
27. Hopcroft, J.E., and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.
28. i-Logic. The languages of STATEMATE. Tech. Rep., i-Logix, Burlington, Mass., 1987.
29. Kahana, C.A. Statecharts with overlapping states. M.S. thesis, Dept. of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan, Israel, 1986 (in Hebrew).
30. Lefschetz, S. Introduction to Topology. Princeton University Press, Princeton, N.J., 1949.
31. Maier, D., and Ullman, J.D. Connections in acyclic hypergraphs. In Proceedings of the ACM Symposium on Database Systems (Los Angeles. Calif., March 29-31). ACM. New York, 1982, pp. 34–39.
32. Manna, Z., and Pnueli, A. Specification and verification of concurrent programs by ∀-automata. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages (Munich). ACM, New York, 1987, pp. 1–12.
33. Martin. J., and McClure. C. Diagramming Techniques for Analysts and Programmers. Prentice-Hall, Englewood Cliffs, N.J., 1985.
34. McSkimin, J.R., and Minker. J. A predicate calculus based semantic network for deductive searching. In Associative Networks: Representation and Use of Knowledge by Computer, N.V. Findler, Ed. Academic Press, New York, 1979, pp. 205–238.
35. Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York. 1980.
36. Nakano, R. Integrity checking in a logic-oriented ER model. In Entity-Relationship Approach to Software Engineering, C.G. Davis et al., Eds. Elsevier Science Publishers, Amsterdam, 1983, pp. 551–564.
37. Nilsson, N.J. Principles of Artificial Intelligence. Tioga, Palo Alto, Calif., 1980.
38. Owicki, S., and Lamport. L. Proving liveness properties of concurrent programs. ACM Trans. Program. Lang. Syst. 4. 3 (July 1982), 455–495.
39. Pnueli, A. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In Current Trends in Concurrency, J. W. de Bakker et al., Eds. Lecture Notes in Computer Science, vol. 224, Springer-Verlag, New York, 1986, pp. 510–584.
40. Quillian. M.R. Semantic memory. In Semantic Information Processing, M. Minsky, Ed. MIT Press, Cambridge, Mass., 1968, pp. 227–270.
41. Reisig, W. Petri Nets: An Introduction. Springer-Verlag, Berlin, 1985.
42. Schiffner, G., and Schuermann. P. Multiple views and abstractions with an extended-entity-relationship model. Comput. Lang. 4, 3/4 (1979), 139–154.
43. Schmid, C.F. Statistical Graphics: Design Principles and Practices. Wiley, New York, 1983.
44. Shapiro, S.C. A net structure for semantic information storage, deduction, and retrieval. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence. 1971, pp. 512–523.
45. Touretzky, D.S. The Mathematics of Inheritance Systems. Pitman, London, and Morgan Kaufmann. Los Altos, Calif. 1986.
46. Tufte, E.R. The Visual Display of Quantitative Information. Graphics Press, Cheshire, Conn., 1983.
47. Tygar, J.D., and Wing. J.M. Visual specification of security constraints. In The IEEE Workshop on Visual Languages (Linköping, Sweden. Aug. 19-21). IEEE Press. New York, 1987.
48. Venn, J. On the diagrammatic and mechanical representation of propositions and reasonings. Phil. Mag. (1880), 123.
49. Venn, J. Symbolic Logic. 2nd ed. London. 1894. (Reprinted by Chelsea, Bronx, N.Y., 1971.)
50. Woods, W.A. What's in a link? Foundations for semantic networks. In Representation and Understanding, D.G. Bobrow and A.M. Collins. Eds. Academic Press, New York. 1975. pp. 35–82.
51. Zave, P. A distributed alternative, to finite-state-machine specifications. ACM Trans. Program. Lang. Syst. 7. 1 (Jan. 1985), 10–36.