Cezara Drăgoi is a post-doc in IST Austria Tom Henzinger group . She got her phd in LIAFA (University Paris 7) under the supervision of Ahmed Bouajjani and Mihaela Sighireanu. Her main research interests are in software verification and analysis [CV] . She has a computer science bachelor degree obtained at the University of Bucharest. Last but not least this is her home town. You can contact her by email at cezarad@liafa.jussieu.fr.

Publications:

• PHD Thesis : Automated verification of heap-manipulating programs with infinite data .

• Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data, VMCAI'12, joint work with Ahmed Bouajjani, Constantin Enea and Mihaela Sighireanu.
• On Inter-Procedural Analysis of Programs with Lists and Data, PLDI'11, joint work with Ahmed Bouajjani, Constantin Enea and Mihaela Sighireanu. Tool CELIA .
• Invariant Synthesis for Programs Manipulating Lists with Unbounded Data, CAV'10, joint work with Ahmed Bouajjani, Constantin Enea, Ahmed Rezine and Mihaela Sighireanu. Tool CINV .
• A Logic-Based Framework for Reasoning about Composite Data Structures, CONCUR'09, joint work with Ahmed Bouajjani, Constantin Enea and Mihaela Sighireanu.
• Rewriting Systems over Nested Data Words, MEMICS'09, joint work with Ahmed Bouajjani, Yan Jurski and Mihaela Sighireanu.
• A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes, joint work with Ahmed Bouajjani, Constantin Enea, Yan Jurski and Mihaela Sighireanu.
• On Compiling Structured Interactive Programs with Registers and Voices, SOFTSEM'09, joint work with Gheorghe Stefanescu.
• A Programming Language for Interactive Systems and Its Typing System, FINCO'08, joint work with Gheorghe Stefanescu.
• Accepting Networks of Evolutionary Processors with Filtered Connections, Journal of Universal Computer Science, joint work with Florin Manea and Victor Mitrana.

Tools:

• CELIA is a Frama-C plug-in for inter-procedural static analysis of C programs with linked lists and unbouded data.
• CINV is a tool for the data and shape analysis of programs with linked lists.

Teaching:

• During the phd, her teaching activities consisted in TPs/TDs, i.e. practical/ exercise classes, in "Introduction to programming languages" and "Automata theory" for undergraduated students and "Static analysis" for master students.