From MinX to MinC: semantics-driven decompilation of recursive datatypes

DOI10.1145/2837614.2837633MaRDI QIDQ2828255zbMATH OpenOpenAlexFDO

Authors Ed Robbins, Andy King, Tom Schrijvers

Publication date 24 October 2016

Published in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2837614.2837633

zbMATH Keywords

reverse engineeringrecursivedecompilation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• Automatic reconstruction of data types in the decompilation problem
• scientific article; zbMATH DE number 1692950
• Bidirectional grammars for machine-code decoding and encoding
• Bidirectional grammars for machine-code decoding and encoding
• Refinement-based CFG reconstruction from unstructured programs

Cited in

(1)

• Automatic reconstruction of data types in the decompilation problem

Describes a project that uses

Uses Software

• MinC
• MinX

This page was built for publication: From MinX to MinC: semantics-driven decompilation of recursive datatypes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828255)