By Topic

Formalizing spider diagrams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gil, J. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; Howse, John ; Kent, S.

Geared to complement UML and 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 emphasizes scalability and expressiveness while retaining intuitiveness. In this paper, we describe spider diagrams from a mathematical standpoint and show how their formal semantics can be made in terms of logical expressions. We also claim that all spider diagrams are self-consistent

Published in:

Visual Languages, 1999. Proceedings. 1999 IEEE Symposium on

Date of Conference:

1999