Hello, I do research in the area of program data-flow analysis. The theory of data-flow analysis has been extensively studied. Data Flow Analysis: Theory and Practice by Khedker, Sanyal, and Sathe is a reference textbook. This subject essentially studies how programs move data from one memory location to another.

My work in this field has led me to search for new mathematical foundations for dataflow analysis. These foundations will abstract the concept and address a number of issues. Firstly, traditional dataflow analysis only works on explicitly defined product types like bit vectors. This provides a limited scope for the theory. To generalize from this, we can use partitions, which can model any type of information accessible by a function.

Then to model dataflow relations in this new abstracted setting, I have suggested the use of the Sierpinski topos. Using this fundamental topos, we can model dataflow relations between information locations represented with the highest level of generality. This forms a broad generalisation of the notion of congruences from abstract algebra.