https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE450%3AG9 2026-06-08T20:02:40Z Revision history for this page on the wiki MediaWiki 1.45.3 https://wiki.kram.nz/index.php?title=SE450:G9&diff=50&oldid=prev 2008-02-15T19:52:43Z

<p>New page: = PRESENTATION SLIDES = Download here: http://studwww.cs.auckland.ac.nz/~ezur001/SOFTENG_450.ppt -Danushka and Eddie == Objectives == * To review and evaluate an article on Domain Specifi...</p> <p><b>New page</b></p><div>= PRESENTATION SLIDES =<br /> Download here: http://studwww.cs.auckland.ac.nz/~ezur001/SOFTENG_450.ppt<br /> -Danushka and Eddie<br /> <br /> == Objectives ==<br /> * To review and evaluate an article on Domain Specific Visual Language (DSVL)<br /> ** Our article can be found at https://www.se.auckland.ac.nz/courses/SOFTENG450/resources/vlpapers/OCONVL99.pdf (password protected)<br /> <br /> == Members == <br /> <br /> *Milenovic, Ivan (imil018)<br /> *Abeysuriya, Danushka (dabe012)<br /> *Halytskyy, Yuriy (yhal003)<br /> *Clark, Kevin Alan (kcla048)<br /> *Long, Ratha (rlon008)<br /> *Zurita, Edmund (ezur001)<br /> *Meads, Andrew (amea020)<br /> <br /> == Evaluation == <br /> <br /> <br /> <br /> === Closeness of mapping ===<br /> Metaphors are familiar to OOP designers (contract-based, polymorphic type systems).<br /> Petri nets formalism is used for concurency modeling and may be familiar to those working <br /> on distributed systems. At least has wikipedia page :). PN seem to have strong math. foundations<br /> but whether it is necessary to know is unclear.<br /> Conclusion - good.<br /> <br /> === Abstraction gradient ===<br /> <br /> === Consistency ===<br /> <br /> === Difusiness ===<br /> Allowes modeling at different abstraction levels (from contracts to resource sceduling).<br /> So different level of verbosity possible. Separation of functional requirements from <br /> distributed behaviour - diagrams are relatively small with only necessary details.<br /> Entities can be expanded/hidden.<br /> Conclusion - terse but users may give more details if needed making diagrams larger (more verbose).<br /> So I gues - good.<br /> <br /> === Error proneness ===<br /> <br /> === Hard mental operations ===<br /> <br /> === Hidden dependencies ===<br /> <br /> That is what VDSL is all about - figuring dependancies and resolving them automaticlly.<br /> So shouldn&#039;t be big problem ifOCoN is of any use.<br /> <br /> <br /> &#039;Contracts&#039; define the behaviour between components (or entities) of the DSVL. The dependency among different components are made visible through such contracts - hence good :).<br /> <br /> === Premature commitment ===<br /> <br /> === Progressive Evaluation ===<br /> Possible to run simulations of scenarios. Type checking on the fly (?).<br /> Not clear if there is progressive validation.<br /> Conclusion - average<br /> <br /> === Role expressiveness ===<br /> <br /> === Secondary notation ===<br /> <br /> === Viscosity ===<br /> <br /> Modular - may be easy to replace contracts. Polymorphic type system seems to help.<br /> Diagrams similar to state machines so can become large. Rearanging elements may be time-consuming.<br /> <br /> === Visibility ===<br /> <br /> === Cognitive Dimension===<br /> more blah<br /> <br /> === Pros ===<br /> * Concurrency did not have a visual model before this<br /> * Concept is easy for Object Oriented Programmers to understand because of the use a polymorphic-type system<br /> * A good separation of concerns (the protocol net <br /> * Well known formalism for modelling concurrency<br /> * Good metaphor for the procedural calls<br /> * Consistency among views <br /> === Cons ===<br /> * Limited to Object oriented architectures<br /> * Not much of an improvement over something that already exists (statechart) - although that may be why there is not much wrong with it<br /> <br /> <br /> == Conclusion ==<br /> * Simple improvement to include an important concept of distributed system design<br /> * Visual notation is something we are somewhat familiar with.<br /> <br /> <br /> == Presentation ==<br /> * Presenter: Danushka<br /> * Downloadable here: &lt;not here yet&gt;</div>

Mark