Wrong confirmation ID

Email
Favorite
Favorited ×
Download
Embed
Private Content
Copy and paste this code into your blog or website Copy Customize… Close
We have emailed the verification/download link to "".
Login to your email and click the link to download the file directly.

To request the link at a different email address, update it here. Close
Validation messages. Success message. Fail message.

Check your bulk/spam folders if you can't find our mail.

Tweet

Loading…

Flash Player 9 (or above) is needed to view presentations.
We have detected that you do not have it on your computer. To install it, go here.

+ Follow

Modeling Safe Interface Interactions in Web Applications (ER´09)

by Jordi Cabot on Oct 31, 2010

312 views

Moving the Web (and the supporting browsers) from the browsing paradigm based on Pages, with related Back and Forward actions, to a full-fledged interactive application paradigm, based on the concept o...

More…

Moving the Web (and the supporting browsers) from the browsing paradigm based on Pages, with related Back and Forward actions, to a full-fledged interactive application paradigm, based on the concept of State, that features Undo and Redo capabilities, and transactional properties

Less

1 Embed 22

http://modeling-languages.com

22

Statistics

Favorites: 0
Downloads: 4
Comments: 0
Embed Views: 22
Views on SlideShare: 290
Total Views: 312

To present you a method that helps the designer during the specification of the software system by automatically generating a set of operations for a given class diagram.
Simple is more or less as public
Simple is more or less as public
Simple is more or less as public
Simple is more or less as public
In particular we will represent rules as pre/postcondition contracts E.g. once expressed in OCL we can apply code-generation techniques to the rules
Simple is more or less as public
Simple is more or less as public
Transactions not exaclty in the database sense
Simple is more or less as public
Basically, we create a class to store the information of each element
Strong executability : r is strongly executable if, for any legal instantiation that satisfies the pre-condition, there is another legal instantiation that satisfies the post-condition.  I :  I’ : (INV[I] and PREr[I])  (INV[I’] and POSTr[I, I’])
Simple is more or less as public
Simple is more or less as public
Simple is more or less as public
Simple is more or less as public
Indeed, once GT rules are expressed in OCL, we can benefit from all tools designed for managing OCL expressions when dealing with the GT rules. VAlidation: here an initial host graph is passed as an additional parameter to the verification tool)