C. B. Jones #Ed.#, Essays in Computing Science, Prentice Hall. 1969.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....but leave the burden of correctness and reliability to the users, while transaction models support recovery and failure handling to ensure correctness and provide only limited support to collaboration and cooperation between tasks [2] 1. 2 Statement of the problems Recently, based on Hoare logic [35], a semantic correctness theory has been developed for transaction processing systems [12, 9, 10] in which the semantics of a transaction is described by annotating each its statement by a precondition and a postcondition. This theory has been demonstrated to be useful for improving the ....

....work ow is the desired one is neither speci ed nor proved. Thus, to the best of our knowledge, a formal framework for reasoning about the correctness of a work ow with respect to a speci cation of its outcome is still missing. Recently, a semantic correctness theory that is based on Hoare logic [35] has been developed for transaction processing systems [12, 9, 10] This theory is useful both for improving the performance of a transaction processing system [11] and for reasoning about execution correctness of transactions running at di erent isolation levels [13, 14] In this dissertation we ....

[Article contains additional citation context not shown here]

C. A. R. Hoare and C. B. Jones, editors. Essays in Computing Science. Prentice Hall, 1989.

....one does not argue about specifications or programs, but about the models which are assigned to them by means of some semantics. The arguments considering correctness are then, ideally, not only mathematically influenced but indeed mathematical theorems. Such a view is for example advocated in [Hoa89] Of course there remains one problem in principle: A formally proven correct program will confirm to the formal requirements, but does it also confirm to the customer s informal ones For deeper philosophical insights in fundamental questions concerning formal methods see [Bu95] pp.102 105. ....

C.A.R.Hoare. Essays in Computing Science. C.B.Jones, Ed., New York 1989.

....within the scope of an introductory module on (formal) program design. Keywords: algorithm design, program correctness. 1 Introduction The program Find developed by C.A.R. Hoare [Hoa61] was one of the rst examples of the development of an algorithm hand in hand with a proof of its correctness [Hoa71, He89]. The program is rarely used, however, to illustrate the principles of program construction in programming texts, not even in any of the leading texts on formal program design. In this paper we present an improved derivation and implementation of the program in the hope that the problem may be ....

....Quicksort the worst case time complexity of Find is discouraging. It is not dicult to construct an example array for which the Find program requires N (N 1) N K 1) swap operations to achieve its task. So, if K is small compared to N , the worst case complexity is O(N 2 ) Hoare [He89] discusses alternative ways of choosing the borderline element in order to reduce the risk of such pathological behaviour. Hoare s analysis is for Quicksort but applies equally to Find . The average case running time of the algorithm is substantially better. Let C n denote the average number of ....

C.A.R. Hoare and C.B. Jones (editor). Essays in Computing Science. Prentice Hall, 1989.

....and their design and analysis, but on a different philosophy of computer science. This holds that programming should be viewed as a means of linking together the seemingly unconnected branches of Computer Science and related disciplines. A quote from Hoare explains this philosophy quite well [Hoa89] Having surveyed the relationships of computer science with other disciplines, it remains to answer the basic questions: What is the central core of the subject What is it that distinguishes it from the separate subjects with which it is related What is the linking thread which gathers these ....

C.A.R. Hoare. Essays in Computing Science. Prentice-Hall, 1989. (editor) C.B. Jones.

....We have chosen to present the activities of 7 processors in Table 1; a smaller number is not enough for a clear presentation. The solutions of the above problems are presented in detail by Table 1: Steps in the Pipelined Striped Partitioning Algorithm. step(l) P[0] P[1] P[2] P[3] P[4] P[5] P[6] 0 div 1 send rec 2 send rec 3 elim send rec 4 div elim send rec 5 send rec elim send rec 6 send rec elim send rec 7 elim send rec elim 8 div elim send rec elim 9 send rec elim send rec 10 send rec elim 11 elim send rec elim 12 div elim send rec 13 send rec elim 14 send rec elim 15 elim send rec ....

C. A. R. Hoare, The Emperor's Old Clothes, Essays in Computing Science, pp. 1--18, (Prentice Hall, 1989).

....The type of definition we are aiming to motivate is that of a formal description of the syntax and semantics of an OO query language, definition language and data model. 2. 1 A formal standard There have been many arguments put forward to promote the use of formal methods in computer science (e.g. [33]) With a lot of development in OO databases left to be done it can be appreciated that there is a need for a common standard and framework to enable useful progress. One attempt at a standard by commercial vendors was first published four years ago by the ODMG [16] The standard is being ....

C. A. R. Hoare. Essays in Computing Science. Prentice Hall, 1989.

....much simpler. The AAA project is based on a different philosophy of computer science. This holds that programming should be viewed as a means of linking together the seemingly unconnected branches of Computer Science and related disciplines. A quote from Hoare explains this philosophy quite well [Hoa89]: Having surveyed the relationships of computer science with other disciplines, it remains to answer the basic questions: What is the central core of the subject What is it that distinguishes it from the separate subjects with which it is related What is the linking thread which gathers these ....

C.A.R. Hoare. Essays in Computing Science. Prentice-Hall, 1989. (editor) C.B. Jones.

No context found.

C. B. Jones #Ed.#, Essays in Computing Science, Prentice Hall. 1969.

No context found.

C.A.R. Hoare. Essays in Computing Science. Prentice-Hall, 1989. (editor) C.B. Jones.

No context found.

C. A. R. Hoare and C. B. Jones. Essays in Computing Science. Prentice Hall, New York, 1989.

No context found.

C. A. R. Hoare and C. B. Jones. Essays in Computing Science. Prentice Hall, New York, 1989.

No context found.

C. A. R. Hoare and C. B. Jones. Essays in Computing Science. Prentice Hall, New York, 1989.

No context found.

C. A. R. Hoare and C. B. Jones, editors. Essays in Computing Science. Prentice-Hall, 1989.

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