Andrei Paskevich
Impact in
- Software top 2%
- Software Testing and Debugging Techniques
-
- Formal Methods in Verification
Papers in
-
- Formal Methods in Verification 17
-
- Logic, programming, and type systems 26
- Logic, Reasoning, and Knowledge 10
- Security and Verification in Computing 9
- Co-authors
- Jean-Christophe Filliâtre (13 shared papers)François Bobot (4 shared papers)Claude Marché (8 shared papers)Jasmin Christian Blanchette (1 shared paper)Sylvain Conchon (2 shared papers)Aaron Stump (1 shared paper)Thomas Wies (1 shared paper)Xavier Urbain (1 shared paper)
In The Last Decade
Andrei Paskevich
30 papers receiving 747 citations
Andrei Paskevich's Hit Papers
Peers
Comparison fields: 5 of 38
- Software 227
- Computational Theory and Mathematics 491
- Artificial Intelligence 657
- Hardware and Architecture 122
- Signal Processing 62
Countries citing papers authored by Andrei Paskevich
This map shows the geographic impact of Andrei Paskevich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrei Paskevich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrei Paskevich more than expected).
Fields of papers citing papers by Andrei Paskevich
This network shows the impact of papers produced by Andrei Paskevich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrei Paskevich. The network helps show where Andrei Paskevich may publish in the future.
Co-authors
The 15 scholars most cited alongside Andrei Paskevich, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 31 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Why3 — Where Programs Meet Provers Hit paper breakdown → | 2013 | 364 |
| 2 | A.: Why3: Shepherd your herd of provers | 2011 | 136 |
| 3 | 2013 | 40 | |
| 4 | 2014 | 36 | |
| 5 | 2016 | 27 | |
| 6 | 2011 | 26 | |
| 7 | 2007 | 20 | |
| 8 | 2010 | 19 | |
| 9 | The 2nd Verified Software Competition: Experience Report | 2011 | 16 |
| 10 | 2008 | 16 | |
| 11 | 2015 | 15 | |
| 12 | 2007 | 10 | |
| 13 | 2014 | 9 | |
| 14 | 2014 | 9 | |
| 15 | 2017 | 8 | |
| 16 | 2014 | 7 | |
| 17 | 2016 | 7 | |
| 18 | 2019 | 6 | |
| 19 | 2020 | 5 | |
| 20 | 2018 | 4 |
About Andrei Paskevich
Andrei Paskevich is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Software, Signal Processing and Theoretical Computer Science, having authored 31 papers that have together received 796 indexed citations. Recurring topics across this work include Logic, programming, and type systems (26 papers), Formal Methods in Verification (17 papers), Logic, Reasoning, and Knowledge (10 papers), Security and Verification in Computing (9 papers), Software Testing and Debugging Techniques (5 papers), Software Engineering Research (2 papers), Model-Driven Software Engineering Techniques (2 papers) and Advanced Malware Detection Techniques (2 papers). The work is most often cited by research in Software (227 citations), Computational Theory and Mathematics (491 citations), Artificial Intelligence (657 citations), Hardware and Architecture (122 citations) and Signal Processing (62 citations). Andrei Paskevich has collaborated with scholars based in France, China and Ukraine. Frequent co-authors include Jean-Christophe Filliâtre, François Bobot, Claude Marché, Jasmin Christian Blanchette, Sylvain Conchon, Aaron Stump, Thomas Wies, Xavier Urbain, Pierre Courtieu and Évelyne Contejean. Their work appears in journals such as Journal of Automated Reasoning, Lecture notes in computer science, International Journal on Software Tools for Technology Transfer, Formal Methods in System Design and Proceedings of the ACM on Programming Languages.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.