Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering 2015
DOI: 10.1145/2786805.2786875
|View full text |Cite
|
Sign up to set email alerts
|

Mimic: computing models for opaque code

Abstract: Opaque code, which is executable but whose source is unavailable or hard to process, can be problematic in a number of scenarios, such as program analysis. Manual construction of models is often used to handle opaque code, but this process is tedious and error-prone. (In this paper, we use model to mean a representation of a piece of code suitable for program analysis.) We present a novel technique for automatic generation of models for opaque code, based on program synthesis. The technique intercepts memory a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
23
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(23 citation statements)
references
References 17 publications
0
23
0
Order By: Relevance
“…Past efforts in program synthesis have been quite diverse. Some approaches search through a space of programs using brute force [Bar-David and Taubenfeld 2003;Katayama 2005], MCMC search [Heule et al 2015;], genetic programming [Weimer et al 2009], or neural networks [Balog et al 2017;Devlin et al 2017]. Others use constraint-solving [Feng et al 2017a,b;Gulwani et al 2011a;Jha et al 2010;Srivastava et al 2010] or version space algebras [Gulwani 2011;Lau et al 2000].…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…Past efforts in program synthesis have been quite diverse. Some approaches search through a space of programs using brute force [Bar-David and Taubenfeld 2003;Katayama 2005], MCMC search [Heule et al 2015;], genetic programming [Weimer et al 2009], or neural networks [Balog et al 2017;Devlin et al 2017]. Others use constraint-solving [Feng et al 2017a,b;Gulwani et al 2011a;Jha et al 2010;Srivastava et al 2010] or version space algebras [Gulwani 2011;Lau et al 2000].…”
Section: Related Workmentioning
confidence: 99%
“…As noted in Section 1, many component-based synthesizers cannot handle control structures, especially loops [Feng et al 2017b;Gulwani et al 2011a;Jha et al 2010;Menon et al 2013]. Beyond component-based synthesis, some approaches in the wider program synthesis literature do handle loops [Bar-David and Taubenfeld 2003;Barthe et al 2013;Heule et al 2015;Qi et al 2012;Srivastava et al 2010], but many do not [Alur et al 2017;Balog et al 2017;Devlin et al 2017;Lau et al 2000;]. Hence, handling combinations of control structures is a distinguishing aspect of FrAngel.…”
Section: Synthesis Techniquesmentioning
confidence: 99%
See 2 more Smart Citations
“…Mimic [15] aims to synthesize models that perform the same computations as opaque or obfuscated Javascript code. Mimic uses random search inspired by machine learning techniques.…”
Section: Related Workmentioning
confidence: 99%