From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,fceb4e36ba4d570f X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-04-23 11:53:01 PST Path: newsfeed.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!dispose.news.demon.net!news.demon.co.uk!demon!pogner.demon.co.uk!zap!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: ada95 and uml Date: 23 Apr 2001 06:50:29 +0100 Organization: CodeFella Message-ID: References: <3AE3A5BD.C0601A95@home.com> NNTP-Posting-Host: localhost X-NNTP-Posting-Host: pogner.demon.co.uk:158.152.70.98 X-Trace: news.demon.co.uk 988051935 nnrp-08:29472 NO-IDENT pogner.demon.co.uk:158.152.70.98 X-Complaints-To: abuse@demon.net NNTP-Posting-Date: 23 Apr 2001 05:50:29 GMT X-Newsreader: Gnus v5.7/Emacs 20.7 Xref: newsfeed.google.com comp.lang.ada:6863 Date: 2001-04-23T05:50:29+00:00 List-Id: Robert Palasek writes: > "Riehle, Richard" wrote: > > > From my study of UML and my knowledge of Ada, I have concluded > > there is a substantial linguistic discontinuity. Ada has a rich > > model of program development that cannot be > completely represented > > with UML. Translating from UML to Ada or Ada to UML is guaranteed > > to lose something in the translation. > > I know a little about each, but am not an expert yet with either. > > But I don't understand the idea that you are supposed to be able to > generate one from the other. That seems wrong and misguided to me. > > A model is an abstraction that carries some proper subset of > salient points of the thing being modeled. For it to be useful, the > model has to leave other stuff out. If it doesn't leave anything > out, it's just an alternate representation. True; model + translation rules -> code. This is possible provided your model is expressed with the precision required by the translation rules[1]. This has been a principle of Shlaer-Mellor Recursive design for a while now (unfortunately the book hasn't come out). You can get a commercial UML->Ada generator now from Aonix that does this (for code frameworks only). I'm sure there are others, perhaps not for Ada! What you can't reasonably expect to do is to take the result of such a code-generation, change it, and round-trip back to the model. No great loss (IMO). [1] As a simple example, you might have to specify role names for each end of an association.