Formal verification.
I am currently working on my PhD dissertation which will be about sequential consistency as a shared memory model and the verification thereof. The outline of the dissertation is (very crudely) as follows.

• The transformation of sequential consistency checking of individual concurrent executions to a satisfiability problem.
• A novel framework based on language theory for the formalization of sequential consistency checking and some approximate results.
• An elaboration on the definition of sequential consistency that has been used so far; a discussion on the "undecidability" result and a proposition for a new definition.

• Formalization for Shared Memories - A New Approach Based on Transduction. Ali Sezgin. Preliminary copy.
• Formal Verification of Sequential Consistency as a Language Inclusion Problem. Ali Sezgin. Preliminary copy.
• Unambiguous Executions and Formal Verification of Sequential Consistency. Ali Sezgin. Preliminary copy..
• Emptiness of Linear Weak Alternating Automata. Stephan Merz and Ali Sezgin. Technical Report A03-R-503, Loria, 2003. postscript.

Unclassified material; soon to be...