The grand unified theory of software engineering

Front Cover
Industrial Info Systems, 2005 - 235 pages
 

Common terms and phrases

Popular passages

Page 166 - ... considerfirstcolumn. The problem essentially consists of inspecting the safety of squares. A pointer variable designates the currently inspected square. The column in which this square lies is called the currently inspected column. This procedure initializes the pointer to denote the first column. trycolumn. Starting at the current square of inspection in the currently considered column, move down the column either until a safe square is found, in which case the Boolean variable safe is set to...
Page 180 - ... is gradually developed in a sequence of refinement steps. In each step, one or several instructions of the given program are decomposed into more detailed instructions. This successive decomposition or refinement of specifications terminates when all instructions are expressed in terms of an underlying computer or programming language, and must therefore be guided by the facilities available on that computer or language. The result of the execution of a program is expressed in terms of data,...
Page 165 - ... labels and jumps, a statement of the form repeat (statement sequence) until (Boolean expression) is introduced, meaning that the statement sequence is to be repeated until the Boolean expression has obtained the value true. 3. The 8-Queens Problem and an Approach to Its Solution1 Given are an 8 X 8 chessboard and 8 queens which are hostile to each other. Find a position for each queen (a configuration) such that no queen may be taken by any other queen (ie such that every row, column, and diagonal...
Page 235 - Conway, der schrieb ..organizations which design Systems are constrained to produce Systems which are copies of the communication stnictures of those organizations". Fred Brooks beschreibt das gleiche Phänomen in seinem vielzitierten Buch „The Mythical Man Month".
Page 179 - ¿is per step, in 0.09 seconds. 4. Development of the Program We now formulate the stepwise generation of partial solutions to the 8-queens problem by the following first version of a program: variable board, pointer, safe; considerfirstcolumn ; repeat trycolumn; if safe then begin setqueen; considernextcolumn end else regress until lastcoldone V regressoutoffirstcol This program is composed of a set of more primitive instructions (or procedures) whose actions may be described as follows: considerfirstcolumn....
Page 5 - In order of decreasing strength, these are the strong force, the electromagnetic force, the weak force, and the gravitational force.
Page 167 - ... repeat advancepointer; testsquare until safe V lastsquare procedure regress; begin reconsiderpriorcolumn if - regressoutoffirstcol then begin removequeen; if lastsquare then begin reconsiderpriorcolumn; if -i regressoutoffirstcol then removequeen end end end The program is expressed in terms of the instructions: considerfirstcolumn considernextcolumn reconsiderpriorcolumn...
Page 4 - Schedule disaster, functional misfit, and system bugs all arise because the left hand doesn't know what the right hand is doing.

Bibliographic information