Session-Based Compilation Framework for Multicore Programming

Yoshida, Nobuko; Vasconcelos, Vasco T.; Paulino, Hervé; Honda, Kohei

doi:10.1007/978-3-642-04167-9_12

Cited by 17 publications

(8 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The asynchronous subtyping is not only essential for the completeness result, but it is also important in practice. As observed by Yoshida, Honda et al [52,67], implementing this subtyping is a key tool for maximising message-overlapping in the high-performance computing environments. To explain the usefulness of the asynchronous subtyping, consider:…”

Section: 3mentioning

confidence: 89%

On the Preciseness of Subtyping in Session Types

Chen

Dezani‐Ciancaglini

Yoshida

2014

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming

Self Cite

111

View full text Add to dashboard Cite

Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite of its usefulness to define the greatest subtyping relation ensuring type safety. This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi. We first prove that the well-known session subtyping, the branching-selection subtyping, is sound and complete for the synchronous calculus. Next we show that in the asynchronous calculus, this subtyping is incomplete for type-safety: that is, there exist session types T and S such that T can safely be considered as a subtype of S, but T S is not derivable by the subtyping. We then propose an asynchronous subtyping system which is sound and complete for the asynchronous calculus. The method gives a general guidance to design rigorous channel-based subtypings respecting desired safety properties.

show abstract

Section: 3mentioning

confidence: 89%

On the Preciseness of Subtyping in Session Types

Chen

Dezani‐Ciancaglini

Yoshida

2014

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming

Self Cite

111

View full text Add to dashboard Cite

show abstract

“…The framework of multiparty session types is effectively applicable to dynamic monitoring Bocchi et al, 2013) in Python for controlling messaging in a largescale cyberinfrustructure for observing oceans (OOI, 2010). Finally multiparty session types can guide writing safe, deadlock-free message-passing parallel programs: we implemented several languages and built tool-chains (Ng et al, 2012a;Ng et al, 2011;Yoshida et al, 2008;Ng et al, 2012b;Neykova et al, 2013) and a verification framework Honda et al, 2013) for high-performance computing which uses extensions of Scribble.…”

Section: Discussionmentioning

confidence: 99%

Global progress for dynamically interleaved multiparty sessions

Coppo

Dezani‐Ciancaglini

Yoshida

et al. 2014

Math. Struct. Comp. Sci.

Self Cite

115

172

View full text Add to dashboard Cite

A multiparty session forms a unit of structured communication among many participants which follow communication sequences specified as a global type. When a process is engaged in two or more sessions simultaneously, different sessions can be interleaved and can interfere at runtime. Previous work on multiparty session types has ignored session interleaving, providing a limited progress property ensured only within a single session, by assuming non-interference among different sessions and by forbidding delegation. This paper develops, besides a more traditional, compositional communication type system, a novel static interaction type system for global progress in dynamically interleaved and interfered multiparty sessions. The interaction type system infers causalities of channels making sure that processes do not get stuck at intermediate stages of sessions also in presence of delegation.

show abstract

“…High-level programming models for the Cell processor which avoid explicit DMA programming include Sequoia [24], CellSs [4], CellFS [36], Sieve C++ [16] and Offload C++ [12,17]. A formal approach along these lines involves using session types to specify communication [33,47]. Given a communications protocol expressed using session types, subtyping rules allow send/receive operations to be automatically re-ordered so that independent communications may be efficiently overlapped.…”

Section: Related Workmentioning

confidence: 99%

Automatic analysis of DMA races using model checking and k-induction

Donaldson

Kroening

Rümmer

2011

Form Methods Syst Des

View full text Add to dashboard Cite

Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small "scratch-pad" memories. The price for increased performance is higher programming complexity -the programmer must manually orchestrate data movement using direct memory access (DMA) operations. Programming using asynchronous DMA operations is error-prone, and DMA races can lead to nondeterministic bugs which are hard to reproduce and fix. We present a method for DMA race analysis in C programs. Our method works by automatically instrumenting a program with assertions modeling the semantics of a memory flow controller. The instrumented program can then be analyzed using state-of-the-art software model checkers. We show that bounded model checking is effective for detecting DMA races in buggy programs. To enable automatic verification of the correctness of instrumented programs, we present a new formulation of k-induction geared towards software, as a proof rule operating on loops. Our techniques are implemented as a tool, SCRATCH, which we apply to a large set of programs supplied with the IBM Cell SDK, in which we discover a previously unknown bug. Our experimental results indicate that our k-induction method performs extremely well on this problem class. To our knowledge, this marks both the first application of k-induction to software verification, and the first example of software model checking in the context of heterogeneous multicore processors.

show abstract

Session-Based Compilation Framework for Multicore Programming

Cited by 17 publications

References 33 publications

On the Preciseness of Subtyping in Session Types

On the Preciseness of Subtyping in Session Types

Global progress for dynamically interleaved multiparty sessions

Automatic analysis of DMA races using model checking and k-induction

Contact Info

Product

Resources

About