Skip to main content

Formalizing Spider Diagrams

Gil, J. and Howse, J. and Kent, S. (1999) Formalizing Spider Diagrams. In: Proceedings of IEEE Symposium on Visual Languages. IEEE, pp. 130-137. ISBN 0-7695-0216-4. (doi:10.1109/VL.1999.795884) (KAR id:21724)

Language: English
Click to download this file (157kB) Preview
[thumbnail of formalizing_spider_diagrams_gil.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


Geared to complement UML and to the specification of large software systems by non-mathematicians, spider diagrams are a visual language that generalizes the popular and intuitive Venn diagrams and Euler circles. The language design emphasized scalability and expressiveness while retaining intuitiveness. In this extended abstract we describe spider diagrams from a mathematical standpoint and show how their formal semantics in terms of logical expressions can be made. We also claim that all spider diagrams are self-consistent.

Item Type: Book section
DOI/Identification number: 10.1109/VL.1999.795884
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 03 Sep 2009 09:47 UTC
Last Modified: 16 Nov 2021 10:00 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.