A reading algorithm for constraint diagrams

FISH, ANDREW, Flower, Jean and HOWSE, JOHN (2003) A reading algorithm for constraint diagrams In: Proceedings of the IEEE Symposium on Human Centric Computing Languages and Environments (HCC 2003), Auckland, New Zealand, 28-31 October, 2003.

Full text not available from this repository.

Abstract

Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler circles, and include facilities for quantification and navigation of relations. Their design emphasizes scalability and expressiveness while retaining intuitiveness. The formalization of constraint diagrams is non-trivial: previous attempts have exposed subtleties concerned with the ordering of symbols in the visual language. Consequently, some constraint diagrams have more than one intuitive reading. We develop the concept of the dependence graph for a constraint diagram. From the dependence graph we obtain a set of reading trees. A reading tree provides a partial ordering for some syntactic elements of the diagram. Given a reading tree for a constraint diagram, we present an algorithm that delivers a unique semantic reading.

Item Type: Contribution to conference proceedings in the public domain ( Full Paper)
Uncontrolled Keywords: Visual formalisms; software specification; formal methods; constraint diagrams; diagrammatic reasoning
Subjects: G000 Computing and Mathematical Sciences
DOI (a stable link to the resource): 10.1109/HCC.2003.1260220
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 26 Nov 2007
Last Modified: 09 May 2013 09:08
URI: http://eprints.brighton.ac.uk/id/eprint/2881

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year