Hristina was a postdoctoral researches in the Software Reliability Group. Her research interests are in the area of formal software verification and concurrency. In November 2012, she received a PhD in Computer Science from the University of Oxford, UK. She obtained an MSc and a BSc in Computer Science from Sofia University “St. Kliment Ohridski” in Bulgaria, specialising in logic and algorithms. Between 2001 and 2007, she also worked as a software engineer in a Bulgarian software company outsourcing for Siemens L&A Postal Automation, Germany.
Group Publications
-
Shadow Symbolic Execution for Testing Software Patches
Tomasz Kuchta, Hristina Palikareva, Cristian Cadar
ACM Transactions on Software Engineering and Methodology (TOSEM 2018)
-
Shadow of a Doubt: Testing for Divergences Between Software Versions
Hristina Palikareva, Tomasz Kuchta, Cristian Cadar
International Conference on Software Engineering (ICSE 2016)
-
Shadow Symbolic Execution for Better Testing of Evolving Software
Cristian Cadar, Hristina Palikareva
International Conference on Software Engineering, New Ideas and Emerging Results (ICSE NIER 2014)
-
Multi-solver Support in Symbolic Execution
Hristina Palikareva, Cristian Cadar
International Conference on Computer Aided Verification (CAV 2013)
Other Publications
-
A Static Analysis Framework for Livelock Freedom in CSP
Joel Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell
Logical Methods in Computer Science (LMCS 2013)
-
Recent Developments in FDR
Philip J. Armstrong, Michael Goldsmith, Gavin Lowe, Joel Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell
Proceedings of the 24th International Conference on Computer Aided Verification (CAV 2012)
-
Techniques and Tools for the Verification of Concurrent Systems
PhD thesis, University of Oxford, 2012
-
SAT-Solving in CSP Trace Refinement
Joel Ouaknine, Hristina Palikareva, A. W. Roscoe
Science of Computer Programming (SCP 2012)
-
Static Livelock Analysis in CSP
Joel Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell
Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR 2011)
-
Faster FDR Counterexample Generation Using SAT-Solving
Joel Ouaknine, Hristina Palikareva, A. W. Roscoe
Electronic Communication of the European Association of Software Science and Technology (ECEASST 2009)