Bidirectional grammars for machine-code decoding and encoding

DOI10.1007/978-3-319-48869-1_6MaRDI QIDQ5919617zbMATH OpenOpenAlexFDO

Authors Gang Tan, Greg Morrisett

Publication date 16 September 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-48869-1_6

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Bidirectional grammars for machine-code decoding and encoding
• Bidirectional parsing for linear languages
• Coding by minimal linear grammars
• scientific article; zbMATH DE number 762057
• scientific article; zbMATH DE number 496063
• How to generate binary codes using context-free grammars
• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS
• scientific article; zbMATH DE number 1301974
• Bidirectional cooperating distributed grammar systems

Cited in

(3)

• From MinX to MinC: semantics-driven decompilation of recursive datatypes
• Bidirectional grammars for machine-code decoding and encoding
• Automatic generation and validation of instruction encoders and decoders

Describes a project that uses

Uses Software

• Coq

This page was built for publication: Bidirectional grammars for machine-code decoding and encoding

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