Igor Konnov
Igor Konnov
Research scientist, Informal Systems
Verified email at informal.systems - Homepage
Title
Cited by
Cited by
Year
Decidability of parameterized verification
R Bloem, S Jacobs, A Khalimov, I Konnov, S Rubin, H Veith, J Widder
Synthesis Lectures on Distributed Computing Theory 6 (1), 1-170, 2015
782015
Parameterized model checking of fault-tolerant distributed algorithms by abstraction
A John, I Konnov, U Schmid, H Veith, J Widder
2013 Formal Methods in Computer-Aided Design, 201-209, 2013
532013
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
I Konnov, M Lazić, H Veith, J Widder
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming …, 2017
442017
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
I Konnov, H Veith, J Widder
Information and Computation 252, 95-109, 2017
432017
SMT and POR beat counter abstraction: Parameterized model checking of threshold-based distributed algorithms
I Konnov, H Veith, J Widder
International Conference on Computer Aided Verification, 85-102, 2015
382015
Decidability in parameterized verification
R Bloem, S Jacobs, A Khalimov, I Konnov, S Rubin, H Veith, J Widder
ACM SIGACT News 47 (2), 53-64, 2016
262016
Towards modeling and model checking fault-tolerant distributed algorithms
A John, I Konnov, U Schmid, H Veith, J Widder
International SPIN Workshop on Model Checking of Software, 209-226, 2013
262013
Synthesis of distributed algorithms with parameterized threshold guards
M Lazic, I Konnov, J Widder, R Bloem
21st International Conference on Principles of Distributed Systems (OPODIS 2017), 2018
192018
Tutorial on parameterized model checking of fault-tolerant distributed algorithms
A Gmeiner, I Konnov, U Schmid, H Veith, J Widder
International School on Formal Methods for the Design of Computer …, 2014
182014
What you always wanted to know about model checking of fault-tolerant distributed algorithms
I Konnov, H Veith, J Widder
International Andrei Ershov Memorial Conference on Perspectives of System …, 2015
172015
Computing (bi) simulation relations preserving CTL* X. for ordinary and fair Kripke structures
PE Bulychev, IV Konnov, VA Zakharov
Труды Института системного программирования РАН 12, 2007
152007
ByMC: Byzantine model checker
I Konnov, J Widder
International Symposium on Leveraging Applications of Formal Methods, 327-342, 2018
142018
Parameterized systems in BIP: design and model checking
I Konnov, T Kotek, Q Wang, H Veith, S Bliudze, J Sifakis
27th International conference on concurrency theory (CONCUR 2016), 2016
132016
Para $$^ $$: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
I Konnov, M Lazić, H Veith, J Widder
Formal Methods in System Design 51 (2), 270-307, 2017
112017
Who is afraid of model checking distributed algorithms
I Konnov, H Veith, J Widder
CAV’12 Workshop (EC) 2, 2012
112012
An invariant-based approach to the verification of asynchronous parameterized networks
IV Konnov, VA Zakharov
Journal of Symbolic Computation 45 (11), 1144-1162, 2010
82010
Verifying safety of synchronous fault-tolerant algorithms by bounded model checking
I Stoilkovska, I Konnov, J Widder, F Zuleger
International Conference on Tools and Algorithms for the Construction and …, 2019
72019
Counter attack on Byzantine generals: Parameterized model checking of fault-tolerant distributed algorithms
A John, I Konnov, U Schmid, H Veith, J Widder
arXiv preprint arXiv:1210.3846, 2012
72012
Accuracy of message counting abstraction in fault-tolerant distributed algorithms
I Konnov, J Widder, F Spegni, L Spalazzi
International Conference on Verification, Model Checking, and Abstract …, 2017
62017
Reachability in parameterized systems: all flavors of threshold automata
J Kukovec, I Konnov, J Widder
52018
The system can't perform the operation now. Try again later.
Articles 1–20