A Translation Method of ARM Machine Code to LLVM-IR for Binary Code Parallelization and Optimization

ALMA versus DDD

Computer Science and Information Systems ◽

10.2298/csis0802119d ◽

2008 ◽

Vol 5 (2) ◽

pp. 119-136

Author(s):

Cruz da ◽

Pedro Henriques ◽

Maria Pereira

Keyword(s):

No Value ◽

Binary Code ◽

Main Idea ◽

Value Added ◽

Program Comprehension ◽

Conceptual Level ◽

Machine Code ◽

Abstract Representation ◽

Source Program

To be a debugger is a good thing! Since the very beginning of the programming activity, debuggers are the most important and widely used tools after editors and compilers; we completely recognize their importance for software development and testing. Debuggers work at machine level, after the compilation of the source program; they deal with assembly, or binary-code, and are mainly data structure inspectors. ALMA is a program animator based on its abstract representation. The main idea is to show the algorithm being implemented by the program, independently from the language used to implement it. To say that ALMA is a debugger, with no value added, is not true! ALMA is a source code inspector but it deals with programming concepts instead of machine code. This makes possible to understand the source program at a conceptual level, and not only to fix run time errors. In this paper we compare our visualizer/animator system, ALMA, with one of the most well-known and used debuggers, the graphical version of GDB, the DDD program. The aim of the paper is twofold: the immediate objective is to prove that ALMA provides new features that are not usually offered by debuggers; the main contribution is to recall the concepts of debugger and animator, and clarify the role of both tools in the field of program understanding, or program comprehension. .

Download Full-text

cake_lpr: Verified Propagation Redundancy Checking in CakeML

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-030-72013-1_12 ◽

2021 ◽

pp. 223-241

Author(s):

Yong Kiam Tan ◽

Marijn J. H. Heule ◽

Magnus O. Myreen

Keyword(s):

Binary Code ◽

State Of The Art ◽

Trusted Computing ◽

Proof System ◽

Efficiency Gains ◽

Machine Code ◽

Proof Validation ◽

Proof Checker ◽

Trusted Computing Base ◽

Checkable Proof

AbstractModern SAT solvers can emit independently checkable proof certificates to validate their results. The state-of-the-art proof system that allows for compact proof certificates is propagation redundancy (PR). However, the only existing method to validate proofs in this system with a formally verified tool requires a transformation to a weaker proof system, which can result in a significant blowup in the size of the proof and increased proof validation time. This paper describes the first approach to formally verify PR proofs on a succinct representation; we present (i) a new Linear PR (LPR) proof format, (ii) a tool to efficiently convert PR proofs into LPR format, and (iii) , a verified LPR proof checker developed in CakeML. The LPR format is backwards compatible with the existing LRAT format, but extends the latter with support for the addition of PR clauses. Moreover, is verified using CakeML ’s binary code extraction toolchain, which yields correctness guarantees for its machine code (binary) implementation. This further distinguishes our clausal proof checker from existing ones because unverified extraction and compilation tools are removed from its trusted computing base. We experimentally show that LPR provides efficiency gains over existing proof formats and that the strong correctness guarantees are obtained without significant sacrifice in the performance of the verified executable.

Download Full-text

Handling of Inter-Thread Memory Access Dependencies for Automatic Binary-Code Parallelization

Parallel and Distributed Computing and Networks / 720: Software Engineering ◽

10.2316/p.2011.719-061 ◽

2011 ◽

Author(s):

Kanemitsu Ootsu ◽

Takashi Shiroto ◽

Takashi Yokota ◽

Takanobu Baba

Keyword(s):

Binary Code ◽

Memory Access ◽

Code Parallelization

Download Full-text

Seven Stories of Threatening Speech: Women’s Suffrage Meets Machine Code Ruth A. Miller (2012) Ann Arbor, MI: University of Michigan Press, 289pp.

Gender and Language ◽

10.1558/genl.v9i1.17370 ◽

2014 ◽

Vol 9 (1) ◽

pp. 137-140

Author(s):

Perry Maxfield Waldman Sherouse

Keyword(s):

Women's Suffrage ◽

University Of Michigan ◽

Machine Code ◽

Ann Arbor ◽

Women’S Suffrage

Download Full-text

The Direct Method

10.31227/osf.io/fy42v ◽

2017 ◽

Author(s):

Purwarno

Keyword(s):

Second Language ◽

Foreign Language ◽

Direct Method ◽

Target Language ◽

Translation Method ◽

Grammar Translation Method

The Direct Method was the outcome of a reaction against the Grammar Translation Method. It was based on the assumption that the learner of a foreign language should think directly in the target language. According to this method, English is taught through English. The learner learns the target language through discussion, conversation and reading in the second language. It does not take recourse to translation and foreign grammar.

Download Full-text