scholarly journals Type Checking Privacy Policies in the π-calculus

2015 ◽  
pp. 181-195 ◽  
Author(s):  
Dimitrios Kouzapas ◽  
Anna Philippou
Keyword(s):  
Privacy Policies ◽  
Type Checking ◽  
Π Calculus

scholarly journals Region analysis and a π-calculus with groups

2002 ◽  
Vol 12 (3) ◽  
pp. 229-292 ◽  
Author(s):  
SILVANO DAL ZILIO ◽  
ANDREW D. GORDON
Keyword(s):  
Memory Management ◽  
Garbage Collection ◽  
Dynamic Semantics ◽  
Type Checking ◽  
Effect Analysis ◽  
Π Calculus ◽  
Type Preservation ◽  
New Formulation ◽  
Preservation Property ◽  
Ambient Calculus

We show that the typed region calculus of Tofte and Talpin can be encoded in a typed π-calculus equipped with name groups and a novel effect analysis. In the region calculus, each boxed value has a statically determined region in which it is stored. Regions are allocated and de-allocated according to a stack discipline, thus improving memory management. The idea of name groups arose in the typed ambient calculus of Cardelli, Ghelli, and Gordon. There, and in our π-calculus, each name has a statically determined group to which it belongs. Groups allow for type-checking of certain mobility properties, as well as effect analyses. Our encoding makes precise the intuitive correspondence between regions and groups. We propose a new formulation of the type preservation property of the region calculus, which avoids Tofte and Talpin's rather elaborate co-inductive formulation. We prove the encoding preserves the static and dynamic semantics of the region calculus. Our proof of the correctness of region de-allocation shows it to be a specific instance of a general garbage collection principle for the π-calculus with effects. We propose new equational laws for letregion, analogous to scope mobility laws in the π-calculus, and show them sound in our semantics.

Student Perceptions of Facebook’s Privacy Policies & Rights

2015 ◽  
Vol 2 (1) ◽  
pp. 15-26
Author(s):  
Christina L. Wissinger ◽  
Keyword(s):  
Student Perceptions ◽  
Privacy Policies

Lower Bounds on Type Checking Overloading

1996 ◽  
Author(s):  
Dennis M. Volpano
Keyword(s):  
Lower Bounds ◽  
Type Checking

scholarly journals Coq Coq correct! verification of type checking and erasure for Coq, in Coq

2020 ◽  
Vol 4 (POPL) ◽  
pp. 1-28 ◽  
Author(s):  
Matthieu Sozeau ◽  
Simon Boulier ◽  
Yannick Forster ◽  
Nicolas Tabareau ◽  
Théo Winterhalter
Keyword(s):  
Type Checking

A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust

2021 ◽  
Vol 43 (1) ◽  
pp. 1-73
Author(s):  
David J. Pearce
Keyword(s):  
Memory Management ◽  
Programming Model ◽  
Type System ◽  
Control Flow ◽  
Two Phase ◽  
Type Checking ◽  
Strong Focus ◽  
Reference Implementation ◽  
Two Phases ◽  
Complex Features

Rust is a relatively new programming language that has gained significant traction since its v1.0 release in 2015. Rust aims to be a systems language that competes with C/C++. A claimed advantage of Rust is a strong focus on memory safety without garbage collection. This is primarily achieved through two concepts, namely, reference lifetimes and borrowing . Both of these are well-known ideas stemming from the literature on region-based memory management and linearity / uniqueness . Rust brings both of these ideas together to form a coherent programming model. Furthermore, Rust has a strong focus on stack-allocated data and, like C/C++ but unlike Java, permits references to local variables. Type checking in Rust can be viewed as a two-phase process: First, a traditional type checker operates in a flow-insensitive fashion; second, a borrow checker enforces an ownership invariant using a flow-sensitive analysis. In this article, we present a lightweight formalism that captures these two phases using a flow-sensitive type system that enforces “ type and borrow safety .” In particular, programs that are type and borrow safe will not attempt to dereference dangling pointers. Our calculus core captures many aspects of Rust, including copy- and move-semantics, mutable borrowing, reborrowing, partial moves, and lifetimes. In particular, it remains sufficiently lightweight to be easily digested and understood and, we argue, still captures the salient aspects of reference lifetimes and borrowing. Furthermore, extensions to the core can easily add more complex features (e.g., control-flow, tuples, method invocation). We provide a soundness proof to verify our key claims of the calculus. We also provide a reference implementation in Java with which we have model checked our calculus using over 500B input programs. We have also fuzz tested the Rust compiler using our calculus against 2B programs and, to date, found one confirmed compiler bug and several other possible issues.

Problematic Privacy Policies of Voice Assistant Applications

2021 ◽  
pp. 2-9
Author(s):  
Song Liao ◽  
Christin Wilson ◽  
Cheng Long ◽  
Hongxin Hu ◽  
Huixing Deng
Keyword(s):  
Privacy Policies
Sign in / Sign up

Export Citation Format

Share Document