NDLI: An improved algorithm for slicing machine code

Please wait, while we are loading the content...

A compiler for throughput optimization of graph algorithms on GPUs

Semantics-based program verifiers for all languages

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

Extensible access control with authorization contracts

Purposes, concepts, misfits, and a redesign of git

Accelerating program analyses by cross-program training

Directed synthesis of failing concurrent executions

Automatic enforcement of expressive security policies using enclaves

Semantic subtyping for imperative object-oriented languages

Efficient and thread-safe objects for dynamically-typed languages

Computing repair alternatives for malformed programs using constraint attribute grammars

A practical framework for type inference error explanation

Finding compiler bugs via live code mutation

Automatic parallelization of pure method calls via conditional future synthesis

Hoare-style specifications as correctness conditions for non-linearizable concurrent objects

Speeding up machine-code synthesis

Gentrification gone too far? affordable 2nd-class values for fun and (co-)effect

Apex: automatic programming assignment error explanation

An improved algorithm for slicing machine code

Maximal causality reduction for TSO and PSO

Chain: tasks and channels for reliable intermittent programs

Parsing with first-class derivatives

Hybrid STM/HTM for nested transactions on OpenJDK

Probabilistic model for code with decision trees

Dynamically diagnosing type errors in unsafe code

Finding resume and restart errors in Android applications

Portable inter-workgroup barrier synchronisation for GPUs

An operational semantics for C/C++11 concurrency

Automated reasoning for web page layout

Incremental forest: a DSL for efficiently managing filestores

Asserting reliable convergence for configuration management scripts

Call graphs for languages with parametric polymorphism

Precise and maximal race detection from incomplete traces

GEMs: shared-memory parallel programming for Node.js

The missing link: explaining ELF static linking, semantically

Makalu: fast recoverable allocation of non-volatile memory

Ringer: web automation by demonstration

First-class effect reflection for effect-guided programming

Low-overhead and fully automated statistical debugging with abstraction refinement

Parallel incremental whole-program optimizations for Scala.js

Modeling and analysis of remote memory access programming

FIDEX: filtering spreadsheet data using examples

LaCasa: lightweight affinity and object capabilities in Scala

Dependent partitioning

Type inference for static compilation of JavaScript

Stateless model checking with data-race preemption points

OrcO: a concurrency-first approach to objects

Type soundness for dependent object types (DOT)

Prioritized garbage collection: explicit GC support for software caches

Scalable verification of border gateway protocol configurations with an SMT solver

Java and scala's type systems are unsound: the existential crisis of null pointers

To be precise: regression aware debugging

An improved algorithm for slicing machine code

Content Provider	ACM Digital Library
Author	Reps, Thomas Srinivasan, Venkatesh
Abstract	Machine-code slicing is an important primitive for building binary analysis and rewriting tools, such as taint trackers, fault localizers, and partial evaluators. However, it is not easy to create a machine-code slicer that exhibits a high level of precision. Moreover, the problem of creating such a tool is compounded by the fact that a small amount of local imprecision can be amplified via cascade effects. Most instructions in instruction sets such as Intel's IA-32 and ARM are multi-assignments: they have several inputs and several outputs (registers, flags, and memory locations). This aspect of the instruction set introduces a granularity issue during slicing: there are often instructions at which we would like the slice to include only a subset of the instruction's semantics, whereas the slice is forced to include the entire instruction. Consequently, the slice computed by state-of-the-art tools is very imprecise, often including essentially the entire program. This paper presents an algorithm to slice machine code more accurately. To counter the granularity issue, our algorithm performs slicing at the microcode level, instead of the instruction level, and obtains a more precise microcode slice. To reconstitute a machine-code program from a microcode slice, our algorithm uses machine-code synthesis. Our experiments on IA-32 binaries of FreeBSD utilities show that, in comparison to slices computed by a state-of-the-art tool, our algorithm reduces the size of backward slices by 33%, and forward slices by 70%. .
Starting Page	378
Ending Page	393
Page Count	16
File Format	PDF
ISBN	9781450344449
DOI	10.1145/2983990.2984003
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-19
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Program reconstitution Granularity issue Program slicing Machine-code synthesis Ia-32 instruction set Machine code Microcode- level sdg
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in