Greetings friends,

I am a fledgling reverse engineer and I have taken a liking to more theoretical areas of computer science, although I have little background in it. I am doing my master's in computer science and my program is heavily applied. I discovered this subreddit and the reading list linked on the sidebar, and noticed that the mathematical component of the reading list might be slightly advanced for someone with my mathematical background.

So, to spark some discussion, I thought I'd ask you all what you think the mathematical preliminaries for the reading list are. It's been a while since I've done my undergraduate mathematics, so I think it would do me some good to brush up on some areas before diving into this reading list.

Thank you for your consideration.

​

One of the most important advances of the last decade is the idea that we can automatically teach software to respond in an "expected" way.

However, we are now facing new advances in software development based on formal methods that may provide answers to some of the problems arising from machine learning.

For those interested in testing software based on logic statements, I leave you the GitHub repository of the Tau Language:

https://github.com/IDNI/tau-lang

​

For those intrigued by the theoretical aspects and want to understand how it all works, I recommend Ohad Asor's insightful paper: https://tau.net/theories-and-applications-of-boolean-algebras.pdf.

Why is logic-based software development the future of AI? Unlike machine learning, it can handle logical AI, such as reasoning, formal proofs, and correct-by-construction development, while also incorporating machine learning capabilities.

I am studying the prereq math for program analysis. I completed trig & precalc. Can i jump to discreet math, proofs, linear algebra etc., or should i study calculus 1,2 & 3 before proceeding further.Will studying calculus be of any use in the program analysis domain ?

Hi, I have a question.

A program creates a binary file whenever it runs that contains some information about what happened during its runtime and some diagnostic information. Part of the diagnostic information will be the exact same for every run from the same machine/configuration, some will be different. The location of the information can be at different positions in the file. (As an example, it could be after 100 bytes or 10000 bytes.

My goal is to be able to identify precisely if the file came from the same machine as another file.

It's raw data, not containing any information about its structure. It does contain some strings, but they aren't unique enough to be 100% sure it's from the same machine. It does have a general order, but the data is arranged in a space efficient way. (As an example, if there's an 8 bit value stored, then a bool, then a 16 bit value, it would be using exactly 25 bits).

I know some techniques to tackle this problem by looking at how the application writes the data, but I was wondering if I could use the underlying structure of the data to solve this problem. If I run the program 3 times from the same machine some bit sequences will always be the same.

For simplicity let's assume the data is less than 10 Megabytes in size.

What would be a good way to approach this?

I'm a beginner hacker and I just started learning networking stuff. I like to understand how machines actually do things: how do computers "compress" files? Or how does encrytion work? I wanted to ask you, what mathematical notions should I learn to actually get into reverse engineering?

Ps: i would really appreciate if you could also tell me what should i learn after getting through the ccna course. After understanding the basics of networking that a ccna couse could teach me, what should i learn? Thanks in advance

So i am wondering what tools are commonly used see whats behind a program you use often and want to learn how it functions and such?

​

any tips or tricks you want to share? to a newbie like me 😊

Program flow and path are discriminated in the literature of program analysis. However, I have failed to find a formal definition of program flow and path. Can anyone please point me to some authentic literature, e.g. research paper or popular books? Also, an example will be highly appreciated.

Is there a good SoK paper that details modern problems/limitations of static analysis paper?

I was wondering if you could all give me a good idea of what you are all interested in. I've recently been learning about formal methods and the mathematical foundations behind SAT/SMT solving. I've been following the Mobius Strip RE reading list and am currently reading The Calculus of Computation. Has anyone here read that? What are your backgrounds?

Hey everyone, my name is TotallyNotCarson and I'm a student. I'm pretty interested in program analysis and reverse engineering, the other RE sub seems to be more applied. This sub also seems pretty dead, I was wondering if we could try and have the mods make a monthly/weekly discussion post where we can talk about things we read or ask questions. I'm currently enrolled in an automated reasoning course and would love to share what I'm learning with all of you.

​

edit: Cant edit my post title, but should probably be "Suggestion: monthly/weekly discussion thread"

I'm going through the recommended texts and would like to create a discord group (or matrix room!) to talk about it. Would anyone be interested?

My background is in programming/informatics, so the math is mostly new to me. It could be nice to join forces, help each other out.

Anyone have a good book that covers various types of program analysis? I've read papers on symbolic execution and dataflow/taint analysis but im looking for something more textbook like. I googled a bit and only found a few resources that seem pretty old. Thanks for any and all suggestions!

Hi,

I'm working on a decompiler, and I'm getting to the part when I want to discover types. I want to use Value-set analysis (explained in "Analyzing Memory Accesses in x86 Executables" - https://pdfs.semanticscholar.org/2f7b/486069be08da1ef1dd86f4ed838a51153f8e.pdf) for it, but I can't make heads or tails about how I'm supposed to apply this.

Can anybody shed light on how VSA is supposed to work (or have points to some resource) that a simple programmer like me can understand? :D

Thanks in advance.

I'm inquiring about the subject of Formal Methods in particular in the area of Kernel Security my questions are as follows:

• What significant develops/advances have been made ?

• Could Formal Methods be used to show a system is insecure rather than secure and if so would it be trivial to implement ?

• What are some fundamental papers should one read in the area ?

• Has a system like sel4 despite being proven to be secure still fail due to the assumptions made ?

• What's a good reading list for bridging into the area ?

• What are the significant difficulties of implementing formal methods ?

• Who are key researchers in the area ?

• What architectures has Formal Methods in respect to OS Kernel's been applied to ?

I asked this question over at r/ReverseEngineering as well but this may be a better place for it.

I'm beginning the book list on the formal side of reverse engineering from Mobius Strip Reverse Engineering. I have a strong background in math, graduate level, but an newer to the formal aspects of computer science topics.

When I'm reading these textbooks what should I be thinking about from the applied side of reverse engineering? The best example of what I'm looking for is if you're studying physics and you start reading a real analysis book you should be thinking about how the function behaviors you're studying relate to the physical systems you are studying. The function itself, assuming some nice properties, combined with operators on that function tell a great deal of information about a physical system.

So as I'm reading The Calculus of Computation should I be thinking about how the C programming language behaves? Does that statement even make sense?