WYSINWYX: What you see is not what you eXecute
By Gogul Balakrishnan, Thomas W. Reps. TOPL, 2010
389 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Software, Signal Processing
View Paper: https://www.semanticscholar.org/paper/89fa55863e23146e341584a073bef585bd178ae5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Christopher Krügel
- Giovanni Vigna
- Dawn Song
- David Brumley
- Heng Yin
- Prateek Saxena
- Yan Shoshitaishvili
- Ruoyu Wang
In Software
- Heng Yin
- Giovanni Vigna
- David Brumley
- Thanassis Avgerinos
- Edward J. Schwartz
- Yan Shoshitaishvili
- Ruoyu Wang
- Christopher Krügel
In Signal Processing
- Christopher Krügel
- David Brumley
- Giovanni Vigna
- Dawn Song
- Thanassis Avgerinos
- Edward J. Schwartz
- Heng Yin
- Pongsin Poosankam
Citations in the corpus
- MLIR: A Compiler Infrastructure for the End of Moore's Law (2020, background): “Optimizations may alter or completely invalidate such protections [56]; this lack of transparency is known as WYSINWYX [6] in secure compilation.”
- MLIR: Scaling Compiler Infrastructure for Domain Specific Computation (2021, neutral): “Optimizations may alter or completely invalidate such protections [17]; this lack of transparency is known as WYSINWYX [18] in secure compilation.”
- BAP: A Binary Analysis Platform (2011, background): “TIE analyzes each memory access in x86 to find variable locations (similar to VSA [2]), creates a system of type constraints based upon variable usage, and solves for a typing on all variables.”
- BitBlaze: A New Approach to Computer Security via Binary Analysis (2008, methodology): “VSA is a data-flow analysis that over-approximates the values for each variable at each program point.”
- SOK: (State of) The Art of War: Offensive Techniques in Binary Analysis (2016, background): “At a high level, VSA attempts to identify a tight over-approximation of the program state (i.e., values in memory and registers) at any given point in the 2Xu et. al. defines soundness and completeness of a CFG in the opposite way, where an empty graph is sound and a full graph is complete [59].”
- discovRE: Efficient Cross-Architecture Identification of Bugs in Binary Code (2016, background): “Prominent recent examples of these cases include the Heartbleed vulnerability in the cryptographic library OpenSSL [5], the “Shellshock” vulnerability in GNU Bash [8], and the POODLE vulnerability in the SSLv3 protocol [7].”