Výpis publikací

KLAŠKA, David, Antonín KUČERA, Vít MUSIL a 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, s. 4642-4648. ISBN 978-1-956792-00-3. Dostupné z: https://dx.doi.org/10.24963/ijcai.2022/644.

JANČÁR, Ján, Marcel FOURNÉ, Daniel DE ALMEIDA BRAGA, Mohamed SABT, Peter SCHWABE, Gilles BARTHE, Pierre-Alain FOUQUE a Yasemin ACAR. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. Online. In 43rd IEEE Symposium on Security and Privacy. San Francisco: IEEE, 2022, s. 632-649. ISBN 978-1-6654-1316-9. Dostupné z: https://dx.doi.org/10.1109/SP46214.2022.9833713.

PAULUS, Anselm, Michal ROLÍNEK, Vít MUSIL, Brandon AMOS a 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. 139. vyd. SAN DIEGO: JMLR-JOURNAL MACHINE LEARNING RESEARCH, 2021, s. 8443-8453. ISBN 978-1-7138-4506-5.

BENEŠ, Nikola, Luboš BRIM, Samuel PASTVA a David ŠAFRÁNEK. Computing Bottom SCCs Symbolically Using Transition Guided Reduction. Online. In Alexandra Silva, K. Rustan, M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021. Neuveden: Springer Nature, 2021, s. 505-528. ISBN 978-3-030-81684-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-81685-8_24.

BENDÍK, Jaroslav a Kuldeep S. MEEL. Counting Maximal Satisfiable Subsets. Online. In 35th AAAI Conference on Artificial Intelligence (AAAI-21). Palo Alto: AAAI, 2021, s. 3651-3660. ISBN 978-1-57735-866-4.

BENDÍK, Jaroslav a Kuldeep S. MEEL. Counting Minimal Unsatisfiable Subsets. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference. Cham: Springer, 2021, s. 313-336. ISBN 978-3-030-81687-2. Dostupné z: https://dx.doi.org/10.1007/978-3-030-81688-9_15.

CHALUPA, Marek, David KLAŠKA, Jan STREJČEK a 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, s. 887-910. ISBN 978-3-030-81687-2. Dostupné z: https://dx.doi.org/10.1007/978-3-030-81688-9_41.

HERMOSILLA CASAJÚS, Pedro, Marco SCHÄFER, Matěj LANG, Gloria FACKELMANN, Pere-Pau VÁZQUEZ ALCOCER, Barbora KOZLÍKOVÁ, Michael KRONE, Tobias RITSCHEL a Timo ROPINSKI. Intrinsic-Extrinsic Convolution and Pooling for Learning on 3D Protein Structures. In International Conference on Learning Representations (ICLR). 2021.

CHATTERJEE, Krishnendu, Ehsan Kafshdar GOHARSHADY, Petr NOVOTNÝ a Djordje ŽIKELIĆ. Proving non-termination by program reversal. Online. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). New York, NY, USA: ACM, 2021, s. 1033-1048. ISBN 978-1-4503-8391-2. Dostupné z: https://dx.doi.org/10.1145/3453483.3454093.

WALLNER, Günter, Marnix van WIJLAND, Regina BERNHAUPT a Simone KRIGLSTEIN. What Players Want: Information Needs of Players on Post-Game Visualizations. Online. In CHI Conference on Human Factors in Computing Systems (CHI '21). New York: Association for Computing Machinery, 2021, s. 1-13. ISBN 978-1-4503-8096-6. Dostupné z: https://dx.doi.org/10.1145/3411764.3445174.

KLAŠKA, David, Antonín KUČERA a 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, s. 629-637. ISBN 978-1-4503-7518-4. Dostupné z: https://dx.doi.org/10.5555/3398761.3398837.

BENEŠ, Nikola, Luboš BRIM, Jakub KADLECAJ, Samuel PASTVA a David ŠAFRÁNEK. AEON: Attractor Bifurcation Analysis of Parametrised Boolean Networks. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification. CAV 2020. LNCS 12224. Cham: Springer, Cham, 2020, s. 569-581. ISBN 978-3-030-53287-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53288-8_28.

BENDÍK, Jaroslav a Kuldeep S. MEEL. Approximate Counting of Minimal Unsatisfiable Subsets. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020. Neuveden: Springer, Cham, 2020, s. 439-462. ISBN 978-3-030-53287-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53288-8_21.

KUČERA, Antonín, Jérôme LEROUX a Dominik VELAN. Efficient Analysis of VASS Termination Complexity. Online. In Holger Hermanns, Lijun Zhang, Naoki Kobayashi, Dale Miller. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, USA: ACM, 2020, s. 676-688. ISBN 978-1-4503-7104-9. Dostupné z: https://dx.doi.org/10.1145/3373718.3394751.

BLONDIN, Michael, Javier ESPARZA, Martin HELFRICH, Antonín KUČERA a Philipp MEYER. Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. In Shuvendu K. Lahiri, Chao Wang. Computer Aided Verification, CAV 2020. Cham, Německo: Springer International Publishing, 2020, s. 372-397. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_20.

DĘBSKI, Michał Karol, Stefan FELSNER, Piotr MICEK a Felix SCHRÖDER. Improved bounds for centered colorings. Online. In Shuchi Chawla. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Not specified: SIAM, 2020, s. 2212-2226. ISBN 978-1-61197-599-4. Dostupné z: https://dx.doi.org/10.1137/1.9781611975994.136.

CHATTERJEE, Krishnendu, Martin CHMELÍK, Deep KARKHANIS, Petr NOVOTNÝ a Amélie ROYER. Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. Online. In Proceedings of the International Conference on Automated Planning and Scheduling. Palo Alto: AAAI Press, 2020, s. 48-56. ISBN 978-1-57735-824-4.

BLAHOUDEK, František, Tomáš BRÁZDIL, Petr NOVOTNÝ, Melkior ORNIK, Pranay THANGEDA a Ufuk TOPCU. Qualitative Controller Synthesis for Consumption Markov Decision Processes. In Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}. Cham: Springer, 2020, s. 421-447. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_22.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Petr NOVOTNÝ a Jiří VAHALA. Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. Online. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. Palo Alto, California, USA: AAAI Press, 2020, s. 9794-9801. ISBN 978-1-57735-823-7. Dostupné z: https://dx.doi.org/10.1609/aaai.v34i06.6531.

BLAHOUDEK, František, Alexandre DURET-LUTZ a Jan STREJČEK. Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization. Online. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II. Cham (Switzerland): Springer, 2020, s. 15-27. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_2.

NIFORATOS, Evangelos, Adam PALMA, Roman GLUSZNY, Athanasios VOURVOPOULOS a Fotios LIAROKAPIS. Would You Do It?: Enacting Moral Dilemmas in Virtual Reality for Understanding Ethical Decision-Making. Online. In Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems. New York, NY, USA: ACM, 2020, s. 1-12. ISBN 978-1-4503-6708-0. Dostupné z: https://dx.doi.org/10.1145/3313831.3376788.

ŠKOLA, Filip a Fotis LIAROKAPIS. Examining And Enhancing The Illusory Touch Perception In Virtual Reality Using Non-Invasive Brain Stimulation. Online. In Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, Paper No. 247. Glasgow, Scotland Uk: ACM Press, 2019, s. 1-12. ISBN 978-1-4503-5970-2. Dostupné z: https://dx.doi.org/10.1145/3290605.3300477.

CHREN, Stanislav, Barbora BÜHNOVÁ, Martin MACÁK, Lukáš DAUBNER a Bruno ROSSI. Mistakes in UML Diagrams: Analysis of Student Projects in a Software Engineering Course. Online. In Sarah Beecham, Daniela Damian. Proceedings of the 41st International Conference on Software Engineering: Software Engineering Education and Training. Piscataway, NJ, USA: IEEE Press, 2019, s. 100-109. ISBN 978-1-7281-1000-4. Dostupné z: https://dx.doi.org/10.1109/ICSE-SEET.2019.00019.

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

CALZAVARA, Stefano, Riccardo FOCARDI, Matúš NEMEC, Alvise RABITTI a Marco SQUARCINA. Postcards from the Post-HTTP World: Amplification of HTTPS Vulnerabilities in the Web Ecosystem. Online. In Proceedings of the 40th IEEE Symposium on Security and Privacy. San Fransisco, CA, US: IEEE, 2019, s. 281-298. ISBN 978-1-5386-6660-9. Dostupné z: https://dx.doi.org/10.1109/SP.2019.00053.

JONÁŠ, Martin a Jan STREJČEK. Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors. Online. In Isil Dillig, Serdar Tasiran. CAV 2019: Computer Aided Verification. Cham (Switzerland): Springer, 2019, s. 64-73. ISBN 978-3-030-25542-8. Dostupné z: https://dx.doi.org/10.1007/978-3-030-25543-5_4.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Online. In Peter Stone. Proceedings of the AAAI Conference on Artificial Intelligence. USA: AAAI Press, 2019, s. 1477-1484. ISBN 978-1-57735-809-1. Dostupné z: https://dx.doi.org/10.1609/aaai.v33i01.33011477.

EIBEN, Eduard, Robert GANIAN, Iyad KANJ a Stefan SZEIDER. The Parameterized Complexity of Cascading Portfolio Scheduling. Online. In Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alche-Buc and Emily B. Fox and Roman Garnett. Advances in Neural Information Processing Systems 32 (NIPS 2019). USA: Neural Information Processing Systems Foundation, Inc., 2019, s. 7666-7676. ISBN 978-1-7281-1044-8.

ALECHINA, Natasha, Tomáš BRÁZDIL, Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN a Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI, 2019, s. 2646-2653. ISBN 978-1-57735-809-1. Dostupné z: https://dx.doi.org/10.1609/aaai.v33i01.33012646.

EIBEN, Eduard, Robert GANIAN a Sebastian ORDYNIAK. A Structural Approach to Activity Selection. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI). USA: ijcai.org, 2018, s. 203-209. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/28.

KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER a 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, s. 659-666. ISBN 978-1-5108-6808-3. Dostupné z: https://dx.doi.org/10.5555/3237383.3237481.

KŘETÍNSKÝ, Jan a 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, s. 609-618. ISBN 978-1-4503-5583-4. Dostupné z: https://dx.doi.org/10.1145/3209108.3209176.

CHALUPA, Marek, Krishnendu CHATTERJEE, Andreas PAVLOGIANNIS, Nishant SINHA a Kapil VAIDYA. Data-centric Dynamic Partial Order Reduction. In Proceedings of Symposium on Principles of Programming Languages 2018. New York: ACM, 2018, s. 1-30. ISSN 2475-1421. Dostupné z: https://dx.doi.org/10.1145/3158119.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ, Dominik VELAN a 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, s. 185-194. ISBN 978-1-4503-5583-4. Dostupné z: https://dx.doi.org/10.1145/3209108.3209191.

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK a Stefan SZEIDER. Parameterized Algorithms for the Matrix Completion Problem. Online. In Jennifer G. Dy, Andreas Krause. Proceedings of the 35th International Conference on Machine Learning (ICML). USA: PMLR, 2018, s. 1642-1651. ISBN 978-1-5108-6796-3.

SCHMID, Stefan a Jiří SRBA. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. Online. In IEEE International Conference on Computer Communications (INFOCOM'18). USA: IEEE, 2018, s. 1799-1807. ISBN 978-1-5386-4128-6. Dostupné z: https://dx.doi.org/10.1109/INFOCOM.2018.8486261.

BRÁZDIL, Tomáš, Antonín KUČERA a 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, s. 121-127. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/17.

BOENNELAND, Frederik M., Peter G. JENSEN, Kim G. LARSEN, Marco MUNIZ a Jiří SRBA. Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. In Proceedings of the 30th International Conference on Computer Aided Verification (CAV'18). Netherlands: Springer, 2018, s. 527-546. ISBN 978-3-319-96144-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-96145-3_28.

KIM, Doowon, Bum Jun KWON, Kristián KOZÁK, Christopher GATES a Tudor DUMITRAȘ. The Broken Shield: Measuring Revocation Effectiveness in the Windows Code-Signing PKI. Online. In 27th USENIX Security Symposium (USENIX Security 18). Baltimore, MD: USENIX Association, 2018, s. 851-868. ISBN 978-1-931971-46-1.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Unary Integer Linear Programming with Structural Restrictions. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. USA: ijcai.org, 2018, s. 1284-1290. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/179.

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

MAVROUDIS, Vasilios, Andrea CERULLI, Petr ŠVENDA, Daniel CVRČEK, Dušan KLINEC a George DANEZIS. A Touch of Evil: High-Assurance Cryptographic Hardware from Untrusted Components. Online. In ACM. CCS '17: Proceedings of the 24th ACM SIGSAC Conference on Computer and Communications Security. Dallas, TX, USA: ACM, 2017, s. 1583-1600. ISBN 978-1-4503-4946-8. Dostupné z: https://dx.doi.org/10.1145/3133956.3133961.

GANIAN, Robert, M.S. RAMANUJAN a Sebastian ORDYNIAK. Going Beyond Primal Treewidth for {(M)ILP}. Online. In Satinder P. Singh; Shaul Markovitch. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. USA: AAAI, 2017, s. 815-821. ISBN 978-1-57735-781-0.

BENEŠ, Nikola, Luboš BRIM, Martin DEMKO, Samuel PASTVA a David ŠAFRÁNEK. Pithya: A Parallel Tool for Parameter Synthesis of Piecewise Multi-Affine Dynamical Systems. In Rupak Majumdar and Viktor Kunčak. Computer Aided Verification. CAV 2017. LNCS 10426. Cham: Springer International Publishing, 2017, s. 591-598. ISBN 978-3-319-63386-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-63387-9_29.

DVORAK, Pavel, Eduard EIBEN, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Online. In Carles Sierra. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017. USA: ijcai.org, 2017, s. 607-613. ISBN 978-0-9992411-0-3. Dostupné z: https://dx.doi.org/10.24963/ijcai.2017/85.

NEMEC, Matúš, Marek SÝS, Petr ŠVENDA, Dušan KLINEC a 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, s. 1631-1648. ISBN 978-1-4503-4946-8. Dostupné z: https://dx.doi.org/10.1145/3133956.3133969.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016. New York, NY, USA: ACM, 2016, s. 176-184. ISBN 978-1-4503-4391-6. Dostupné z: https://dx.doi.org/10.1145/2933575.2935314.

DUPONT DUPUIS, Frédéric, Serge FEHR, Philippe LAMONTAGNE a Louis SALVAIL. Adaptive versus non-adaptive strategies in the quantum setting with applications. Online. In Robshaw, Matthew and Katz, Jonathan. Proceedings of CRYPTO 2016. Santa Barbara, CA: Springer Berlin Heidelberg, 2016, s. 33-59. ISBN 978-3-662-53014-6. Dostupné z: https://dx.doi.org/10.1007/978-3-662-53015-3_2.

SICKERT, Salomon, Javier ESPARZA, Stefan JAAX a Jan KŘETÍNSKÝ. Limit-Deterministic Büchi Automata for Linear Temporal Logic. In Computer Aided Verification - 28th International Conference, CAV 2016. Switzerland: Springer, 2016, s. 312-332. ISBN 978-3-319-41539-0. Dostupné z: https://dx.doi.org/10.1007/978-3-319-41540-6_17.

KUČERA, Antonín a Tomáš LAMSER. Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. In Catholijn M. Jonker, Stacy Marsella, John Thangarajah, Karl Tuyls. Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. New York: ACM, 2016, s. 1171-1179. ISBN 978-1-4503-4239-1.

GANIAN, Robert a Sebastian ORDYNIAK. The Complexity Landscape of Decompositional Parameters for ILP. Online. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press, 2016, s. 710-716. ISBN 978-1-57735-760-5.

ŠVENDA, Petr, Matúš NEMEC, Peter SEKAN, Rudolf KVAŠŇOVSKÝ, David FORMÁNEK, David KOMÁREK a Václav MATYÁŠ. The Million-Key Question – Investigating the Origins of RSA Public Keys. Online. In Thorsten Holz, Stefan Savage. Proceedings of 25th USENIX Security Symposium. Austin, Texas: USENIX Association, 2016, s. 893-910. ISBN 978-1-931971-32-4.

GANIAN, Robert, Sebastian ORDYNIAK a Eduard EIBEN. Using Decomposition-Parameters for QBF: Mind the Prefix!. Online. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press, 2016, s. 964-970. ISBN 978-1-57735-760-5.

ABATE, Alessandro, Milan ČEŠKA, Luboš BRIM a Marta KWIATKOWSKA. Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks. In 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings. LNCS 9206. Berlin: Springer International Publishing, 2015, s. 195-213. ISBN 978-3-319-21689-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-21690-4_12.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Andreas FELLNER a Jan KŘETÍNSKÝ. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer, 2015, s. 158-177. ISBN 978-3-319-21689-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-21690-4_10.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, M.S. RAMANUJAN, Daniel LOKSHTANOV a Saket SAURABH. FO Model Checking on Posets of Bounded Width. Online. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society, 2015, s. 963-974. ISBN 978-1-4673-8191-8. Dostupné z: https://dx.doi.org/10.1109/FOCS.2015.63.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a Petr NOVOTNÝ. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. In Neuveden. 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. Neuveden: IEEE, 2015, s. 44-55. ISBN 978-1-4799-8875-4. Dostupné z: https://dx.doi.org/10.1109/LICS.2015.15.

BABIAK, Tomáš, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, Jan KŘETÍNSKÝ, David MÜLLER, David PARKER a Jan STREJČEK. The Hanoi Omega-Automata Format. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer, 2015, s. 479-486. ISBN 978-3-319-21689-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-21690-4_31.

CHATTERJEE, Krishnendu, Zuzana KOMÁRKOVÁ a Jan KŘETÍNSKÝ. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Thirtieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Los Alamitos, California: IEEE, 2015, s. 244-256. ISBN 978-1-4799-8875-4. Dostupné z: https://dx.doi.org/10.1109/LICS.2015.32.

KRONEGGER, Martin, Sebastian ORDYNIAK a Andreas PFANDLER. Variable-Deletion Backdoors to Planning. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Austin; United States: AI Access Foundation, 2015, s. 3305-3312. ISBN 978-1-57735-703-2.

GASPERS, Serge, Sebastian ORDYNIAK, Stefan SZEIDER, Neelhara MISRA a Stanislav ZIVNY. Backdoors into Heterogeneous Classes of SAT and CSP. In Carla E. Brodley and Peter Stone. AAAI Press. Quebec: AAAI Press, 2014, s. 2652-2658. ISBN 978-1-57735-680-6.

KRONEGGER, Martin, Sebastian ORDYNIAK a Andreas PFANDLER. Backdoors to Planning. In Carla E. Brodley and Peter Stone. AAAI Press. Quebec: AAAI Press, 2014, s. 2300-2307. ISBN 978-1-57735-679-0.

ESPARZA, Javier a Jan KŘETÍNSKÝ. From LTL to Deterministic Automata: A Safraless Compositional Approach. In Computer Aided Verification - 26th International Conference, CAV 2014. Heidelberg Dordrecht London New York: Springer, 2014, s. 192-208. ISBN 978-3-319-08866-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-08867-9_13.

BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA a Petr NOVOTNÝ. Minimizing Running Costs in Consumption Systems. In Armin Biere, Roderick Bloem. Computer Aided Verification. Neuveden: Springer International Publishing, 2014, s. 457-472. ISBN 978-3-319-08866-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-08867-9_30.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ a Joost-Pieter KATOEN. Zero-reachability in probabilistic multi-counter automata. Online. In Thomas Henzinger and Dale Miller. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: ACM, 2014, s. nestránkováno, 10 s. ISBN 978-1-4503-2886-9. Dostupné z: https://dx.doi.org/10.1145/2603088.2603161.

CHATTERJEE, Krishnendu, Andreas GAISER a Jan KŘETÍNSKÝ. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. In Computer Aided Verification - 25th International Conference, CAV 2013. Heidelberg Dordrecht London New York: Springer, 2013, s. 559-575. ISBN 978-3-642-39798-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39799-8_37.

BARNAT, Jiří, Luboš BRIM, Vojtěch HAVEL, Jan HAVLÍČEK, Jan KRIHO, Milan LENČO, Petr ROČKAI, Vladimír ŠTILL a Jiří WEISER. DiVinE 3.0 -- An Explicit-State Model Checker for Multithreaded C & C++ Programs. In Sharygina, Natasha; Veith, Helmut. Computer Aided Verification 2013. Heidelberg: Springer, 2013, s. 863-868. ISBN 978-3-642-39798-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39799-8_60.

BRIM, Luboš, Milan ČEŠKA, Sven DRAŽAN a David ŠAFRÁNEK. Exploring Parameter Space of Stochastic Biochemical Systems Using Quantitative Model Checking. In 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Berlin: Springer Berlin Heidelberg, 2013, s. 107-123. ISBN 978-3-642-39798-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39799-8_7.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT a Antonín KUČERA. Trading Performance for Stability in Markov Decision Processes. In Proceedings of 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013). London: IEEE Computer Society, 2013, s. 331-340. ISBN 978-1-4799-0413-6. Dostupné z: https://dx.doi.org/10.1109/LICS.2013.39.