A linear type system for multicore programming in ATS

Shi, Rui; Xi, Hongwei

doi:10.1016/j.scico.2012.09.005

Cited by 11 publications

(12 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cervesato and Pfenning [1996] developed the first logical framework supporting linear type theory and dependent types. Shi and Xi [2013] propose using linear types on top of ATS, their dependently typed language for developing provably correct code. F * [Swamy et al 2013] is a language that includes linear types and value dependent types.…”

Section: Related Workmentioning

confidence: 99%

Label-dependent session types

Thiemann

Vasconcelos

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Session types have emerged as a typing discipline for communication protocols. Existing calculi with session types come equipped with many different primitives that combine communication with the introduction or elimination of the transmitted value.We present a foundational session type calculus with a lightweight operational semantics. It fully decouples communication from the introduction and elimination of data and thus features a single communication reduction, which acts as a rendezvous between senders and receivers. We achieve this decoupling by introducing label-dependent session types, a minimalist value-dependent session type system with subtyping. The system is sufficiently powerful to simulate existing functional session type systems. Compared to such systems, label-dependent session types place fewer restrictions on the code. We further introduce primitive recursion over natural numbers at the type level, thus allowing to describe protocols whose behaviour depends on numbers exchanged in messages. An algorithmic type checking system is introduced and proved equivalent to its declarative counterpart. The new calculus showcases a novel lightweight integration of dependent types and linear typing, with has uses beyond session type systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Label-dependent session types

Thiemann

Vasconcelos

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Moreover, the typing rules of ATS guarantees that the evaluation process, except for invocations of those constant functions (a.k.a. ad hoc reduction in (Shi and Xi, 2009)), neither produces nor consumes any linear resources (linear proof in the example here). Therefore, when evaluating a well-typed program using these constant functions, it is impossible to have two linear proofs of the same view , thus there is no issue of pointer-alias common in C programming language.…”

Section: Linear Typesmentioning

confidence: 99%

“…In this way, a model in ATS/PML can be mapped to a model in PROMELA, and the later defines the semantics of the former. Note that with such setting, the semantics of ATS/PML bears strong resemblance to the semantics of ATS in the multi-core setting (Shi and Xi, 2009). The mapping rules are designed to ensure that the syntactic typing rules of ATS/PML, inherited intactly from ATS is compatible with the semantics of ATS/PML, which in turn roots in the semantics of PROMELA.…”

Section: From Ats To Ats/pmlmentioning

confidence: 99%

“…The type system of ATS is developed gradually, starting from its initial support of dependent types (Xi, 1998) (Xi and Pfenning, 1999) (Xi, 2007), to the addition of guarded recursive datatypes (Xi et al, 2003), to the accommodation of linear types (Zhu and Xi, 2005) (Shi and Xi, 2009) , and later to the adoption of Programming with Theorem Proving (Chen and Xi, 2005). Formal development of the mathematical proof for the type soundness property was conveyed in multiple researches, each of which targets certain newly added types it focuses.…”

Section: Introduction Of Atsmentioning

confidence: 99%

See 1 more Smart Citation

Combining type-checking with model-checking for system verification

Ren

2016

2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)

Self Cite

View full text Add to dashboard Cite

Type checking is widely used in mainstream programming languages to detect programming errors at compile time. Model checking is gaining popularity as an automated technique for systematically analyzing behaviors of systems. My research focuses on combining these two software verification techniques synergically into one platform for the creation of correct models for software designs. This thesis describes two modeling languages ATS/PML and ATS/Veri that inherit the advanced type system from an existing programming language ATS, in which both dependent types of Dependent ML style and linear types are supported. A detailed discussion is given for the usage of advanced types to detect modeling errors at the stage of model construction. Going further, various modeling primitives with well-designed types are introduced into my modeling languages to facilitate a synergic combination of type checking with model checking. The semantics of ATS/PML is designed to be directly rooted in a well-known modeling language PROMELA. Rules for translation from ATS/PML to PROMELA are designed and a compiler is developed accordingly so that the SPIN model checker can v be readily employed to perform checking on models constructed in ATS/PML. AT-S/Veri is designed to be a modeling language, which allows a programmer to construct models for real-world multi-threaded software applications in the same way as writing a functional program with support for synchronization, communication, and scheduling among threads. Semantics of ATS/Veri is formally defined for the development of corresponding model checkers and a compiler is built to translate ATS/Veri into CSP# and exploit the state-of-the-art verification platform PAT for model checking ATS/Veri models. The correctness of such a transformational approach is illustrated based on the semantics of ATS/Veri and CSP#. In summary, the primary contribution of this thesis lies in the creation of a family of modeling languages with highly expressive types for modeling concurrent software systems as well as the related platform supporting verification via model checking. As such, we can combine type checking and model checking synergically to ensure software correctness with high confidence. vi

show abstract

“…Dengping Zhu and Hongwei Xi [23] describe resources use a light-weighted formal method to support safe programming with pointers. R. Shi and H. Xi [24] present an approach to safe multi-core programming in ATS. They formalize a type system that can guarantee safe manipulation of resources on multi-core machines.…”

Section: The Description Of Physical Resourcesmentioning

confidence: 99%