Publication Records

LANG, Matěj, Radoslav MRÁZ, Marek TRTÍK, Sergej STOPPEL, Jan BYŠKA and Barbora KOZLÍKOVÁ. Antarstick: Extracting Snow Height From Time-Lapse Photography. COMPUTER GRAPHICS FORUM. England: Wiley, 2024, vol. 43, No 3, p. 1-11. ISSN 0167-7055. Available from: https://dx.doi.org/10.1111/cgf.15088.

JONÁŠ, Martin, Jan STREJČEK, Marek TRTÍK and Lukáš URBAN. Fizzer: New Gray-Box Fuzzer. Online. In Dirk Beyer and Ana Cavalcanti. Fundamental Approaches to Software Engineering - 27th International Conference, FASE 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings. Cham (Švýcarsko): Springer, 2024, p. 309-313. ISBN 978-3-031-57258-6. Available from: https://dx.doi.org/10.1007/978-3-031-57259-3_17.

JONÁŠ, Martin, Jan STREJČEK, Marek TRTÍK and Lukáš URBAN. Gray-Box Fuzzing via Gradient Descent and Boolean Expression Coverage. Online. In Bernd Finkbeiner and Laura Kovács. Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part III. Cham (Švýcarsko): Springer, 2024, p. 90-109. ISBN 978-3-031-57255-5. Available from: https://dx.doi.org/10.1007/978-3-031-57256-2_5.

PAULUS, Anselm, Georg MARTIUS and Vít MUSIL. LPGD: A General Framework for Backpropagation through Embedded Optimization Layers. Online. In Salakhutdinov R. and Kolter Z. and Heller K. and Weller A. and Oliver N. and Scarlett J. and Berkenkamp F. Proceedings of Machine Learning Research. 235th ed. Neuveden: ML Research Press, 2024, p. 39989-40014. ISSN 2640-3498.

KLAŠKA, David, Antonín KUČERA, Vojtěch KŮR, Vít MUSIL and Vojtěch ŘEHÁK. Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes. In Wooldridge M., Dy J., Natarajan S. Proceedings of 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024). Washington, DC,. Neuveden: AAAI Press, 2024, p. 20143-20150. ISBN 978-1-57735-887-9. Available from: https://dx.doi.org/10.1609/aaai.v38i18.29993.

AYAZIOVÁ, Paulína, Dirk BEYER, Marian LINGSCH-ROSENFELD, Martin SPIESSL and Jan STREJČEK. Software Verification Witnesses 2.0. Online. In Thomas Neele and Anton Wijs. Model Checking Software - 30th International Symposium, SPIN 2024. Cham (Švýcarsko): Springer, 2024, p. 184-203. ISBN 978-3-031-66148-8. Available from: https://dx.doi.org/10.1007/978-3-031-66149-5_11.

JONÁŠ, Martin, Kristián KUMOR, Jakub NOVÁK, Jindřich SEDLÁČEK, Marek TRTÍK, Lukáš ZAORAL, Paulína AYAZIOVÁ and Jan STREJČEK. Symbiotic 10: Lazy Memory Initialization and Compact Symbolic Execution. Online. In Bernd Finkbeiner and Laura Kovács. Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part III. Cham (Švýcarsko): Springer, 2024, p. 406-411. ISBN 978-3-031-57255-5. Available from: https://dx.doi.org/10.1007/978-3-031-57256-2_29.

CHODIL, Miroslav and Antonín KUČERA. The Finite Satisfiability Problem for PCTL is Undecidable. Online. In Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, United States: IEEE Computer Society, 2024, p. 1-14. ISBN 979-8-4007-0660-8. Available from: https://dx.doi.org/10.1145/3661814.3662145.

CHODIL, Miroslav and Antonín KUČERA. The satisfiability problem for a quantitative fragment of PCTL. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2024, vol. 139, No 103478, p. 1-16. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2023.103478.

JANKOLA, Marek and Jan STREJČEK. Tighter Construction of Tight Büchi Automata. Online. In Naoki Kobayashi and James Worrell. Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Cham: Springer, 2024, p. 234-255. ISBN 978-3-031-57227-2. Available from: https://dx.doi.org/10.1007/978-3-031-57228-9_12.

LANG, Matěj, Adam ŠTĚPÁNEK, Róbert ZVARA, Vojtěch ŘEHÁK and Barbora KOZLÍKOVÁ. Who Let the Guards Out: Visual Support for Patrolling Games. IEEE Transactions on Visualization and Computer Graphics. United States: IEEE Computer Society, 2024. ISSN 1077-2626. Available from: https://dx.doi.org/10.1109/TVCG.2024.3456306.

AYAZIOVÁ, Paulína and Jan STREJČEK. Witch 3: Validation of Violation Witnesses in the Witness Format 2.0. Online. In Bernd Finkbeiner and Laura Kovács. Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part III. Cham (Švýcarsko): Springer, 2024, p. 341-346. ISBN 978-3-031-57255-5. Available from: https://dx.doi.org/10.1007/978-3-031-57256-2_18.

LANG, Matěj, Clemens STROBEL, Felix WECKESSER, Danielle Kathryn LANGLOIS, Enkelejda KASNECI, Barbora KOZLÍKOVÁ and Michael KRONE. A multimodal smartwatch-based interaction concept for immersive environments. Computers & Graphics. Oxford: Elsevier, 2023, vol. 117, December, p. 85-95. ISSN 0097-8493. Available from: https://dx.doi.org/10.1016/j.cag.2023.10.010.

AJDARÓW, Michal and Antonín KUČERA. Asymptotic Complexity Estimates for Probabilistic Programs and their VASS Abstractions. Online. In Perez, Guillermo A. and Raskin, Jean-Francois. 34th International Conference on Concurrency Theory (CONCUR 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, 2023, p. "12:1"-"12:16", 16 pp. ISBN 978-3-95977-299-0. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2023.12.

SUBHAM SEKHAR, Sahoo, Anselm PAULUS, Marin VLASTELICA, Vít MUSIL, Volodymyr KULESHOV and Georg MARTIUS. Backpropagation through combinatorial algorithms: identity with projection works. In 11th International Conference on Learning Representations, ICLR 2023. 2023.

KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. Mean Payoff Optimization for Systems of Periodic Service and Maintenance. Online. In Edith Elkind. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023,. Neuveden: International Joint Conferences on Artificial Intelligence, 2023, p. 5386-5393. ISBN 978-1-956792-03-4. Available from: https://dx.doi.org/10.24963/ijcai.2023/598.

KUREČKA, Martin. Monte Carlo Tree Search with Function Approximation for Risk-constrained Planning and Reinforcement Learning. In The IJCAI-23 Joint Workshop on Artificial Intelligence Safety and Safe Reinforcement Learning. 2023.

CIANCHI, Andrea, Vít MUSIL and Luboš PICK. Optimal Sobolev embeddings for the Ornstein-Uhlenbeck operator. Journal of Differential Equations. San Diego, CA USA: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2023, vol. 359, No 1, p. 414-475. ISSN 0022-0396. Available from: https://dx.doi.org/10.1016/j.jde.2023.02.035.

MUSIL, Vít, Luboš PICK and Jakub TAKÁČ. Optimality problems in Orlicz spaces. Advances in Mathematics. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2023, vol. 432, November 1, p. 1-58. ISSN 0001-8708. Available from: https://dx.doi.org/10.1016/j.aim.2023.109273.

SCHWARZOVÁ, Tereza, Jan STREJČEK and Juraj MAJOR. Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. Online. In Meena Mahajan and Friedrich Slivovsky. 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 1-20. ISBN 978-3-95977-286-0. Available from: https://dx.doi.org/10.4230/LIPIcs.SAT.2023.23.

AJDARÓW, Michal, Šimon BRLEJ and Petr NOVOTNÝ. Shielding in Resource-Constrained Goal POMDPs. Online. In Brian Williams, Yiling Chen, Jennifer Neville. Proceedings of the 37th AAAI Conference on Artificial Intelligence. Washington, DC, USA: AAAI Press, 2023, p. 14674-14682. ISBN 978-1-57735-880-0. Available from: https://dx.doi.org/10.1609/aaai.v37i12.26715.

AYAZIOVÁ, Paulína and Jan STREJČEK. Symbiotic-Witch 2. 2023.

AYAZIOVÁ, Paulína and Jan STREJČEK. Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation. Online. In Sriram Sankaranarayanan and Natasha Sharygina. Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2023, p. 523-528. ISBN 978-3-031-30819-2. Available from: https://dx.doi.org/10.1007/978-3-031-30820-8_30.

KLAŠKA, David, Antonín KUČERA, Martin KUREČKA, Vít MUSIL, Petr NOVOTNÝ and Vojtěch ŘEHÁK. Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. Online. In Edith Elkind. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023,. Neuveden: International Joint Conferences on Artificial Intelligence, 2023, p. 171-179. ISBN 978-1-956792-03-4. Available from: https://dx.doi.org/10.24963/ijcai.2023/20.

KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. General Optimization Framework for Recurrent Reachability Objectives. Online. In Luc De Raedt. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022. Neuveden: ijcai.org, 2022, p. 4642-4648. ISBN 978-1-956792-00-3. Available from: https://dx.doi.org/10.24963/ijcai.2022/644.

KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. Online. In Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor. 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022. Neuveden: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022, p. 1660-1662. ISBN 978-1-4503-9213-6. Available from: https://dx.doi.org/10.5555/3535850.3536068.

CIANCHI, Andrea, Vít MUSIL and Luboš PICK. On the Existence of Extremals for Moser-Type Inequalities in Gauss Space. INTERNATIONAL MATHEMATICS RESEARCH NOTICES. ENGLAND: OXFORD UNIV PRESS, 2022, vol. 2022, No 2, p. 1494-1537. ISSN 1073-7928. Available from: https://dx.doi.org/10.1093/imrn/rnaa165.

BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA, Vít MUSIL, Petr NOVOTNÝ and Vojtěch ŘEHÁK. On-the-fly Adaptation of Patrolling Strategies in Changing Environments. Online. In James Cussens, Kun Zhang. Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022. Neuveden: Proceedings of Machine Learning Research, 2022, p. 244-254. ISBN 978-1-7138-6329-8.

CHODIL, Miroslav, Antonín KUČERA and Jan KŘETÍNSKÝ. Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge. In Jean-Francois Raskin, Krishnendu Chatterjee, Laurent Doyen, and Rupak Majumdar. Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. New York, NY, United States: Springer, 2022, p. 364-387. ISBN 978-3-031-22336-5. Available from: https://dx.doi.org/10.1007/978-3-031-22337-2_18.

PAULUS, Anselm, Michal ROLÍNEK, Vít MUSIL, Brandon AMOS and Georg MARTIUS. CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. Online. In Meila, M; Zhang, T. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139. 139th ed. SAN DIEGO: JMLR-JOURNAL MACHINE LEARNING RESEARCH, 2021, p. 8443-8453. ISBN 978-1-7138-4506-5.

AJDARÓW, Michal and Antonín KUČERA. Deciding Polynomial Termination Complexity for VASS Programs. Online. In Haddad, Serge and Varacca, Daniele. 32nd International Conference on Concurrency Theory (CONCUR 2021). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, 2021, p. "30:1"-"30:15", 15 pp. ISBN 978-3-95977-203-7. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2021.30.

CHALUPA, Marek, David KLAŠKA, Jan STREJČEK and Lukáš TOMOVIČ. Fast Computation of Strong Control Dependencies. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2021, p. 887-910. ISBN 978-3-030-81687-2. Available from: https://dx.doi.org/10.1007/978-3-030-81688-9_41.

LANG, Jan, Vít MUSIL, Miroslav OLŠÁK and Luboš PICK. Maximal Non-compactness of Sobolev Embeddings. Journal of Geometric Analysis. NEW YORK: Springer, 2021, vol. 31, No 9, p. 9406-9431. ISSN 1050-6926. Available from: https://dx.doi.org/10.1007/s12220-020-00522-y.

KLAŠKA, David, Antonín KUČERA, Vojtěch ŘEHÁK and Vít MUSIL. Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games. Online. In de Campos, Cassio and Maathuis, Marloes H. Proceedings of 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021). Neuveden: AUAI Press, 2021, p. 471-481. ISSN 2640-3498.

CIANCHI, Andrea, Vít MUSIL and Luboš PICK. Sharp exponential inequalities for the Ornstein-Uhlenbeck operator. Journal of Functional Analysis. SAN DIEGO: Elsevier, 2021, vol. 281, No 11, 68 pp. ISSN 0022-1236. Available from: https://dx.doi.org/10.1016/j.jfa.2021.109217.

KLAŠKA, David, Antonín KUČERA and Vojtěch ŘEHÁK. Adversarial Patrolling with Drones. Online. In Proceedings of the 2020 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2020, p. 629-637. ISBN 978-1-4503-7518-4. Available from: https://dx.doi.org/10.5555/3398761.3398837.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ and Dominik VELAN. Deciding Fast Termination for Probabilistic VASS with Nondeterminism. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Proceedings. Cham: Springer, 2019, p. 462-478. ISBN 978-3-030-31783-6. Available from: https://dx.doi.org/10.1007/978-3-030-31784-3_27.

KŘETÍNSKÝ, Jan and Tobias MEGGENDORFER. Of Cores: A Partial-Exploration Framework for Markov Decision Processes. Online. In 30th International Conference on Concurrency Theory (CONCUR 2019). Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, p. 1-17. ISBN 978-3-95977-121-4. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2019.5.

ASHOK, Pranav, Jan KŘETÍNSKÝ and Maximilian WEININGER. PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. In Computer Aided Verification (CAV 2019). Cham: Springer, 2019, p. 497-519. ISBN 978-3-030-25539-8. Available from: https://dx.doi.org/10.1007/978-3-030-25540-4_29.

ASHOK, Pranav, Tomáš BRÁZDIL, Krishnendu CHATTERJEE, Jan KŘETÍNSKÝ, Christoph LAMPERT and Viktor TOMAN. Strategy Representation by Decision Trees with Linear Classifiers. In Quantitative Evaluation of Systems (QEST 2019). Cham: Springer, 2019, p. 109-128. ISBN 978-3-030-30280-1. Available from: https://dx.doi.org/10.1007/978-3-030-30281-8_7.

KUČERA, Antonín and Richard MAYR. A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Journal of Computer and System Sciences. Academic Press, 2018, vol. 91, No 1, p. 82-103. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2017.09.004.

ŠŤAVOVÁ, Vlasta, Lenka DĚDKOVÁ, Martin UKROP and Václav MATYÁŠ. A large-scale comparative study of beta testers and regular users. Communications of the ACM. New York, NY, USA: ACM, 2018, vol. 61, No 2, p. 64-71. ISSN 0001-0782. Available from: https://dx.doi.org/10.1145/3173570.

HLINĚNÝ, Petr. A Simpler Self-reduction Algorithm for Matroid Path-width. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2018, vol. 32, No 2, p. 1425-1440. ISSN 0895-4801. Available from: https://dx.doi.org/10.1137/17M1120129.

JONÁŠ, Martin and Jan STREJČEK. Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers. In Bernd Fischer, Tarmo Uustalu. Theoretical Aspects of Computing – ICTAC 2018. Cham (Switzerland): Springer, 2018, p. 273-291. ISBN 978-3-030-02507-6. Available from: https://dx.doi.org/10.1007/978-3-030-02508-3_15.

NĚMEC, Lukáš, Radim OŠŤÁDAL, Václav MATYÁŠ and Petr ŠVENDA. Adaptive Secrecy Amplification with Radio Channel Key Extraction (Adaptive secrecy amplification with radio channel key extraction). Online. In Lisa O’Conner. 2018 14th International Conference on Distributed Computing in Sensor Systems (DCOSS). New York, NY, USA: IEEE, 2018, p. 123-130. ISBN 978-1-5386-5470-5. Available from: https://dx.doi.org/10.1109/DCOSS.2018.00028.

KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER and Vojtěch ŘEHÁK. Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. Online. In Proceedings of the 2018 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2018, p. 659-666. ISBN 978-1-5108-6808-3. Available from: https://dx.doi.org/10.5555/3237383.3237481.

BLUMENSATH, Achim and Felix WOLF. Bisimulation Invariant Monadic-Second Order Logic in the Finite. Online. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Dagstuhl: Schloss Dagstuhl, 2018, p. 1-13. ISBN 978-3-95977-076-7. Available from: https://dx.doi.org/10.4230/LIPIcs.ICALP.2018.117.

BLONDIN, Michael, Javier ESPARZA, Stefan JAAX and Antonín KUČERA. Black Ninjas in the Dark: Formal Analysis of Population Protocols. In Anuj Dawar, Erich Gradel. 2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Oxford, England: ACM, 2018, p. 1-10. ISBN 978-1-4503-5583-4. Available from: https://dx.doi.org/10.1145/3209108.3209110.

KŘETÍNSKÝ, Jan and Tobias MEGGENDORFER. Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes. Online. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS '18). New York, NY, USA: ACM, 2018, p. 609-618. ISBN 978-1-4503-5583-4. Available from: https://dx.doi.org/10.1145/3209108.3209176.

ASHOK, Pranav, Yuliya BUTKOVA, Holger HERMANNS and Jan KŘETÍNSKÝ. Continuous-Time Markov Decisions Based on Partial Exploration. In Automated Technology for Verification and Analysis. ATVA 2018. Cham: Springer, 2018, p. 317-334. ISBN 978-3-030-01089-8. Available from: https://dx.doi.org/10.1007/978-3-030-01090-4_19.

HLINĚNÝ, Petr and Carsten THOMASSEN. Deciding Parity of Graph Crossing Number. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2018, vol. 32, No 3, p. 1962-1965. ISSN 0895-4801. Available from: https://dx.doi.org/10.1137/17M1137231.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ, Dominik VELAN and Florian ZULEGER. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. In Anuj Dawar, Erich Gradel. 2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Oxford, England: ACM, 2018, p. 185-194. ISBN 978-1-4503-5583-4. Available from: https://dx.doi.org/10.1145/3209108.3209191.

NĚMEC, Lukáš, Radim OŠŤÁDAL, Václav MATYÁŠ and Petr ŠVENDA. Entropy crowdsourcing - protocols for link key updates in wireless sensor networks. In Security Protocols XXVI: 26th International Workshop. Cham, Switzerland: Springer International Publishing, 2018, p. 84-92. ISBN 978-3-030-03250-0. Available from: https://dx.doi.org/10.1007/978-3-030-03251-7_9.

BENDÍK, Jaroslav and Ivana ČERNÁ. Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets. Online. In Gilles Barthe and Geoff Sutcliffe and Margus Veanes. LPAR-22, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Awassa, Etiopie: EPiC Series in Computing, 2018, p. 131-142. ISSN 2398-7340. Available from: https://dx.doi.org/10.29007/sxzb.

MRÁZEK, Vojtěch, Marek SÝS, Zdenek VASICEK, Lukáš SEKANINA and Václav MATYÁŠ. Evolving boolean functions for fast and efficient randomness testing. In Proceedings of the Genetic and Evolutionary Computation Conference 2018. USA: Association for Computing Machinery, 2018, p. 1302-1309. ISBN 978-1-4503-5618-3. Available from: https://dx.doi.org/10.1145/3205455.3205518.

ŠŤAVOVÁ, Vlasta, Lenka DĚDKOVÁ, Václav MATYÁŠ, Mike JUST, David ŠMAHEL and Martin UKROP. Experimental large-scale review of attractors for detection of potentially unwanted applications. Computers & Security. Oxford: Elsevier, 2018, vol. 76, July, p. 92-100. ISSN 0167-4048. Available from: https://dx.doi.org/10.1016/j.cose.2018.02.017.

BENDÍK, Jaroslav, Nikola BENEŠ and Ivana ČERNÁ. Finding Regressions in Projects under Version Control Systems. In Leszek A. Maciaszek and Marten van Sinderen. 13th International Conference on Software Technologies. Porto: SciTePress, 2018, p. 152-163. ISBN 978-989-758-320-9. Available from: https://dx.doi.org/10.5220/0006864401520163.

HLINĚNÝ, Petr, Filip POKRÝVKA and Bodhayan ROY. FO model checking of geometric graphs. Online. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). LIPIcs 89. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, p. "19:1"-"19:12", 12 pp. ISBN 978-3-95977-051-4. Available from: https://dx.doi.org/10.4230/LIPIcs.IPEC.2017.19.

BISHOI, Susil Kumar and Václav MATYÁŠ. Investigating results and performance of search and construction algorithms for word-based LFSRs, \sigma-LFSRs. Discrete Applied Mathematics. Elsevier B.V., 2018, vol. 243, July, p. 90-98. ISSN 0166-218X. Available from: https://dx.doi.org/10.1016/j.dam.2018.01.010.

JONÁŠ, Martin and Jan STREJČEK. Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes?. Online. In Gilles Barthe, Geoff Sutcliffe, Margus Veanes. LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Neuveden: EasyChair, 2018, p. 488-497. ISSN 2398-7340. Available from: https://dx.doi.org/10.29007/spnx.

CHALUPA, Marek, Jan STREJČEK and Martina VITOVSKÁ. Joint Forces for Memory Safety Checking. In María-del-Mar Gallardo and Pedro Merino. Model Checking Software. SPIN 2018. Cham, Švýcarsko: Springer, 2018, p. 115-132. ISBN 978-3-319-94110-3. Available from: https://dx.doi.org/10.1007/978-3-319-94111-0_7.

KŘETÍNSKÝ, Jan, Guillermo PEREZ and Jean-Francois RASKIN. Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. Online. In 29th International Conference on Concurrency Theory (CONCUR 2018). Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, p. 1-18. ISBN 978-3-95977-087-3. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2018.8.

ASHOK, Pranav, Tomáš BRÁZDIL, Jan KŘETÍNSKÝ and Ondřej SLÁMEČKA. Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes. In Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2018). Cham: Springer, 2018, p. 322-335. ISBN 978-3-030-03420-7. Available from: https://dx.doi.org/10.1007/978-3-030-03421-4_21.

CAGIRICI, Onur, Petr HLINĚNÝ and Bodhayan ROY. On Colourability of Polygon Visibility Graphs. Online. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). LIPIcs 93. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, p. "21:1"-"21:14", 14 pp. ISBN 978-3-95977-055-2. Available from: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.21.

JONÁŠ, Martin and Jan STREJČEK. On the complexity of the quantified bit-vector arithmetic with binary encoding. Information Processing Letters. Elsevier, 2018, vol. 135, červenec 2018, p. 57-61. ISSN 0020-0190. Available from: https://dx.doi.org/10.1016/j.ipl.2018.02.018.

GAJARSKÝ, Jakub, Petr HLINĚNÝ and Hans Raj TIWARY. Parameterized Extension Complexity of Independent Set and Related Problems. Discrete Applied Mathematics. Elsevier Science, 2018, vol. 248, SI, p. 56-67. ISSN 0166-218X. Available from: https://dx.doi.org/10.1016/j.dam.2017.04.042.

BROŽ, Milan, Mikuláš PATOČKA and Václav MATYÁŠ. Practical Cryptographic Data Integrity Protection with Full Disk Encryption. In Janczewski L., Kutyłowski M. 2018 IFIP International Conference on ICT Systems Security and Privacy Protection. Cham: Springer, 2018, p. 79-93. ISBN 978-3-319-99827-5. Available from: https://dx.doi.org/10.1007/978-3-319-99828-2_6.

BENDÍK, Jaroslav, Ivana ČERNÁ and Nikola BENEŠ. Recursive Online Enumeration of All Minimal Unsatisfiable Subsets. In Shuvendu Lahiri and Chao Wang. Automated Technology for Verification and Analysis - 16th International Symposium, {ATVA} 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings}. Los Angeles: Springer, 2018, p. 143-159. ISBN 978-3-030-01089-8. Available from: https://dx.doi.org/10.1007/978-3-030-01090-4_9.

MATYÁŠ, Václav, Petr ŠVENDA, Frank STAJANO, Bruce CHRISTIANSON and Jonathan ANDERSON. Security Protocols XXVI: 26th International Workshop. Cham: Springer, 2018. ISBN 978-3-030-03250-0. Available from: https://dx.doi.org/10.1007/978-3-030-03251-7.

BRÁZDIL, Tomáš, Antonín KUČERA and Vojtěch ŘEHÁK. Solving Patrolling Problems in the Internet Environment. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden. Neuveden: International Joint Conferences on Artificial Intelligence, 2018, p. 121-127. ISBN 978-0-9992411-2-7. Available from: https://dx.doi.org/10.24963/ijcai.2018/17.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Jan KŘETÍNSKÝ and Viktor TOMAN. Strategy Representation by Decision Trees in Reactive Synthesis. In 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018). Cham: Springer, 2018, p. 385-407. ISBN 978-3-319-89959-6. Available from: https://dx.doi.org/10.1007/978-3-319-89960-2_21.

DVOŘÁK, Zdeněk, Petr HLINĚNÝ and Bojan MOHAR. Structure and generation of crossing-critical graphs. Online. In 34th International Symposium on Computational Geometry, SoCG 2018. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2018, p. "33:1"-"33:14", 14 pp. ISBN 978-3-95977-066-8. Available from: https://dx.doi.org/10.4230/LIPIcs.SoCG.2018.33.

CHALUPA, Marek, Martina VITOVSKÁ and Jan STREJČEK. Symbiotic 5: Boosted Instrumentation (Competition Contribution). In Dirk Beyer and Marieke Huisman. Tools and Algorithms for the Construction and Analysis of Systems, 24th International Conference, Proceedings, Part II. Berlin: Springer, 2018, p. 442-446. ISBN 978-3-319-89963-3. Available from: https://dx.doi.org/10.1007/978-3-319-89963-3_29.

LAUKO, Henrich, Petr ROČKAI and Jiří BARNAT. Symbolic Computation via Program Transformation. In Bernd Fischer, Tarmo Uustalu. Theoretical Aspects of Computing – ICTAC 2018. Cham (Switzerland): Springer, 2018, p. 313-332. ISBN 978-3-030-02507-6. Available from: https://dx.doi.org/10.1007/978-3-030-02508-3_17.

ALMEIDA, Jorge, Ondřej KLÍMA and Michal KUNC. The omega-inequality problem for concatenation hierarchies of star-free languages. Forum Mathematicum. 2018, vol. 30, No 3, p. 663-679. ISSN 0933-7741. Available from: https://dx.doi.org/10.1515/forum-2016-0028.

ALMEIDA, Jorge and Ondřej KLÍMA. Towards a pseudoequational proof theory. Portugaliae mathematica. Lisboa, 2018, vol. 75, No 2, p. 79-119. ISSN 0032-5155. Available from: https://dx.doi.org/10.4171/PM/2012.

KELMENDI, Edon, Julia KRÄMER, Jan KŘETÍNSKÝ and Maximilian WEININGER. Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. In Computer Aided Verification (CAV 2018). Cham: Springer, 2018, p. 623-642. ISBN 978-3-319-96144-6. Available from: https://dx.doi.org/10.1007/978-3-319-96145-3_36.

UKROP, Martin and Václav MATYÁŠ. Why Johnny the Developer Can't Work with Public Key Certificates: An Experimental Study of OpenSSL Usability. In Nigel P. Smart. Topics in Cryptology – CT-RSA 2018: The Cryptographers' Track at the RSA Conference 2018. Švýcarsko: Springer International Publishing, 2018, p. 45-64. ISBN 978-3-319-76952-3. Available from: https://dx.doi.org/10.1007/978-3-319-76953-0_3.

SÝS, Marek, Zdeněk ŘÍHA and Václav MATYÁŠ. Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm. ACM Transactions on Mathematical Software. Association for Computing Machinery, 2017, vol. 43, No 3, p. 27-37. ISSN 0098-3500. Available from: https://dx.doi.org/10.1145/2988228.

STEHLÍK, Martin, Václav MATYÁŠ and Andriy STETSKO. Attack Detection Using Evolutionary Computation. In Abraham, Ajith, Falcon, Rafael, Koeppen, Mario. Computational Intelligence in Wireless Sensor Networks. Germany: Springer International Publishing, 2017, p. 99-129. Studies in Computational Intelligence. ISBN 978-3-319-47713-8. Available from: https://dx.doi.org/10.1007/978-3-319-47715-2_5.

ŠŤAVOVÁ, Vlasta, Václav MATYÁŠ, Mike JUST and Martin UKROP. Factors Influencing the Purchase of Security Software for Mobile Devices - Case Study. Infocommunications Journal. Scientific Association for Infocommunications, 2017, vol. 9, No 1, p. 18-23. ISSN 2061-2079.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Tomáš KAISER, Daniel KRÁĽ, Martin KUPEC, Jan OBDRŽÁLEK, Sebastian ORDYNIAK and Vojtěch TŮMA. First order limits of sparse graphs: Plane trees and path-width. Random Structures & Algorithms. Wiley, 2017, vol. 50, No 4, p. 612-635. ISSN 1042-9832. Available from: https://dx.doi.org/10.1002/rsa.20676.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA and Vojtěch ŘEHÁK. Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. In Nathalie Bertrand, Luca Bortolussi. Quantitative Evaluation of Systems. Cham: Springer, 2017, p. 190-206. ISBN 978-3-319-66334-0. Available from: https://dx.doi.org/10.1007/978-3-319-66335-7_12.

NEMEC, Matúš, Dušan KLINEC, Petr ŠVENDA, Peter SEKAN and Václav MATYÁŠ. Measuring Popularity of Cryptographic Libraries in Internet-Wide Scans. Online. In Proceedings of the 33rd Annual Computer Security Applications Conference. New York, NY, USA: ACM, 2017, p. 162-175. ISBN 978-1-4503-5345-8. Available from: https://dx.doi.org/10.1145/3134600.3134612.

JONÁŠ, Martin and Jan STREJČEK. On Simplification of Formulas with Unconstrained Variables and Quantifiers. In Serge Gaspers, Toby Walsh. Theory and Applications of Satisfiability Testing – SAT 2017. Cham (Switzerland): Springer, 2017, p. 364-379. ISBN 978-3-319-66262-6. Available from: https://dx.doi.org/10.1007/978-3-319-66263-3_23.

MRÁZEK, Jan, Martin JONÁŠ, Vladimír ŠTILL, Henrich LAUKO and Jiří BARNAT. Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution). In Axel Legay, Tiziana Margaria. Tools and Algorithms for the Construction and Analysis of Systems, 23rd International Conference, TACAS 2017, Part II. Berlin, Heidelberg: Springer, 2017, p. 390-393. ISBN 978-3-662-54579-9. Available from: https://dx.doi.org/10.1007/978-3-662-54580-5_29.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ and Shmuel ONN. Parameterized Shifted Combinatorial Optimization. In Y. Cao and J. Chen. International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392). Hong Kong: Springer International Publishing AG, 2017, p. 224-236. ISBN 978-3-319-62388-7. Available from: https://dx.doi.org/10.1007/978-3-319-62389-4_19.

BRÁZDIL, Tomáš, Ezio BARTOCCI, Dimitrios MILIOS, Guido SANGUINETTI and Luca BORTOLUSSI. Policy learning in continuous-time Markov decision processes using Gaussian Processes. Performance Evaluation. 2017, vol. 116, No 1, p. 84-100. ISSN 0166-5316. Available from: https://dx.doi.org/10.1016/j.peva.2017.08.007.

OŠŤÁDAL, Radim, Petr ŠVENDA and Václav MATYÁŠ. Reconsidering Attacker Models in Ad-Hoc Networks. In J Anderson, V Matyáš, B Christianson, F Stajano. Security Protocols XXIV - 24th International Workshop. LNCS 10368. Heidelberg: Springer International Publishing AG, 2017, p. 219-227. ISBN 978-3-319-62032-9. Available from: https://dx.doi.org/10.1007/978-3-319-62033-6_25.

ANDERSON, Jonathan, Václav MATYÁŠ, Bruce CHRISTIANSON and Frank STAJANO. Security Protocols XXIV - 24th International Workshop. Švýcarsko: Springer International Publishing, 2017, 233 pp. ISBN 978-3-319-62032-9.

STAJANO, Frank, Jonathan ANDERSON, Bruce CHRISTIANSON, and Václav MATYÁŠ. Security Protocols XXV - 25th International Workshop, Cambridge, UK, March 20–22, 2017, Revised Selected Papers. Switzerland: Springer International Publishing AG, 2017. ISBN 978-3-319-71074-7.

BLAHOUDEK, František, Alexandre DURET-LUTZ, Mikuláš KLOKOČKA, Mojmír KŘETÍNSKÝ and Jan STREJČEK. Seminator: A Tool for Semi-Determinization of Omega-Automata. Online. In Thomas Eiter and David Sands. Proceedings of the 21th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2017). Neuveden: EasyChair, 2017, p. 356-367. ISSN 2398-7340. Available from: https://dx.doi.org/10.29007/k5nl.

BROŽ, Milan, Mikuláš PATOČKA and Václav MATYÁŠ. Support for authenticated encryption in Linux dm-crypt disk encryption. 2017.

CHALUPA, Marek, Martina VITOVSKÁ, Martin JONÁŠ, Jiří SLABÝ and Jan STREJČEK. Symbiotic 4: Beyond Reachability (Competition Contribution). In Axel Legay, Tiziana Margaria. Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference. Berlin: Springer Berlin Heidelberg, 2017, p. 385-389. ISBN 978-3-662-54580-5. Available from: https://dx.doi.org/10.1007/978-3-662-54580-5_28.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA and Vojtěch ŘEHÁK. Synthesis of Optimal Resilient Control Strategies. In Deepak D'Souza, K. Narayan Kumar. Automated Technology for Verification and Analysis. Cham: Springer International Publishing, 2017, p. 417-434. ISBN 978-3-319-68166-5. Available from: https://dx.doi.org/10.1007/978-3-319-68167-2_27.

SVOREŇOVÁ, Mária, Jan KŘETÍNSKÝ, Martin CHMELÍK, Krishnendu CHATTERJEE, Ivana ČERNÁ and Calin BELTA. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier, 2017, vol. 23, February 2017, p. 230-253. ISSN 1751-570X. Available from: https://dx.doi.org/10.1016/j.nahs.2016.04.006.

KUNC, Michal and Jan MEITNER. The generalized rank of trace languages. In Émilie Charlier, Julien Leroy, Michel Rigo. Developments in Language Theory. 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Cham, Švýcarsko: Springer, 2017, p. 247-259. ISBN 978-3-319-62808-0. Available from: https://dx.doi.org/10.1007/978-3-319-62809-7_18.

NEMEC, Matúš, Marek SÝS, Petr ŠVENDA, Dušan KLINEC and Václav MATYÁŠ. The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli. Online. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2017, p. 1631-1648. ISBN 978-1-4503-4946-8. Available from: https://dx.doi.org/10.1145/3133956.3133969.

KORENČIAK, Ľuboš, Antonín KUČERA and Vojtěch ŘEHÁK. Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. In 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. London: IEEE Computer Society, 2016, p. 367-372. ISBN 978-1-5090-3431-4. Available from: https://dx.doi.org/10.1109/MASCOTS.2016.34.

KORENČIAK, Ľuboš, Vojtěch ŘEHÁK and Adrian FARMADIN. Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC. In Erika Ábrahám, Marieke Huisman. Integrated Formal Methods. Switzerland: Springer International Publishing, 2016, p. 130-138. ISBN 978-3-319-33692-3. Available from: https://dx.doi.org/10.1007/978-3-319-33693-0_9.

JONÁŠ, Martin and Jan STREJČEK. Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. In Nadia Creignou and Daniel Le Berre. Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference. Berlin, Heidelberg: Springer, 2016, p. 267-283. ISBN 978-3-319-40969-6. Available from: https://dx.doi.org/10.1007/978-3-319-40970-2_17.

CHALUPA, Marek, Martin JONÁŠ, Jiří SLABÝ, Jan STREJČEK and Martina VITOVSKÁ. Symbiotic 3: New Slicer and Error-Witness Generation (Competition Contribution). In Marsha Chechik and Jean-Francois Raskin. Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016. Berlin, Heidelberg: Springer, 2016, p. 946-949. ISBN 978-3-662-49673-2. Available from: https://dx.doi.org/10.1007/978-3-662-49674-9_67.

BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Petr NOVOTNÝ and Vojtěch ŘEHÁK. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. In Javier Campos, Boudewijn R. Haverkort. Quantitative Evaluation of Systems. BERLIN: SPRINGER-VERLAG BERLIN, 2015, p. 141-159. ISBN 978-3-319-22263-9. Available from: https://dx.doi.org/10.1007/978-3-319-22264-6_10.

KORENČIAK, Ľuboš, Jan KRČÁL and Vojtěch ŘEHÁK. Dealing with Zero Density Using Piecewise Phase-Type Approximation. In András Horváth, Katinka Wolter. Computer Performance Engineering. Switzerland: Springer International Publishing, 2014, p. 119-134. ISBN 978-3-319-10884-1. Available from: https://dx.doi.org/10.1007/978-3-319-10885-8_9.

BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Jan KŘETÍNSKÝ and Vojtěch ŘEHÁK. On time-average limits in deterministic and stochastic Petri nets. In ACM/SPEC International Conference on Performance Engineering, ICPE'13. New York: ACM, 2013, p. 421-422. ISBN 978-1-4503-1636-1. Available from: https://dx.doi.org/10.1145/2479871.2479936.