Formalising Java RMI with explicit code mobility

Ahern, Alexander; Yoshida, Nobuko

doi:10.1016/j.tcs.2007.09.002

Cited by 9 publications

(2 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 Here and in the following we use to denote the empty string, so we get either y Local @x j or y@x j . …”

Section: Reduction Rulesmentioning

confidence: 99%

“…For the purpose of the present paper it is enough to consider elements of a partially ordered set with a bottom element as security levels instead of elements of a lattice as usual [20], this choice being justified by the fact that we do not use meets and joins. We formalize the network properties assured by our type system using the notions of network invariant and initial network as in [3].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Security types for dynamic web data

Dezani‐Ciancaglini

Ghilezan

Pantovi

et al. 2008

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tWe describe a type system for the Xdπ calculus of Gardner and Maffeis. An Xdπ-network is a network of locations, where each location consists of both a data tree (which contains scripts and pointers to nodes in trees at different locations) and a process, for modeling process interaction, process migration and interaction between processes and data. Our type system is based on types for locations, data and processes, expressing security levels. A tree can store data of different security level, independently from the security level of the enclosing location. The access and mobility rights of a process depend on the security level of the "source" location of the process itself, i.e. of the location where the process was in the initial network or where the process was created by the activation of a script. The type system enjoys type preservation under reduction (subject reduction). In consequence of subject reduction we prove the following security properties. In a well-typed Xdπ-network, a process P whose source location is of level h can copy data of security level at most h and update data of security level less than h. Moreover, the process P can only communicate data and go to locations of security level equal or less than h.

show abstract

“…3 Here and in the following we use to denote the empty string, so we get either y Local @x j or y@x j . …”

Section: Reduction Rulesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Security types for dynamic web data

Dezani‐Ciancaglini

Ghilezan

Pantovi

et al. 2008

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

Compositional Reasoning about Shared Futures

Din

Dovland

Owe

2012

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Compositional reasoning about active objects with shared futures

Din

Owe

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

Distributed and concurrent object-oriented systems are difficult to analyze due to the complexity of their concurrency, communication, and synchronization mechanisms. The future mechanism extends the traditional method call communication model by facilitating sharing of references to futures. By assigning method call result values to futures, third party objects may pick up these values. This may reduce the time spent waiting for replies in a distributed environment. However, futures add a level of complexity to program analysis, as the program semantics becomes more involved. This paper presents a model for asynchronously communicating objects, where return values from method calls are handled by futures. The model facilitates invariant specifications over the locally visible communication history of each object. Compositional reasoning is supported and proved sound, as each object may be specified and verified independently of its environment. A kernel object-oriented language with futures inspired by the ABS modeling language is considered. A compositional proof system for this language is presented, formulated within dynamic logic.

show abstract

Formalising Java RMI with explicit code mobility

Cited by 9 publications

References 37 publications

Security types for dynamic web data

Security types for dynamic web data

Compositional Reasoning about Shared Futures

Compositional reasoning about active objects with shared futures

Contact Info

Product

Resources

About