David A. Carrington

Learn More
Many automatic graph layout algorithms have been designed and implemented to display relational data in a graphical (usually node-arc) manner. The success of these algorithms is typically measured by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimising the number of crossings, maximising(More)
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimising the number of crossings, maximising orthogonality). Experiments investigating the worth of such algorithms from the point of view of human usability can take different forms,(More)
Many existing automatic graph layout algorithms are unrelated to any particular semantic domain. Designers of such algorithms tend to conform to layout aesthetics, and claim that by doing so, the resultant diagram is easy to understand. Few algorithms are designed for a specific domain, and there is no guarantee that the aesthetics used for generic layout(More)
A framework for specification-based testing is demonstrated on a symbol table case study, specified using the Z notation. Test derivation and structuring is discussed, as well as applications of the framework in deriving test oracles and aiding regressing testing during maintenance. Areas for further research and discussion are comparison of heuristics with(More)