Demo Data from VLDB 2026 / reviewers in the wild / expert
Hristina Palikareva
dblp:32/8170
· DBLP profile ↗
7ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 6 · 3 first-authorTheory of computation · 3 · 1 first-authorSystems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
3 papers |
Software testing · 58% Program analysis · 31% Software maintenance and evolution · 11% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
symbolic execution |
0.5 | 2 | 2018 | Shadow Symbolic Execution for Testing Software Patches · ACM Trans. Softw. Eng. Methodol. 2018 Multi-solver Support in Symbolic Execution · CAV 2013 |
Software testing
regression testing |
0.3 | 2 | 2018 | Shadow of a doubt: testing for divergences between software versions · ICSE 2016 Shadow Symbolic Execution for Testing Software Patches · ACM Trans. Softw. Eng. Methodol. 2018 |
Software testing
test generation |
0.3 | 1 | 2018 | Shadow Symbolic Execution for Testing Software Patches · ACM Trans. Softw. Eng. Methodol. 2018 |
Automated reasoning and model checking
refinement checking |
0.1 | 1 | 2012 | Recent Developments in FDR · CAV 2012 |
Software maintenance and evolution › software defects
regression bugs |
0.1 | 1 | 2018 | Shadow Symbolic Execution for Testing Software Patches · ACM Trans. Softw. Eng. Methodol. 2018 |
Software maintenance and evolution
software evolution |
0.1 | 1 | 2016 | Shadow of a doubt: testing for divergences between software versions · ICSE 2016 |
Methods — techniques the papers use, named apart from their topics
symbolic execution · 0.3test case generation · 0.2differential testing · 0.2SMT solving · 0.2refinement checking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Shadow Symbolic Execution for Testing Software PatchesabstractWhile developers are aware of the importance of comprehensively testing patches, the large effort involved in coming up with relevant test cases means that such testing rarely happens in practice. Furthermore, even when test cases are written to cover the patch, they often exercise the same behaviour in the old and the new version of the code. In this article, we present a symbolic execution-based technique that is designed to generate test inputs that cover the new program behaviours introduced by a patch. The technique works by executing both the old and the new version in the same symbolic execution instance, with the old version shadowing the new one. During this combined shadow execution, whenever a branch point is reached where the old and the new version diverge, we generate a test input exercising the divergence and comprehensively test the new behaviours of the new version. We evaluate our technique on the Coreutils patches from the CoREBench suite of regression bugs, and show that it is able to generate test inputs that exercise newly added behaviours and expose some of the regression bugs. Tomasz Kuchta, Hristina Palikareva, Cristian Cadar |
ACM Trans. Softw. Eng. Methodol. | 2 |
| 2017 | From exaflop to exaflowabstractExascale computing is facing a gap between the ever increasing demand for application performance and the underlying chip technology that does no longer deliver the expected exponential increases in CPU performance. The industry is now progressively moving towards dedicated accelerators to deliver high performance and better energy efficiency. However, the question of programmability still remains. To address this challenge we propose a dedicated high-level accelerator programming and execution model where performance and efficiency are primary targets. Our model splits the computation into a conventional CPU-oriented part and a highly efficient fully programmable data flow part. We present a number of systematic transformations and optimisations targeting Maxeler dataflow systems that typically yield one to two orders of magnitude improvements in terms of both performance and energy efficiency. These significant gains are enabled by addressing fundamental algorithmic properties and on-demand numerical requirements. This approach is demonstrated by a case study from computational finance. Tobias Becker, Pavel Burovskiy, Anna Maria Nestorov, Hristina Palikareva, Enrico Reggiani, Georgi Gaydadjiev |
DATE | 4 |
| 2016 | Shadow of a doubt: testing for divergences between software versionsabstractWhile developers are aware of the importance of comprehensively testing patches, the large effort involved in coming up with relevant test cases means that such testing rarely happens in practice. Furthermore, even when test cases are written to cover the patch, they often exercise the same behaviour in the old and the new version of the code. Hristina Palikareva, Tomasz Kuchta, Cristian Cadar |
ICSE | 1 |
| 2013 | Multi-solver Support in Symbolic Execution
Hristina Palikareva, Cristian Cadar |
CAV | 1 |
| 2012 | Recent Developments in FDR
Philip J. Armstrong, Michael Goldsmith, Gavin Lowe, Joël Ouaknine, Hristina Palikareva, A. W. Roscoe 0001, James Worrell 0001 |
CAV | 5 |
| 2012 | SAT-solving in CSP trace refinement
Hristina Palikareva, Joël Ouaknine, A. W. Roscoe 0001 |
Sci. Comput. Program. | 1 |
| 2011 | Static Livelock Analysis in CSP
Joël Ouaknine, Hristina Palikareva, A. W. Roscoe 0001, James Worrell 0001 |
CONCUR | 2 |