Formalizing Spider Diagrams

Gil, J. and Howse, J. and Kent, S. (1999) Formalizing Spider Diagrams. In: Proceedings of IEEE Symposium on Visual Languages (VL99). IEEE Computer Society Press pp. 130-137. ISBN 0-7695-0216-4. (Full text available)

PDF
Download (140kB)
[img]
Preview
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: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 03 Sep 2009 09:47
Last Modified: 06 Sep 2011 04:03
Resource URI: http://kar.kent.ac.uk/id/eprint/21724 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year