Constraining interference in an object-based design method

Jones, Cliff B.

doi:10.1007/3-540-56610-4_61

Cited by 28 publications

(17 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key idea is a use of the following noninterference property [24,37] to justify the correctness of these rules. Let us write N For tractable reasoning, we introduce syntactic transformation rules which satisfy the noninterference property.…”

Section: Justification For Optimisationsmentioning

confidence: 99%

Formalising Java RMI with explicit code mobility

AhernAlexander

Yoshida

2005

SIGPLAN Not.

View full text Add to dashboard Cite

This paper presents a Java-like core language with primitives for object-oriented distribution and explicit code mobility. We apply our formulation to prove the correctness of several optimisations for distributed programs. Our language captures crucial but often hidden aspects of distributed object-oriented programming, including object serialisation, dynamic class downloading and remote method invocation. It is defined in terms of an operational semantics that concisely models the behaviour of distributed programs using machinery from calculi of mobile processes. Type safety is established using invariant properties for distributed runtime configurations. We argue that primitives for explicit code mobility offer a programmer fine-grained control of type-safe code distribution, which is crucial for improving the performance and safety of distributed object-oriented applications.

show abstract

Section: Justification For Optimisationsmentioning

confidence: 99%

Formalising Java RMI with explicit code mobility

AhernAlexander

Yoshida

2005

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…In [4] a development method for concurrent programs is proposed. Central to it are the application of program transformations to control the introduction of concurrency into designs and the use of ideas from object-oriented programming to control *Supported by a grant from the U.K. Engineering and Physical Sciences Research Council interference.…”

Section: [Ntroductionmentioning

confidence: 99%

“…Central to it are the application of program transformations to control the introduction of concurrency into designs and the use of ideas from object-oriented programming to control *Supported by a grant from the U.K. Engineering and Physical Sciences Research Council interference. The problem we consider concerns two classes taken, with minor modifications, from [4] whose instances may be used to construct binary tree-structured symbol tables. The first of these is as follows.…”

Section: [Ntroductionmentioning

confidence: 99%

“…A more difficult problem is to determine general conditions under which transformations such as the movement of return statements and the replacement of return statements by commit statements illustrated in the Insert and Search methods respectively are sound. Such general transformation rules are proposed in [4]. One point of the present work is to bring to the surface some difficulties concerning tractable, general transformation rules.…”

Section: [Ntroductionmentioning

confidence: 99%

“…The programming language is a variant of the ~ro/~-language [4] class definitions are explained below. The principal syntactic entities are statements each of which is assigned a type in a standard way; we omit the details.…”

Section: 1mentioning

confidence: 99%

See 2 more Smart Citations

Confluence of processes and systems of objects

Liu

Walker

1995

TAPSOFT '95: Theory and Practice of Software Development

View full text Add to dashboard Cite

An extension to the theory of confluence in the process calculus CCS is presented. The theory is generalized to an extension of the ~r-calc~flus. This calculus is used to provide semantics by translation for a parallel object-oriented programming language. The confluence theory is applied to prove the indistinguishability in an arbitrary program context of two class defilfitions which generate binary tree data structures one of which allows concurrent operations. 1 [ntroductionThe alms of this paper are to present an extension to the theory of confluence in process cMculus and to illustrate the new theory by applying it to a problem concerning concurrent operations on binary tree data structures expressed in a parMlel object-oriented programming language. In fact, the development of the theory was stimulated by the problem. We begin by describing it.Characteristic of the object-oriented style of programming is the description of a computational system as a collection of objects each of which is a self-contained entity possessing data (references to objects and simple values) and procedures (methods) for acting on those data.. A program of a parallel object-oriented language typically consists of a collection of class definitions, each of which provides a template for its object instances, together with an indication of how a computation should be initiated. Such a program often describes a highly mobile concurrent system in which new objects are created as computation proceeds and references to objects are passed in communications. Parallel object-oriented languages differ from one another in the w~vs in which they integrate parallelism with object-oriented features; see e.g. [1,8].In [4] a development method for concurrent programs is proposed. Central to it are the application of program transformations to control the introduction of concurrency into designs and the use of ideas from object-oriented programming to control *Supported by a grant from the U.K. Engineering and Physical Sciences Research Council 218 interference. The problem we consider concerns two classes taken, with minor modifications, from [4] whose instances may be used to construct binary tree-structured symbol tables. The first of these is as follows. An object of this class represents a node which stores in its variables K~V,L,R an integer key, a value (a reference to an object of some class A) and references to two instances of the class (its left and right children in the tree structure of which it is a component). It has two actions: the method Insert which allows a key-value pair to be inserted, and the method Search which returns the value associated with its key parameter (or nil if there is none). When the expression new(T) is evaluated a new instance of the class is created; the value of the expression is a reference to that object. When an object is created all its variables have nil values and it assumes a quiescent state in which any of its methods may be invoked. On completing a method invocation an object returns to...

show abstract

Typed ?-calculus at work: A correctness proof of Jones's parallelisation transformation on concurrent objects

Sangiorgi

1999

Theory Pract. Obj. Syst.

View full text Add to dashboard Cite

Cliff Jones has proposed transformations between concrete programs and general transformation rules that increase concurrency in a system of objects, and has raised the challenge of how to prove their validity. We present a proof of correctness of the hardest of Jones's concrete transformations. The proof uses a typed π‐calculus and typed behavioral equivalences. Our type system tracks receptiveness; it guarantees that the input‐end of certain channels is always ready to receive messages (at least as long as there are processes that could send such messages), and that all messages will be processed using the same continuation. This work is also intended as an example of the usefulness of π‐calculus types for reasoning. © 1999 John Wiley & Sons, Inc.

show abstract

Constraining interference in an object-based design method

Cited by 28 publications

References 20 publications

Formalising Java RMI with explicit code mobility

Formalising Java RMI with explicit code mobility

Confluence of processes and systems of objects

Typed ?-calculus at work: A correctness proof of Jones's parallelisation transformation on concurrent objects

Contact Info

Product

Resources

About