Flow2Vec: value-flow-based precise code embedding

نویسندگان
چکیده

منابع مشابه

Embedding Value-based Organization: an Identification

The recent discourse on modernizing organizations and leadership has often placed a strong emphasis on values and ethics. This article elaborates on the benefits and challenges in the integration of values into leadership and organizational actions, most notably in regards to appraisals of values-based leadership (VBL). It is proposed that if the critical success factors and the challenges in i...

متن کامل

Embedding Foreign Code

Special purpose embedded languages facilitate generating high-performance code from purely functional high-level code; for example, we want to program highly parallel GPUs without the usual high barrier to entry and the time-consuming development process. We previously demonstrated the feasibility of a skeleton-based, generative approach to compiling such embedded languages. In this paper, we (...

متن کامل

Embedding Foreign Code [DRAFT]

Special purpose embedded languages facilitate generating high-performance code from purely functional high-level code; for example, we want to program highly parallel GPUs without the usual high barrier to entry and the time-consuming development process. We previously demonstrated the feasibility of a skeleton-based, generative approach to compiling such embedded languages. In this paper, we (...

متن کامل

Improving success probability and embedding efficiency in code based steganography

For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail. We propose a method to ensure or increase the probability of embedding success for these stegoschemes. This method is based on puncturing codes. We show how the use of punctured codes may also increase the embedding ...

متن کامل

Embedding in a perfect code

For any 1-error-correcting binary code C of length m we will construct a 1-perfect binary code P (C) of length n = 2 − 1 such that fixing the last n − m coordinates by zeroes in P (C) gives C. In particular, any complete or partial Steiner triple system (or any other system that forms a 1-code) can always be embedded in a 1-perfect code of some length (compare with [13]). Since the weight-3 wor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on Programming Languages

سال: 2020

ISSN: 2475-1421

DOI: 10.1145/3428301