E. W. Dijkstra. Structured Programming. Academic Press, 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Data Structures in Java for Matrix Computations - Gundersen, Steihaug (2002) (Correct)
....3 Matrix Multiplication Algorithms Let A be a n m and B be m p matrices. The matrix product C = AB is a n p matrix with elements C ij = k=0 A ik B kj i = 0; 1; n 1; j = 0; 1; p 1 (2) A straightforward implementation of (2) using Java s native arrays is given in [3, 4]. for(int i = 0; i m;i ) for(int j = 0;j n;j ) for(int k = 0;k p;k ) C[i] j] A[i] k] B[k] j] By interchanging the three for loops there are six distinct ways of doing matrix multiplication. We can group them into pure row, pure column, and partial row column. If for each ....
....di erent storage schemes for large and unstructured sparse matrices that are used in languages like FORTRAN, C and C . These storage schemes have enjoyed several decades of research and the most commonly used storage schemes for large sparse matrices are the compressed row or column storage [4]. The compressed storage schemes have minimal memory requirements and have shown to be convenient for several important operations. For matrices with special structures like symmetry the storage schems must be modi ed. Currently there is no released packages implemented in Java for numerical ....
O.-J. Dahl, E. W. Dijkstra and C. A. R. Hoare, Structured Programming, Academic Press London and New York, 1972.
Software Evolution as the Key to Productivity - Nierstrasz (Correct)
....place in ensuring the robustness and correctness of individual, functional software components, but not necessarily assemblages of components, or nonfunctional aspects of software systems. Testing has the clear disadvantage that it can never be used to demonstrate the absence of software defects [7]. Despite its obvious shortcomings, however, aggressive testing during development and evolution can have a dramatic improvement in software quality and software productivity [2] Furthermore, tests, particularly automated unit tests, can be highly robust in the face of change. The investment in ....
Ole-Johan Dahl, Edsgar W. Dijkstra, and C.A.R. Hoare. Structured Programming. Academic Press, 1972.
Distributed Information Systems Tailorability: a.. - Theotokis, Kapos.. (Correct)
....both at the end users side and at the implementors side. In all cases the important issue is to do so in a dynamic manner [14] All along the evolution of software engineering methodologies and programming languages, the main concern has been the, so called, separation of concerns principle [5]. The basic idea underlying this principle is the partition of the state space, so that it becomes possible to put the focus on the resulting parts, individually. Once partitioned, the separated pieces must somehow be connected to each other, preferably by a loose connection that maintains ....
D. O. Dijkstra, and C. A. R. Hoare, Structured Programming, Academic Press, London, 1972
The formal method known as B and a sketch for its implementation - Kaijanaho (2002) (Correct)
....[85] Now, thirty four years since the conference, the software crisis, especially software unreliability, is still an acute problem (cf. e.g. 54] Several silver bullets have been proposed in the mean time, promising to end the crisis, but none have succeeded. Structured programming [33], literate programming [71] CASE tools (cf. 54] object orientation [13] and open source software [99] have all been said to deliver reliable software. Many of them have already contributed enormously to the state of the art in software engineering for example, Hoare [60] credits ....
E. W. Dijkstra. "Structured programming". In J. N. Buxton and B. Randell (eds.), "Software Engineering Techniques: Report on a conference sponsored by the NATO Scuence Committee, Rome, Italy, 27--31 Oct. 1969.
Using Debug Tools To Help Produce Correct Programs - Clifford (1978) (Correct)
....or even impossible to define all input combinations for complex systems. Even if the input can be generated there may be insufficient machine resources to perform the tests. Consider a hardware multiplication unit which is designed to multiply two 27 bit integers in less than 100 microseconds [7]. Exhaustive data testing means that 2 54 different inputs must be tried. Ignoring the time to verify results, the multiplications alone would take more than 10,000 years. An interesting fact derived from this result is that during the lifetime of this multiplication unit it will only be ....
O.J.Dahl, E.W.Dijkstra, C.A.R.Hoare, Structured programming, Academic Press, 1972.
Reengineering the "Enterprise" Game to the Web - Mazanec (Correct)
....have been used to draw the control flow to provide a consistent notation throughout the whole documentation. The program modules have been treated like objects. The source code of Enterprise conforms in the main parts to the definition of a well structured program by Dahl, Dikstra and Hoare [DAH72]. The documentation of Enter prise together with the provided instructor s and students manual avoided the Concept Assignment Problems as described by Biggerstaff [BIG93] Based on the manuals of the Enteprise game and my experiences collected while playing it I created an object oriented ....
Dahl, O. J., E. W. Dijkstra, C. A. R. Hoare, Structured Programming, Academic Press, 1972
Monitoring, Testing and Debugging of Distributed Real-Time Systems - Thane (2000) (1 citation) (Correct)
....explore all behaviors of the program. But, for a program that takes two 32 bit integers as input, we must cover 2 possible input combinations, and if each test case takes 1 s to perform we would need 565 000 years to cover all possible input combinations. Not surprisingly E. Dijkstra concluded [19]: Non exhaustive testing can only show the presence of errors not their absence. Figure 2 5. Interpolation cannot represent the discontinuos behavior of software. 15 Aggravating the situation further is the fact that typically more than half of the errors in a system are due to ambiguous ....
Dahl O.J, Dijskstra E.W., and Hoare C.A.R. Structured Programming. Academic Press, 1972.
The Inevitable Pain of Software Development, Including of Extreme.. - Berry (Correct)
....repeated backtracking, when new requirements are continually discovered. 6.3. Structured Programming I can recall the first systematic programming method I learned, used, and taught, from 1973 until it fell out of fashion in the mid 1980s, namely, Structured Programming or Stepwise Refinement [35, 15]. After having done build it and fix it programming for years, Structured Programming appeared to be the silver bullet, at last, a way to put some order into the chaotic jumble of thoughts that characterized my programming, at last, a way to get way ahead of or to the side of the avalanche that ....
Dahl, O.-J., Dijkstra, E.W., and Hoare, C.A.R., Structured Programming, Academic Press, London, UK (1972).
Formal Methods and Mechanical Verification applied to.. - Vos, Swierstra, Prasetya (1996) (Correct)
....we are always very accurate in distinguishing all cases , or, Yes, but we always test very well. Obviously, considering the increasing complexity of (safety critical) software, and an often quoted remark that Program testing can be used to show the presence of bugs, but never their absence. [DDH72, page 6], these defences are by no means adequate for not being formal. In the light of experience 2, formally developing and mechanically verifying the sorting program took approximately 6 man months, which included ffl getting acquainted with HOL, UNITY and Prasetya s embedding of the latter in HOL. ....
J. Dahl, O, E.W. Dijkstra, and C.A.R. Hoare. Structured programming. Academic Press, Orlando, 1972.
Hope: An Experimental Applicative Language - Burstall, MacQueen, Sannella (1980) (89 citations) (Correct)
....in writing large bug free programs is to construct them in smallish pieces, each as self contained as possible, with the pieces communicating with each other in a disciplined, explicit manner. An important technique for achieving this is data abstraction (see for example Hoare in chapter 2 of [10]) This has been explored as an aid to good programming style in such recent languages as ALPHARD [31] CLU [25] and ADA [20] which may be thought of as developing one aspect of the SIMULA class concept [11] An abstract data type, such as set or queue , is defined by a collection of ....
Dahl, O-J., Dijkstra, E.W. and Hoare C.A.R. Structured Programming. Academic Press, 1972.
Software Processes: a Retrospective and a Path to the Future - Cugola, Ghezzi (1998) (10 citations) (Correct)
.... basic assumption was that programs are mathematical entities that can be formally specified, proven correct, and even developed correctly by means of calculi for program derivation that are guaranteed to transform a specification into a correct implementation, via well defined refinements [29,76,26,38,10]. Indeed, this approach provided a new impetus for research in computer science and led to a much better understanding of the foundations of software development. It helped understand precisely what a specification is and what it means that an implementation conforms to its specification. It led ....
O. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, Structured Programming. Academic Press, 1972.
Formal Model For Software Systems Composition - Marin (2000) (Correct)
....the speci cation must consider the mechanism of status changing for a software system and its associated 4. Software systems composition The idea that a software system must be decomposed in smaller subsystems, for the purpose of a better handling, is an old idea and it is frequently argued in [1]. But building a software system form simpler subsystems is an idea embraced from the beginning of 90s, and the advantages of this method is presented in papers like [8, 4, 3] We will specify a formal model, based on our software system speci cation, for the operation of software systems ....
Dahl O.J., Dijkstra E. W., Hoare C.A.R., Structured Programming, Academic Press, 1972
A Brief Survey of Software Architecture - Land (2002) (Correct)
....enough understanding of the term to be able to continue. 1.3 History During the history of computers, software has rapidly become more and more complex. A number of approaches have been proposed (and successfully used) to deal with complexity on different levels, such as structured programming [11] and Fred Brooks idea of conceptual integrity [8] The design phase in the software lifecycle has often been split into high level design and detailed design. Many concepts in the field of ordinary (building) architecture was found to be useful for describing software, thus giving birth to the ....
Dahl O.-J., Dijkstra E. W., and Hoare C. A., Structured Programming, Academic Press, 1972.
On the Search for Tractable Ways of Reasoning about Programs - Jones (2001) (8 citations) (Correct)
....famous letter to the editor [Dij68c] as being just about coding rules, the avoidance of goto statements can be seen as a step towards tractability of programs for reasoning rather than for compilation. In fact the issues raised in the debate about Structured Programming are much wider and [DDH72, Dij68a, Dij71, Wir73, Wir76] have transformed thinking about the programming task. If more than one form of semantics is used then they must be consistent. The impact of this observation on the assumptions under which it is possible to claim that a proof provides knowledge about program ....
O.-J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, editors. Structured Programming. Academic Press, 1972.
Why Do We Need a Floating-Point Arithmetic Standard? - Kahan (1981) (2 citations) Self-citation (Dijkstra) (Correct)
No context found.
O.J. Dahl, E.W. Dijkstra, C.A.R. Hoare, Structured Programming, Academic Press, New York, 1972, pp. 15-16.
Design And Evaluation Of - Emergent Behaviour For (Correct)
No context found.
E. W. Dijkstra. Structured Programming. Academic Press, 1972.
The ASM Method: a Cornerstone in Computer Science Education - Börger (2005) (Correct)
No context found.
O. Dahl, E. W. Dijkstra, and C. A. R. Hoare. Structured Programming. Academic Press, 1972.
Flexibility in Statically Scheduled Hard Real-Time Systems - Fohler (1994) (9 citations) (Correct)
No context found.
O.-J. Dahl, E. W. Dijkstra, and A. R. Hoare. Structured programming. Acad. Pr., 2 edition, 1973.
Software Verification for Programmable Logic Controllers - Huuck (2003) (Correct)
No context found.
Edsger W. Dijkstra. Structured programming. In J.N. Buxton and B. Randell, editors, Software Engineering Techniques, Report on a conference sponsored by the NATO Science Committee, pages 84--88. NATO Science Committee, 1969.
Security testing of SIP implementations - Wieser, Laakso, Schulzrinne (2003) (Correct)
No context found.
E. W. Dijkstra, "Structured programming," Aug. 1969, circulated privately. [Online]. Available: http://www.cs.utexas.edu/users/EWD/ ewd02xx/
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
E. W. Dijkstra. Structured programming. In Second NATO Conference on Software Engineering Techniques, Rome, Italy, pages 84--88. NATO, 1969.
Trust-By-Contract: Modelling, Analysing And Predicting.. - Schmidt, Poernomo.. (2001) (Correct)
No context found.
, Second NATO Conference on Software Engineering Techniques, Rome, Italy, NATO Science Committee pp. 84-88
The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003) (Correct)
No context found.
O.-J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, editors. Structured Programming. Academic Press, 1972.
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
E. W. Dijkstra. Structured programming. In Second NATO Conference on Software Engineering Techniques, Rome, Italy, pages 84--88. NATO, 1969.
A Methodology for Constructing Predicate Transition Net.. - He, Lee (1991) (4 citations) (Correct)
No context found.
O. J. Dahl, W. Dijkstra and C. A. R. Hoare, Structured Programming, Academic Press, N. Y., 1972.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC