David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for Gypsy, a derivative of Pascal. Neither of these languages supports data abstraction as well as CLU. Since data abstraction is a primary way that specifications simplify reasoning about programs, these programming languages seemed less attractive than CLU. Luckham and others designed ANNA [40], a language for annotating Ada programs. Although Ada supports data abstraction, CLU is more attractive because it is simpler than Ada, which has both stack and heap allocation. 34 Programs and Proof Rules This chapter describes the formalization of programs and the proof rules that will be ....

....post, feg [ AllLocs[node] AllLocs[edge] AllLocs[lp system] 112 The idea of writing formally only part of a procedure s specification is hardly new. For example, in [25] a procedure header may contain a formal postcondition, but the full postcondition need not be written formally. ANNA [40] provides a similar mechanism for both pre and postconditions. Speckle differs in that it distinguishes partial specifications from full specifications. This distinction is used to prevent the compiler from performing unsound optimizations. The idea of writing specifications incrementally has ....

David C. Luckham, Friedrich W. von Henke, Bernd Krieg-Bruckner, and Olaf Owe. ANNA Reference Manual, volume 260 of Lecture Notes in Computer Science. Springer-Verlag, 1987.

....the plan itself, but with proving that it meets the specified conditions successfully. A recent theoretical proposal that also treats plans as programs is reported in [111] The authors propose a logical framework for specifying consistent axiomatizations of planning domains in Dynamic Logic [45] using a STRIPS like [30, 29] representation of actions. Unlike the situation calculus, states are not explicitly represented as terms in dynamic logic but are instead referred to using modal operators. The essence of the proposal is to view states as sets of positive ground literals such as on(A; ....

David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1979.

....q; r; and connectives ; 2;3. The connectives 2 and 3 take two arguments; if A; B are formulas then so are 2AB and 3AB. The set L is the set of atomic formulas p; q; r; the set L is the set of all formulas over L. The semantics of multi modal logic is given as follows (cf. [5, 15, 16, 8, 7]) A model M = hW; R; V i of the multi modal language L is a set W of worlds, an accessibility relation R P(W ) Theta W Theta W and a valuation V : L P(W ) The ternary relation R may also be thought of as an P(W ) indexed family fR S j S Wg of binary relations in W Theta W . The ....

....valid . The double barred rule A = B holds in F if for all M = hF; V i, M fl A iff M fl B. 2.2 Inverse modalities Classical modal logic is based on Kripke accessibility relations; it is thus natural to examine the logical counterparts of operations on relations. For instance, dynamic logic [16, 8, 7] (a logic of programs) uses relation composition (to express sequencing) transitive closure (to express iteration) union (to express non deterministic choice) In this paper, we will be interested in the inverse operation on relations: R Gamma1 (x; y) R(y; x) Given a unary modality 2 ....

David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1979.

....f need not be declared at the same place as x. In may cases, this freedom allows more natural modular decompositions. Section 4 will give examples. Variable functions have come up in a number of contexts, ranging from program logics to specification languages, to programming. Dynamic logic [Har79] makes extensive use of variable functions called arrays (but being not restricted to integer domains) Evolving algebras[Gur95] now called abstract state machines, use a combination of algebraic data types and variable functions together with transition rules for system modelling [BBD 96] ....

David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer Verlag, 1979.

....ProtoTech and DSSA team, and is the result of a long series of experimental prototyping and executable architecture definition languages (CPL [9, 67] Rapide 0.2 [14] Micro Rapide [65, 66] Interim Rapide 1, Graphical Rapide) which themselves drew heavily upon the prior work of the PAVG. Anna [51, 59, 61, 69], developed by PAVG, is a language extension of Ada [94] CHAPTER 1. INTRODUCTION 17 to include facilities for formally specifying the intended behavior of Ada programs. Anna tools include a specification analyzer, a tool for the debugging of and reasoning about the implications of formal ....

David C. Luckham, Friedrich W. von Henke, Bernd Krieg-Bruckner, and Olaf Owe. ANNA, A Language for Annotating Ada Programs, volume 260 of Lecture Notes in Computer Science. Springer-Verlag, 1987.

.... i) K2) Delta = b(sqrt(5) Gamma 1) 2 63 c = 9E3779B97F4A7C15 16 The addition of multiples of Delta, a value derived from the golden ratio by taking the integer part after multiplying it by 2 63 is used to minimise any symmetry affects in the key schedule, as was done in the TEA cipher [WN94]. In order to support the smaller 128 and 192 bit keys, an initialisation phase is used that again uses the same non linear function f(A; B) to expand the supplied bits up to 256 bits for the key schedule, in a complex non linear manner. 5 Computational Efficiency The following computational ....

David J. Wheeler and Roger M. Needham. TEA, a Tiny Encryption Algorithm, volume 1008 of Lecture Notes in Computer Science, pages 363-- 366. Springer-Verlag, 1994. http://www.cl.cam.ac.uk/ftp/papers/djwrmn /djw-rmn-tea.html.

....this solution is that referential transparency is destroyed. This implies that equational reasoning, an important program verification tool, can no longer be used. Also, programs using these techniques tend to be difficult to read. The term sphagetti programming has been used to describe them [Sto84, Tur87]. The explicit use of non determinism also raises a host of questions about its interaction with the parameter passing mechanism [Cli82] and the formal semantics of non deterministic operators is complex [SS88] First, we shall critically survey some of the proposals made to overcome these ....

....process are merged into a single list and given to it. This merge occurs outside of all the processes in what Stoye calls the sorting office. The advantage of this scheme is that each of the processes themselves are referentially transparent, and can be subjected to equational reasoning. Turner [Tur87] refined this idea somewhat for use in another functional operating system effort, the KAOS project. Stoye applies this style profitably to the task of writing operating system programs like device handlers. But we claim that there are applications where this style is not suited ideally. ....

[Article contains additional citation context not shown here]

David Turner. Functional Programming and Communicating Processes, pages 54--74. Volume 259 of Lecture Notes in Computer Science, Springer Verlag, 1987.

....to Anna I tools Read section 4 Read section 5 Read section 6 Read section 3 Yes No Yes Yes Yes Yes No No No No Read preface and section 2 Figure 1: How to read this manual. Mendal Stanford December 3, The Anna I User s Guide and Installation Manual (for Version 1. 5) page 2 Preface Anna [LvHBO87] is a language extension of Ada [Ada83] to include facilities for formally specifying the intended behavior of Ada programs. It is designed to meet a perceived need to augment Ada with precise machine processable annotations so that well established formal methods of specification and ....

....[Ada83] to include facilities for formally specifying the intended behavior of Ada programs. It is designed to meet a perceived need to augment Ada with precise machine processable annotations so that well established formal methods of specification and documentation can be applied to Ada programs [LvHBO87]. This manual describes the status of the first release of the Anna environment, called Anna I. Some of the tools in this release support the entire Anna and Ada languages, while others are still under development and hence implement only a subset of both languages. Future releases will improve ....

[Article contains additional citation context not shown here]

David C. Luckham, Friedrich W. von Henke, Bernd Krieg-Bruckner, and Olaf Owe. ANNA, A Language for Annotating Ada Programs, volume 260 of Lecture Notes in Computer Science. Springer-Verlag, 1987.

....of PDL will be discussed and proved equivalent, namely PDL and PDL loop. In the last part, it will be shown that these extensions are sufficient for unbounded nondeterminism as well. PDL loop=repeat grew out of PDL which was introduced in [HP78] another primary source on this issue is [Har79]. The equivalence between the two systems is intuitively clear and mentioned in [Har79] though not actually proved. 5.1 Deterministic PDL programs We will define the class of WHILE programs inductively like the class of PDL programs in general, except that we restrict the clause for program ....

....last part, it will be shown that these extensions are sufficient for unbounded nondeterminism as well. PDL loop=repeat grew out of PDL which was introduced in [HP78] another primary source on this issue is [Har79] The equivalence between the two systems is intuitively clear and mentioned in [Har79], though not actually proved. 5.1 Deterministic PDL programs We will define the class of WHILE programs inductively like the class of PDL programs in general, except that we restrict the clause for program iteration to programs of the form while b do p, and that we restrict the clause for ....

David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer Verlag, 1979.

No context found.

David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1979.

No context found.

David Dill, editor, Computer-Aided Veri#cation, CAV '94, volume 818 of Lecture Notes in Computer Science, pages 68#80, Stanford, CA, June 1994. Springer-Verlag.

No context found.

David H. Pitt, David E. Rydeheard, Peter Dybjer, Andrew M. Pitts, and Axel Poigne, editors. Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science. Springer-Verlag, 1989.

No context found.

David Pitt, David Rydeheard, Peter Dybjer, Andrew Pitts, and Axel Poign'e, editors. Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science. Springer, September 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