Graph rewriting / Reverse engineering
Aster
A rule-based graph rewriting and code-lifting engine for reconstructing higher-level structure from shader and DXBC disassembly.
01 / Overview
Aster is a work-in-progress engine for lifting low-level code into more useful representations. It applies declarative rewrite rules to graphs, with shader and DXBC disassembly as its initial reverse-engineering domain.
02 / What it does
- 01
Represents low-level programs as graphs that can be inspected and transformed.
- 02
Applies rule-based rewrites to recover higher-level structure.
- 03
Uses DXBC shader disassembly as a concrete code-lifting test case.
03 / Engineering
Aster separates transformation rules from the mechanics of traversing and rewriting a graph. The goal is to make reverse-engineering passes composable instead of burying each one in a bespoke procedural pipeline.