Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Evgeny Novikov

dblp:130/3708 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0003-3586-3140ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 1 first-author

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
1 paper
Program verification · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification › equivalence checking
regression verification
0.212013
Precision reuse for efficient regression verification · ESEC/SIGSOFT FSE 2013
Program verification › model checking
software model checking
0.212013
Precision reuse for efficient regression verification · ESEC/SIGSOFT FSE 2013

Methods — techniques the papers use, named apart from their topics

predicate abstraction · 0.2abstract interpretation · 0.2
YearPublicationVenuePosition
2018 Verification of Operating System Monolithic Kernels Without Extensions
Evgeny Novikov, Ilja S. Zakharov
ISoLA (4)1
2013 Precision reuse for efficient regression verification
abstract
Continuous testing during development is a well-established technique for software-quality assurance. Continuous model checking from revision to revision is not yet established as a standard practice, because the enormous resource consumption makes its application impractical. Model checkers compute a large number of verification facts that are necessary for verifying if a given specification holds. We have identified a category of such intermediate results that are easy to store and efficient to reuse: abstraction precisions. The precision of an abstract domain specifies the level of abstraction that the analysis works on. Precisions are thus a precious result of the verification effort and it is a waste of resources to throw them away after each verification run. In particular, precisions are reasonably small and thus easy to store; they are easy to process and have a large impact on resource consumption. We experimentally show the impact of precision reuse on industrial verification problems created from 62 Linux kernel device drivers with 1119 revisions.
Dirk Beyer 0001, Stefan Löwe, Evgeny Novikov, Andreas Stahlbauer, Philipp Wendler
ESEC/SIGSOFT FSE3