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)
|
PDF
Language: English |
|
|
Download this file (PDF/157kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
| Official URL: http://dx.doi.org/10.1109/VL.1999.795884 |
|
Abstract
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: | https://kar.kent.ac.uk/id/eprint/21724 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
