Parallelizing programs with recursive data structures

Hendren, Laurie; Nicolau, Alexandru

doi:10.1109/71.80123

Cited by 165 publications

(92 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For certain programs that manipulate lists, Deutsch's algorithm offers a way of representing the exact (infinite set of) may aliases in a compact way. A different approach was taken by Hendren and Nicolau, who designed an algorithm that handles only acyclic data structures [9,7].…”

Section: Methods Not Based On Shape Graphsmentioning

confidence: 99%

Shape Analysis

Wilhelm

Sagiv

Reps

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Section: Methods Not Based On Shape Graphsmentioning

confidence: 99%

Shape Analysis

Wilhelm

Sagiv

Reps

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In particular, while it handles fist append, it fails to analyze an in-place list reversal program. Hendren [12] cannot handle cyclic structures, and many other algorithms only handle recursive structures that are no more than k levels deep.…”

Section: Alias and Shape Analysismentioning

confidence: 99%

Manufacturing cheap, resilient, and stealthy opaque constructs

Collberg

Thomborson

Low

1998

Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '98

407

332

View full text Add to dashboard Cite

It has become common to distribute software in forms that are isomorphic to the original source code. An important example is Java bytecode. Since such codes are easy to decompile, they increase the risk of mahcious reverse engineering attacks.In thii paper we describe the design of a Java code obfus- &OF,a tool which -through the application of code transformations -converts a Java program into an equivalent one that is more difficuh to reverse engineer.We describe a number of transformations which obfuscate control-flow. Transformations are evaluated with respect to potency (To what degree is a human reader confused?), resilience (How well are automatic deobfuscation attacks resisted?), cost (How much time/space overhead is added?), and stealth (How well does obfuscated code blend in with the original code?).The resilience of many control-altering transformations rely on the resilience of opaque predicates. These are boolean valued expressions whose values are known to the obfuscator but difficult to determine for an automatic deobfuscator. We show how to construct resilient, cheap, and stealthy opaque predicates based on the intractability of certain static analysis problems such as alias analysis.

show abstract

“…Unlike the related works that we discuss below, our method is fully automated and yet it guarantees preservation of the original semantics. Transforming a program by our method-or even just the recognition of pointer code implementing container operations that is a part of our method-can be useful in many different ways, including simplification of program analysis by separating shape and data-related analyses (as we show later on in the paper), automatic parallelization [10], optimization of garbage collection [20], debugging and automatic bug finding [2], profiling and optimizations [17], general understanding of the code, improvement of various software engineering tasks [6], detection of abnormal data structure behaviour [11], or construction of program signatures [4].…”

Section: Introductionmentioning

confidence: 99%

From Low-Level Pointers to High-Level Containers

Dudka

Holík

Peringer

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a method that transforms a C program manipulating containers using low-level pointer statements into an equivalent program where the containers are manipulated via calls of standard high-level container operations like push back or pop front. The input of our method is a C program annotated by a special form of shape invariants which can be obtained from current automatic shape analysers after a slight modification. The resulting program where the low-level pointer statements are summarized into high-level container operations is more understandable and (among other possible benefits) better suitable for program analysis since the burden of dealing with low-level pointer manipulations gets removed. We have implemented our approach and successfully tested it through a number of experiments with list-based containers, including experiments with simplification of program analysis by separating shape analysis from analysing data-related properties.

show abstract

Parallelizing programs with recursive data structures

Cited by 165 publications

References 16 publications

Shape Analysis

Shape Analysis

Manufacturing cheap, resilient, and stealthy opaque constructs

From Low-Level Pointers to High-Level Containers

Contact Info

Product

Resources

About