A Parallel Abstract Machine for the RPC Calculus

Narita, Kensuke; Nishizaki, Shin-ya

doi:10.1007/978-3-642-25462-8_28

Cited by 11 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Paper [9], we proposed a parallel abstract machine for the call-by-value RPC calculus. Design of a parallel abstract machine for the call-by-name RPC calculus is one of the most interesting research direction of this work.…”

Section: Resultsmentioning

confidence: 99%

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Watanabe¹,

Nishizaki²

2017

JSW

Self Cite

View full text Add to dashboard Cite

A remote procedure call (RPC) is a network communication technique between distributed computers. RPC is more approachable than the other network communication techniques since a programmer can use it in a similar manner to a procedure call in a sequential program on a single CPU computer. Cooper and Wadler proposed the RPC calculus and formalized the remote procedure call in the style of the lambda calculus. They used the call-by-value evaluation strategy for the RPC calculus. We may say that the RPC calculus is an extension of the traditional call-by-value lambda calculus by attaching a location. In the previous work, we developed a big-step semantics of the call-by-name RPC calculus and studied the translation of the call-by-name RPC calculus into the call-by name RMI calculus, in order to show the expressive power of the RMI calculus. In this paper, we newly propose a small-step semantics of the call-by-name RPC calculus. We prove the equivalence between the small-step and big-step semantics.

show abstract

Section: Resultsmentioning

confidence: 99%

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Watanabe¹,

Nishizaki²

2017

JSW

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, the abstract machine semantics [11]- [13]. The compatibility of the regular expression binding with the other programming paradigm such as object-oriented programming [14]- [16].…”

Section: Discussionmentioning

confidence: 99%

Let-Binding with Regular Expressions in Lambda Calculus

Ohata¹,

Nishizaki²

2016

JSW

Self Cite

View full text Add to dashboard Cite

Abstract:We often give proper names to variables in programs based on their types, usages, and means, and the regularity and there are several kinds of conventions for variable-naming in programming languages.For example, we use variables i, j, k or i1, i2, i3 for thevariables of integer type. In this paper, we propose let-binding mechanism by which you can declare multiple variables simultaneously using regular expressions. We formalize this variable binding mechanism in the framework of the lambda calculus: we propose a lambda calculus with the regular expression let-bindings and a simple type system to the calculus in the style of Curry. We then study the calculus and the type system from the theoretical viewpoint.

show abstract

“…Our semantics for remote procedure calls is inspired by the Location-aware Simple Abstract Machine (LSAM) [38]. A global LSAM configuration is a set of local LSAM configurations indexed by names, and remote procedure calls are performed by suspending the computation and transferring control to another local LSAM configuration.…”

Section: Rpcs and Distributed Computationmentioning

confidence: 99%

Programming with Flow-Limited Authorization: Coarser is Better

Pedersen

Chong

2019

2019 IEEE European Symposium on Security and Privacy (EuroS&P)

View full text Add to dashboard Cite

Applications that handle sensitive information need to express and reason about the trust relationships between security principals. Such reasoning is difficult because the trust relationships are dynamic, and must thus be reasoned about at runtime when discovering and reasoning about trust relationships might inadvertently reveal confidential information and be subject to manipulation by untrusted principals. The Flow-Limited Authorization Model (FLAM) by Arden et al. exactly meets these needs. However, previous attempts to use FLAM in a programming language have not reaped the full benefits of the model. We present Flamio, an instantiation of FLAM in a language with coarse-grained dynamic information-flow control (IFC) which naturally lends itself to dynamic enforcement techniques. In our implementation of Flamio, the FLAM proof search rules for deriving trust relationships are implemented as regular Flamio computations: the IFC requirements for FLAM proof rules are a natural fit with coarse-grained information-flow mechanisms. Flamio even supports remote procedure calls, and thus seamlessly supports FLAM's distributed proof search. We have implemented Flamio as a Haskell library, and proved that a calculus based on Flamio enforces a noninterference-based security guarantee. We have implemented several case studies, demonstrating the expressiveness and usefulness of Flamio in distributed settings, as well as our novel approach to control label creep during proof search.

show abstract

A Parallel Abstract Machine for the RPC Calculus

Cited by 11 publications

References 9 publications

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Let-Binding with Regular Expressions in Lambda Calculus

Programming with Flow-Limited Authorization: Coarser is Better

Contact Info

Product

Resources

About