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
214 2016 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
91 2017 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
84 2013 TLA+ model checking made symbolic I Konnov, J Kukovec, TH Tran
Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-30, 2019
66 2019 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
62 2017 ByMC: Byzantine model checker I Konnov, J Widder
International Symposium on Leveraging Applications of Formal Methods, 327-342, 2018
48 2018 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
45 2015 Towards modeling and model checking fault-tolerant distributed algorithms A John, I Konnov, U Schmid, H Veith, J Widder
Model Checking Software: 20th International Symposium, SPIN 2013, Stony …, 2013
44 2013 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 …, 2018
38 2018 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), 30: 1-30: 16, 2016
38 2016 On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability I Konnov, H Veith, J Widder
International Conference on Concurrency Theory, 125-140, 2014
32 2014 Verifying safety of synchronous fault-tolerant algorithms by bounded model checking I Stoilkovska, I Konnov, J Widder, F Zuleger
International Journal on Software Tools for Technology Transfer 24 (1), 33-48, 2022
29 2022 Verification of randomized consensus algorithms under round-rigid adversaries N Bertrand, I Konnov, M Lazić, J Widder
International Journal on Software Tools for Technology Transfer 23 (5), 797-821, 2021
26 2021 What you always wanted to know about model checking of fault-tolerant distributed algorithms I Konnov, H Veith, J Widder
Perspectives of System Informatics: 10th International Andrei Ershov …, 2016
26 2016 Formal specification and model checking of the tendermint blockchain synchronization protocol (short paper) S Braithwaite, E Buchman, I Konnov, Z Milosevic, I Stoilkovska, J Widder, ...
2nd Workshop on Formal Methods for Blockchains (FMBC 2020), 10: 1-10: 8, 2020
25 2020 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
25 2014 Para I Konnov, M Lazić, H Veith, J Widder
Formal Methods in System Design 51 (2), 270-307, 2017
23 2017 Holistic verification of blockchain consensus N Bertrand, V Gramoli, I Konnov, M Lazić, P Tholoniat, J Widder
arXiv preprint arXiv:2206.04489, 2022
22 2022 Reachability in parameterized systems: all flavors of threshold automata J Kukovec, I Konnov, J Widder
CONCUR 2018-29th International Conference on Concurrency Theory, 2018
20 2018 Computing (bi) simulation relations preserving CTL* X. for ordinary and fair Kripke structures PE Bulychev, IV Konnov, VA Zakharov
Труды Института системного программирования РАН 12, 59-76, 2007
17 2007 
Josef WidderInformal SystemsEmail verificata su informal.systems
