No Citizenship for Ruth? Names as Access Permissions in the Scroll of Ruth

2021 ◽  
pp. 245-272
Author(s):  
Karl-Heinrich Ostmeyer
Keyword(s):  
Access Permissions

scholarly journals A concurrent constraint programming interpretation of access permissions

2018 ◽  
Vol 18 (2) ◽  
pp. 252-295
Author(s):  
CARLOS OLARTE ◽  
ELAINE PIMENTEL ◽  
CAMILO RUEDA
Keyword(s):  
Programming Languages ◽  
Linear Logic ◽  
Object Oriented Programming ◽  
Theorem Prover ◽  
Deadlock Detection ◽  
Program Correctness ◽  
Detection Program ◽  
Mutable State ◽  
Verification Techniques ◽  
Access Permissions

AbstractA recent trend in object-oriented programming languages is the use of access permissions (APs) as an abstraction for controlling concurrent executions of programs. The use of AP source code annotations defines a protocol specifying how object references can access the mutable state of objects. Although the use of APs simplifies the task of writing concurrent code, an unsystematic use of them can lead to subtle problems. This paper presents a declarative interpretation of APs as linear concurrent constraint programs (lcc). We represent APs as constraints (i.e., formulas in logic) in an underlying constraint system whose entailment relation models the transformation rules of APs. Moreover, we use processes inlccto model the dependencies imposed by APs, thus allowing the faithful representation of their flow in the program. We verify relevant properties about AP programs by taking advantage of the interpretation oflccprocesses as formulas in Girard's intuitionistic linear logic (ILL). Properties include deadlock detection, program correctness (whether programs adhere to their AP specifications or not), and the ability of methods to run concurrently. By relying on a focusing discipline for ILL, we provide a complexity measure for proofs of the above-mentioned properties. The effectiveness of our verification techniques is demonstrated by implementing the Alcove tool that includes an animator and a verifier. The former executes thelccmodel, observing the flow of APs, and quickly finding inconsistencies of the APs vis-à-vis the implementation. The latter is an automatic theorem prover based on ILL.

scholarly journals Strategy based semantics for mobility with time and access permissions

2014 ◽  
Vol 27 (3) ◽  
pp. 525-549 ◽  
Author(s):  
Gabriel Ciobanu ◽  
Maciej Koutny ◽  
Jason Steggles
Keyword(s):  
Access Permissions

scholarly journals Concise Read-Only Specifications for Better Synthesis of Programs with Pointers

2020 ◽  
pp. 141-168
Author(s):  
Andreea Costea ◽  
Amy Zhu ◽  
Nadia Polikarpova ◽  
Ilya Sergey
Keyword(s):  
Quantitative Evaluation ◽  
Program Synthesis ◽  
Separation Logic ◽  
Memory Access ◽  
Trade Off ◽  
Formal Treatment ◽  
Search Heuristic ◽  
Access Permissions

AbstractIn program synthesis there is a well-known trade-off between concise and strong specifications: if a specification is too verbose, it might be harder to write than the program; if it is too weak, the synthesised program might not match the user’s intent. In this work we explore the use of annotations for restricting memory access permissions in program synthesis, and show that they can make specifications much stronger while remaining surprisingly concise. Specifically, we enhance Synthetic Separation Logic (SSL), a framework for synthesis of heap-manipulating programs, with the logical mechanism of read-only borrows.We observe that this minimalistic and conservative SSL extension benefits the synthesis in several ways, making it more (a) expressive (stronger correctness guarantees are achieved with a modest annotation overhead), (b) effective (it produces more concise and easier-to-read programs), (c) efficient (faster synthesis), and (d) robust (synthesis efficiency is less affected by the choice of the search heuristic). We explain the intuition and provide formal treatment for read-only borrows. We substantiate the claims (a)–(d) by describing our quantitative evaluation of the borrowing-aware synthesis implementation on a series of standard benchmark specifications for various heap-manipulating programs.

scholarly journals Polymorphic Access Permissions

2010 ◽  
Author(s):  
Nels E. Beckman ◽  
Jonathan Aldrich
Keyword(s):  
Access Permissions

scholarly journals CoMeT: Configurable Tagged Memory Extension

Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7771
Author(s):  
Jinjae Lee ◽  
Derry Pratama ◽  
Minjae Kim ◽  
Howon Kim ◽  
Donghyun Kwon
Keyword(s):  
Memory Access ◽  
Instruction Set ◽  
Security Issues ◽  
Processor Architectures ◽  
Instruction Set Extension ◽  
Instruction Set Extensions ◽  
Access Permissions

Commodity processor architectures are releasing various instruction set extensions to support security solutions for the efficient mitigation of memory vulnerabilities. Among them, tagged memory extension (TME), such as ARM MTE and SPARC ADI, can prevent unauthorized memory access by utilizing tagged memory. However, our analysis found that TME has performance and security issues in practical use. To alleviate these, in this paper, we propose CoMeT, a new instruction set extension for tagged memory. The key idea behind CoMeT is not only to check whether the tag values in the address tag and memory tag are matched, but also to check the access permissions for each tag value. We implemented the prototype of CoMeT on the RISC-V platform. Our evaluation results confirm that CoMeT can be utilized to efficiently implement well-known security solutions, i.e., shadow stack and in-process isolation, without compromising security.

Sign in / Sign up

Export Citation Format

Share Document