Separation Logic in the Presence of Garbage Collection

2011 ◽  
Author(s):  
Chung-Kil Hur ◽  
Derek Dreyer ◽  
Viktor Vafeiadis
Keyword(s):  
Garbage Collection ◽  
Separation Logic

Some remarks on new instances and garbage collection

1977 ◽  
Vol 12 (6) ◽  
pp. 42-48
Author(s):  
Péter Szöke
Keyword(s):  
Garbage Collection

Two-tier garbage collection for persistent object

2020 ◽  
Author(s):  
Dokeun Lee ◽  
Youjip Won ◽  
Yongjun Park ◽  
Seongjin Lee
Keyword(s):  
Garbage Collection

Using generational garbage collection to implement cache-conscious data placement

1999 ◽  
Vol 34 (3) ◽  
pp. 37-48 ◽  
Author(s):  
Trishul M. Chilimbi ◽  
James R. Larus
Keyword(s):  
Garbage Collection ◽  
Data Placement

scholarly journals Linear capabilities for fully abstract compilation of separation-logic-verified code

2021 ◽  
Vol 31 ◽  
Author(s):  
THOMAS VAN STRYDONCK ◽  
FRANK PIESSENS ◽  
DOMINIQUE DEVRIESE
Keyword(s):  
Spatial Separation ◽  
Separation Logic ◽  
Target Language ◽  
Fine Grained ◽  
Dynamic Contract ◽  
Modular Verification ◽  
Source Program ◽  
Memory Accesses ◽  
Memory Resources ◽  
Efficient Memory

Abstract Separation logic is a powerful program logic for the static modular verification of imperative programs. However, dynamic checking of separation logic contracts on the boundaries between verified and untrusted modules is hard because it requires one to enforce (among other things) that outcalls from a verified to an untrusted module do not access memory resources currently owned by the verified module. This paper proposes an approach to dynamic contract checking by relying on support for capabilities, a well-studied form of unforgeable memory pointers that enables fine-grained, efficient memory access control. More specifically, we rely on a form of capabilities called linear capabilities for which the hardware enforces that they cannot be copied. We formalize our approach as a fully abstract compiler from a statically verified source language to an unverified target language with support for linear capabilities. The key insight behind our compiler is that memory resources described by spatial separation logic predicates can be represented at run time by linear capabilities. The compiler is separation-logic-proof-directed: it uses the separation logic proof of the source program to determine how memory accesses in the source program should be compiled to linear capability accesses in the target program. The full abstraction property of the compiler essentially guarantees that compiled verified modules can interact with untrusted target language modules as if they were compiled from verified code as well. This article is an extended version of one that was presented at ICFP 2019 (Van Strydonck et al., 2019).

Support for garbage collection at every instruction in a Java compiler

1999 ◽  
Vol 34 (5) ◽  
pp. 118-127
Author(s):  
James M. Stichnoth ◽  
Guei-Yuan Lueh ◽  
Michał Cierniak
Keyword(s):  
Garbage Collection

scholarly journals Cosmo: a concurrent separation logic for multicore OCaml

2020 ◽  
Vol 4 (ICFP) ◽  
pp. 1-29
Author(s):  
Glen Mével ◽  
Jacques-Henri Jourdan ◽  
François Pottier
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic

scholarly journals Dusty caches for reference counting garbage collection

2006 ◽  
Vol 34 (1) ◽  
pp. 3-10 ◽  
Author(s):  
Scott Friedman ◽  
Praveen Krishnamurthy ◽  
Roger Chamberlain ◽  
Ron K. Cytron ◽  
Jason E. Fritts
Keyword(s):  
Garbage Collection ◽  
Reference Counting

scholarly journals IoT Based Smart Garbage Collection Using RFID Andsensors

2021 ◽  
Vol 1818 (1) ◽  
pp. 012225
Author(s):  
P. Ranjana ◽  
S Varsha ◽  
Sherin Eliyas
Keyword(s):  
Garbage Collection
Sign in / Sign up

Export Citation Format

Share Document