C. B. Jones. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, Manchester University, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the design and tractable analysis of networks of interacting processes, both digital and analog. 1. 1 Compositional development The separation of formal specifications into assumptions about the environment of a process and commitments made by the process has a venerable formal methods pedigree [11], stretching back through Hoare s axioms [10] to the germination of the idea in work by Floyd [9] and even Turing [29] By supporting the meaningful specification of open systems, the assumption commitment approach has become the cornerstone of many compositional approaches to treating complex ....

C. B. Jones. The search for tractable ways of reasoning about programs. Technical Report Series UMCS-92-4-4, Department of Computer Science, University of Manchester, 1992.

....In sequential programming, researchers studying semantic issues have focused most of their attention on program correctness , which can be modeled as a function relating inputs to outputs. A correct sequential program should also terminate for all inputs. See [AA78, dB80, Apt81, Apt84, Jon92] for comprehensive coverage of proof techniques for sequential programs. Program efficiency (space and time) has also received tremendous attention (see the ACM SDCR Theory of Computation working group report at http: geisel.csl.uiuc.edu loui complete.html) For concurrent systems, particularly ....

C. B. Jones. The search for tractable ways of reasoning about programs. Technical Report TR UMCS-92-4-4, Department of Computer Science, University of Manchester, 1992. Available through URL http://www.cs.man.ac.uk/csonly/cstechrep/Abstracts/UMCS-92-4-4.html.

.... 1 Introduction The separation of formal specifications into assumptions about the environment of a process and effects required of the process has a venerable formal methods pedigree, stretching back through Hoare s axioms [5] to the germination of the idea in work by Floyd and even Turing [6]. The adoption of what we will term the assumption effect paradigm in the development of dataflow networks may be traced to Misra and Chandy [14] who used assumption commitment specifications to develop a compositional method for the verification of safety properties in a dataflow network. ....

C. B. Jones. The search for tractable ways of reasoning about programs. Technical Report Series UMCS-92-4-4, Department of Computer Science, University of Manchester, 1994.

....which presented proof rules in a syntax directed manner. The origins of the approach can be traced back to Turing[Tur49] and the main influence on Hoare s work is attributed to Floyd[Flo67] For a tracing of significant steps in the history of research on reasoning about programs see [Jon92b] 65 Also called assertion language, language of formal logic, logical language, rule meta language etc. 20 2. A formalization of the statement programs execute as specified or, given the formalization above, a formalization of the statement programs satisfy a specification . 3. A formal ....

Cliff B. Jones. The Search for Tractable Ways of Reasoning About Programs. Technical Report UMCS-92-4-4, University of Manchester, Department of Computer Science, Manchester M13 9PL, England, 1992.

....show that the secrecy assumption for a protocol holds, a logical analysis using the BAN method and its variations (usually referred to as BAN like logics) will be much more convincing. From another angle, just as algorithms or programs should be designed for their correctness to be easily proven [17, 26], security protocols should be designed so that their security can be proven with relative ease. The difficulties encountered by previous efforts of protocol analysis, in our view, can be to some extent attributed to the undisciplined ways in which a protocol can be designed (and then submitted ....

C.B. Jones. The Search for Tractable Ways of Reasoning about Programs. Technical Report UMCS-924 -4, Department of Computer Science, University of Manchester, England, March 1992.

....for a protocol holds, a proof of the protocol s security using the logical analysis method of Burrows, Abadi, and Needham (also called the BAN logic) will be much more convincing. From another angle, just as algorithms or programs should be designed for their correctness to be easily proven [15, 28], security protocols should be designed so that their security can be proven with relative ease. The difficulties encountered by previous efforts of protocol analysis, in our view, can be to some extent attributed to the undisciplined ways in which a protocol can be designed (and then submitted ....

C.B. Jones. The Search for Tractable Ways of Reasoning about Programs. Technical Report UMCS-92-4-4, Department of Computer Science, University of Manchester, England, March 1992.

No context found.

C. B. Jones. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, Manchester University, 1992.

No context found.

Cli# B. Jones. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, Department of Computer Science, University of Manchester, Manchester, UK, March 1992.

No context found.

Cliff B. Jones. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, Department of Computer Science, University of Manchester, 1992.

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