TY - GEN
T1 - Computing reading trees for constraint diagrams
AU - Fish, Andrew
AU - Howse, John
N1 - The original publication is available at www.springerlink.com
PY - 2004/1/1
Y1 - 2004/1/1
N2 - 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. Due to subtleties concerned with the ordering of symbols in this visual language, the formalization of constraint diagrams is non-trivial; some constraint diagrams have more than one intuitive reading. A reading algorithm, which associates a unique semantic interpretation to a constraint diagram, with respect to a reading tree, has been developed. A reading tree provides a partial ordering for syntactic elements of the diagram. Reading trees are obtainable from a partially directed graph, called the dependence graph of the diagram. In this paper we describe a tree-construction algorithm, which utilizes graph transformations in order to produce all possible reading trees from a dependence graph. This work will aid the production of tools which will allow an advanced user to choose from a range of semantic interpretations of a diagram.
AB - 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. Due to subtleties concerned with the ordering of symbols in this visual language, the formalization of constraint diagrams is non-trivial; some constraint diagrams have more than one intuitive reading. A reading algorithm, which associates a unique semantic interpretation to a constraint diagram, with respect to a reading tree, has been developed. A reading tree provides a partial ordering for syntactic elements of the diagram. Reading trees are obtainable from a partially directed graph, called the dependence graph of the diagram. In this paper we describe a tree-construction algorithm, which utilizes graph transformations in order to produce all possible reading trees from a dependence graph. This work will aid the production of tools which will allow an advanced user to choose from a range of semantic interpretations of a diagram.
U2 - 10.1007/978-3-540-25959-6_19
DO - 10.1007/978-3-540-25959-6_19
M3 - Conference contribution with ISSN or ISBN
SN - 9783540221203
VL - 3062
T3 - Lecture Notes in Computer Science
SP - 260
EP - 274
BT - Proceedings of the Second International Workshop, AGTIVE 2003
A2 - Hosking, J.
A2 - Cox, P.
PB - Springer
CY - Berlin, Germany
T2 - Proceedings of the Second International Workshop, AGTIVE 2003
Y2 - 1 January 2004
ER -