C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403--419, July 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of predicate transformer semantics in support of compositional development methods for sequential programs. Weakest precondition program semantics were first suggested by Dijkstra [8] and have been blended successfully with the assumption commitment paradigm independently by Back [4] Morgan [21], Morris [23] and Nelson [24] These formalisms have much in common and are referred to collectively as the refinement calculus. The refinement calculus is a broad spectrum, specification programming language together with a collection of refinement rules that support top down design. High level ....

....predicate transformers. They are represented on network graphs as diamond shaped nodes, see Fig. 2(c) defs function def :# f# # ## a . # (fa) Relations may be embedded as predicate transformers to give abstract specifications of desired relations between inputs and outputs. Following Morgan [21], we introduce the specification statement as the primary method of expressing relational specifications. In addition to a relation between inputs and outputs (the commitment) the specification statement also includes an assumption about the properties of inputs. Specification statements are ....

[Article contains additional citation context not shown here]

C. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3), July 1988. Reprinted in [22].

....[3] as a way of reasoning about CSP programs. Later this framework has been extended and many interesting and non trivial parallel algorithms have been derived and studied as action systems [4, 6, 7] Action systems can be formally derived in a stepwise manner within the refinement calculus [1, 17, 18]. A useful tool when deriving these systems is the superposition refinement rule [7] that has been formalized within this calculus. Superposition is a program modularization and structuring method for developing parallel and distributed systems [3, 12, 13] In superposition some new functionality ....

C. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403 -- 419, July 1988.

.... languages in which the federated components are written, whereas DeCo exploits the fact that Haskell can be used not only for coordination but also for as much computation as is useful for a given federation (for data adaptation, for example) Examples of coordination languages include Polylith [13], Strand and PCL [5] and Linda [3] A domain specific language (DSL) is a language tailored to a particular application domain. A domain specific embedded language (DSEL) is a DSL built as an extension to an existing base language. DeCo is constructed as a DSEL based on Haskell whose domain is ....

J. M. Purtilo. The POLYLITH software bus. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(1):151--174, 1994.

....and understandability of that model requires some familiarity with the specification language (Circus) itself, which we provide in section 3, below. Circus Circus is a unified programming language that combines Z [1, 26] and CSP [14, 20] constructs, together with specification statements [18] and guarded commands [12] With Z and CSP integrated into the language, Circus can be used to describe both the state and behavioural aspects of concurrent systems. Though there are several other examples of combining Z and CSP in the literature [13] Circus distinguishes itself by a theory of ....

C. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403-419, 1988.

....normal termination to model state changes in the source program. We use erroneous termination to model errors in the source program. For our source language, these errors are array index out of bounds errors. We use miraculous termination to model the programmer being off the hook (see, e.g. [0,19, 21, 20, 17]) 4 An assignment command x : E updates the state by setting the variable x to the value of the expression E and then terminates normally. The commands assert P and assume P terminate normally, without changing the state, if P evaluates to true ; otherwise, the assert statement terminates ....

Carroll Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403--419, July 1988.

....used in this paper. Another verification technique, based on the so called schedulerluck games, is presented in [14] Other work is based on the extension of model checking techniques to the probabilistic case [32, 19,10] and on the extension of predicate transformers to the probabilistic case [27]. Prior to the algorithm of Aspnes and Herlihy, the best known randomized algorithm for consensus with shared memory was due to Abrahamson [1] The algorithm has exponential expected running time. The algorithm of Aspnes and Herlihy was improved by Attiya, Dolev, and Shavit [7] by eliminating the ....

C. Morgan, A. McIver, K. Seidel: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3): 325353 (1996)

....and Conjunctivity are proved as well. Keywords: Weakest Precondition, Operational Semantics, Formal Verification, Coq 1 Introduction The weakest precondition, wp, proposed by E. W. Dijkstra [5] proved to be useful in various areas of software development and has been investigated extensively [1, 13, 12]. There have been a number of attempts to support wp and refinement calculus with computer assisted reasoning systems such as HOL [16, 19, 9] Isabelle [14, 17, 18] Ergo [3] PVS [8] and Alf [10] Unfortunately, among these works, only Laibinis and Wright [9] deals with general recursion. In ....

C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403--419, July 1988.

....sections is concerned with program re nements of distributed or concurrent programs. 5 An overview of some existing work on re nements 5. 1 The re nement calculus The re nement calculus originates with Ralph Back [Bac78, Bac80] and was reintroduced by Joseph Morris [Mor89] and Carrol Morgan [Mor88, MG90, Mor90]. The calculus provides a framework for systematic program development. The main idea behind the re nement calculus is considering both speci cations and code to be programs. A notion of re nement is then de ned on these programs as a re exive and transitive relation that preserves total ....

C. Morgan. The speci cation statement. ACM Transactions on Programming Languages and Systems, 10(3), 1988.

....at execution time, so the run time overhead is serious. Researches exist in which pointer and array variables are statically analyzed [6, 7] Much of this research tries to statically determine possible aliases of pointer variables and array elements, but these still remain the uncertain cases [16]. Since our dependence cache slicing uses dynamic information, we can get reasonable slice precision with affordable execution overhead. In [3] a constrained slice, which is a generalization of static and dynamic slices, is proposed. This method takes a subset of the inputs of the program as a ....

Ramalingam, G.: The Undecidability of Aliasing, ACM Transactions on Programming Languages and Systems, Vol. 16, No. 5, pp. 1467--1471 (1994).

....stepwise refinement paradigm for the construction of parallel and distributed systems. The refinement calculus is a formalization of the stepwise refinement method of program construction. It was originally proposed by Back [2] and it has later been studied and extended by several researchers, see [17, 18] among others. In recent years data refinement within the refinement calculus has been a topic for extensive research [9, 10] Back and Sere [4, 7] have extended the refinement calculus to handle parallel algorithms as well as reactive programs. In both cases parallel and concurrent activity is ....

C. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403--419, July 1988.

....which supports distributed object oriented computation and Oblets [BN96] which are written in Oblique and which have a family of Web browsers capable of running Oblets. We reason about OO action systems in the refinement calculus framework [Bac90] The refinement calculus and related calculi [Mor88, Mor87] have become popular foundations for program construction and for reasoning about specifications and implementations that meet their specifications. The refinement calculus uses weakest precondition predicate transformers as the semantic basis. Also Naumann [Nau94] uses predicate transformers to ....

C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems 10:3, pages 403--419, 1988.

....form the distribution of the processes and data links on a network. But the algorithm of each process contain explicit communication primitives. Hayes et al. [18] working on MLP (Mixed Language Programming) proposes using remote procedure calls (RPC s) by export import of procedure names. Purtilo [19] proposed a software bus system (Polylith) also allowing independence between configuration (which he calls Application structure ) and algorithms (which he calls individual components ) The specification of how components or modules communicate is claimed to be independent of the component ....

"The Polylith Software Bus", J.M. Purtilo, ACM Transactions on Programming Languages and Systems, Vol 16 No. 1, pp 151 - 174, 1994

No context found.

J. M. Purtilo: The Polylith Software Bus. ACM Transactions on Programming Languages and Systems, 16(1), 1994

No context found.

J. M. Purtilo: The Polylith Software Bus, ACM Transactions on Programming Languages and Systems, January 1994

No context found.

C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.

No context found.

C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325--353, May 1996.

No context found.

C. C. Morgan, A. K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.

....a precise polynomial time verification algorithm for shallow programs. Main Results The main complexity results established in this paper are as follows (in all cases, we assume that programs are shallow) In the presence of recursive data structures, typestate verification is undecidable [19, 24]. s0 : x : new ( s1 : y : new ( z : y; y.close( z : x; s2 : z.read( while ( s4 : f.read( f.close( Fig. 1. Program fragments illustrating the effect of aliasing on typestate verification. Verification is in P for omission closed properties: a property is ....

G. Ramalingam. The undecidability of aliasing. ACM Transactions on Programming Languages and Systems, 16(5):1467--1471, 1994.

.... these architectural approaches have consistently failed to address the relationship between the abstract architectural models and concrete system implementations [ 16] On the other hand, a number of software interoperability technologies have emerged primarily, though not exclusively (e.g. [11,22,25]) from industry [27,32,35] These technologies provide solutions for composing implementation level, coarse grain software components, giving developers powerful system building tools. However, although it has been shown that they indeed influence the architectural characteristics of systems [4] ....

J. Purtilo. The Polylith Software Bus. ACM Transactions on Programming Languages and Systems, January 1994.

No context found.

C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403--419, July 1988.

No context found.

C. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10:403--419, 1988.

No context found.

C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, 1996.

No context found.

PURTILO, J. M. The Polylith Software Bus. ACM Transactions on Programming Languages and Systems (TOPLAS) 16, 1 (January 1994), 154--174.

No context found.

C. C. Morgan. The speci cation statement. ACM Transactions on Programming Languages and Systems, 10(3), Jul 1988.

No context found.

C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 8(1):1-30, January 1999.

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