Notations for Software Design by Loe M. G. Feijs, Hans B. M. Jonkers, Cornelis A. Middelburg

By Loe M. G. Feijs, Hans B. M. Jonkers, Cornelis A. Middelburg (auth.)

Notations for software program Design goals to provide an explanation for formal specification and layout to practitioners in software program improvement, and to set out the parts of a legitimate software program layout approach.
It examines COLD-1, that's at present being applied through Philips in lots of of its enterprise centres. the truth that it's a wide-spectrum language which helps many sorts of specification makes it an exceptional foundation for the amount. It additionally examines a few widely-used casual concepts, corresponding to Venn diagrams and Petri nets, therefore making a powerful hyperlink among present and destiny perform. instead of presenting new pictorial notations the authors position current ones right into a coherent framework, and clarify sensible methods of exploiting them along side COLD-1.

Show description

Read or Download Notations for Software Design PDF

Similar compilers books

Programming in Prolog

Initially released in 1981, this was once the 1st textbook on programming within the Prolog language and continues to be the definitive introductory textual content on Prolog. even though many Prolog textbooks were released when you consider that, this one has withstood the attempt of time due to its comprehensiveness, educational method, and emphasis on normal programming functions.

XML and Web Technologies for Data Sciences with R (Use R!)

Internet applied sciences are more and more correct to scientists operating with info, for either gaining access to facts and growing wealthy dynamic and interactive displays.  The XML and JSON information codecs are regular in internet prone, usual web content and JavaScript code, and visualization codecs similar to SVG and KML for Google Earth and Google Maps.

Additional info for Notations for Software Design

Sample text

3. It serves to encapsulate some of the implementation details of the map representation, such as the question whether open or closed hashing is used. 1 Storage Variables The component SVAR concerns simple programming variables, which serve to store values. The specification of SVAR is as follows. 11 shows the dynamic behaviour of SVAR[Bool], which is a variable obtained by instantiating SVAR with the twovalued sort Bool. Here Bool just serves as a simple example to avoid too many states in the diagram.

For any argument tuple Xl, ... ,Xn, the predicate r is simply either true or false. The predicate body rbody, if present, has one of the following forms: 1. VAR 2. DEP el, ... ,el 3. IND A 4. DEF A 5. FREE So the possible forms of function bodies and predicate bodies are essentially the same. The only (and obvious) difference is that, in the case of an algorithmic definition, functions are defined by an expression and predicates by an assertion. If no predicate body is present, then the definition introduces a predicate that is constant.

13 shows a typical example of a value set of Item1. The specification component ITEMl does not require the existence of any functions or predicates, so the diagram does not have any function arrows or lines Notations for Software Design 28 as in a Hasse diagram. ( . . 13: Example value set of sort Item1. The constant max indicates the maximum number of entries a map can have. The function hash maps Item1 objects to numbers and it plays a role in the technique of mapping the Item1 objects to entries in an array.

Download PDF sample

Rated 4.38 of 5 – based on 29 votes