Výpis publikací

JONÁŠ, Martin, Kristián KUMOR, Jakub NOVÁK, Jindřich SEDLÁČEK, Marek TRTÍK, Lukáš ZAORAL, Paulína AYAZIOVÁ a 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, s. 406-411. ISBN 978-3-031-57255-5. Dostupné z: https://dx.doi.org/10.1007/978-3-031-57256-2_29.

JANKOLA, Marek a 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, s. 234-255. ISBN 978-3-031-57227-2. Dostupné z: https://dx.doi.org/10.1007/978-3-031-57228-9_12.

AYAZIOVÁ, Paulína a 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, s. 341-346. ISBN 978-3-031-57255-5. Dostupné z: https://dx.doi.org/10.1007/978-3-031-57256-2_18.

AYAZIOVÁ, Paulína a 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, s. 523-528. ISBN 978-3-031-30819-2. Dostupné z: https://dx.doi.org/10.1007/978-3-031-30820-8_30.

BEYER, Dirk a Jan STREJČEK. Case Study on Verification-Witness Validators: Where We Are and Where We Go. Online. In Gagandeep Singh, Caterina Urban. Static Analysis - 29th International Symposium, SAS 2022, Auckland, New Zealand, December 5–7, 2022, Proceedings. Cham (Switzerland): Springer, 2022, s. 160-174. ISBN 978-3-031-22307-5. Dostupné z: https://dx.doi.org/10.1007/978-3-031-22308-2_8.

CHALUPA, Marek, Vincent MIHALKOVIČ, Anna ŘECHTÁČKOVÁ, Lukáš ZAORAL a Jan STREJČEK. Symbiotic 9: String Analysis and Backward Symbolic Execution with Loop Folding. Online. In Dana Fisman and Grigore Rosu. Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2022, s. 462-467. ISBN 978-3-030-99526-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-99527-0_32.

AYAZIOVÁ, Paulína, Marek CHALUPA a Jan STREJČEK. Symbiotic-Witch: A Klee-Based Violation Witness Checker. Online. In Dana Fisman and Grigore Rosu. Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2022, s. 468-473. ISBN 978-3-030-99526-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-99527-0_33.

CHALUPA, Marek, Tomáš JAŠEK, Jakub NOVÁK, Anna ŘECHTÁČKOVÁ, Veronika ŠOKOVÁ a Jan STREJČEK. Symbiotic 8. 2021.

CHALUPA, Marek, Tomáš JAŠEK, Lukáš TOMOVIČ, Martin HRUŠKA, Veronika ŠOKOVÁ, Paulína AYAZIOVÁ, Jan STREJČEK a Tomáš VOJNAR. Symbiotic 7: Integration of Predator and More (Competition Contribution). In Armin Biere, David Parker. Tools and Algorithms for the Construction and Analysis of Systems. Německo: Springer, 2020, s. 413-417. ISBN 978-3-030-45236-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-45237-7_31.

BENEŠ, Nikola, Milan KŘIVÁNEK a Filip ŠTEFAŇÁK. Space Effective Model Checking for Component-Interaction Automata. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Dagstuhl, Německo: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Německo, 2009, 8 s. ISBN 978-3-939897-15-6.

ZIMMEROVÁ, Barbora, Pavlína VAŘEKOVÁ, Nikola BENEŠ, Ivana ČERNÁ, Luboš BRIM a Jiří SOCHOR. Component-Interaction Automata Approach (CoIn). In The Common Component Modeling Example: Comparing Software Component Models. Berlin / Heidelberg, Germany: Springer Verlag, 2008, s. 146-176. LNCS 5153. ISBN 978-3-540-85288-9.

VALOUCH, Petr a Jaroslav SEDLÁČEK. Empirické ověření platnosti teorie optimální kapitálové struktury firmy v České republice. In Sborník příspěvků z mezinárodní vědecké konference Evropské finanční systémy 2007. 1. vyd. Brno: ESF MU, 2007, s. 419-427. ISBN 978-80-210-4319-0.

ZIMMEROVÁ, Barbora a Pavlína VAŘEKOVÁ. Reflecting Creation and Destruction of Instances in CBSs Modelling and Verification. In MEMICS proceedings. Brno, Czech Republic: Ing. Zdeněk Novotný CSc., 2007, s. 257-264. ISBN 978-80-7355-077-6.

VAŘEKOVÁ, Pavlína a Barbora ZIMMEROVÁ. Subject-observer specification with component-interaction automata. In Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering. New York, NY, USA: ACM Press, 2007, s. 75-81. ISBN 978-1-59593-721-6.

BRIM, Luboš, Ivana ČERNÁ, Pavlína VAŘEKOVÁ a Barbora ZIMMEROVÁ. Component-Interaction Automata as a Verification-Oriented Component-Based System Specification. Software engineering notes : an informal newsletter of the Special Interest Committee on Software Engineering. [New York, N.Y.?]: ACM, 2006, roč. 31, č. 2, s. 1-8. ISSN 0163-5948.

ČERNÁ, Ivana, Pavlína VAŘEKOVÁ a Barbora ZIMMEROVÁ. Component-Interaction Automata Modelling Language. Brno, Czech Republic: Faculty of Informatics, Masaryk University, 2006. Technical report FIMU-RS-2006-08.

PELÁNEK, Radek, Kim G. LARSEN, Gerd BEHRMANN a Patricia BOUYER. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata. International Journal on Software Tools for Technology Transfer (STTT). Springer-Verlag GmbH, 2006, roč. 8, č. 3, s. 204-215. ISSN 1433-2779.

BRIM, Luboš, Ivana ČERNÁ, Pavlína VAŘEKOVÁ a Barbora ZIMMEROVÁ. Component-Interaction Automata as a Verification-Oriented Component-Based System Specification. In Proceedings of SAVCBS 2005. Ames, USA: Department of Computer Science, Iowa State University, 2005, s. 31-38.

VAŘEKOVÁ, Pavlína a Barbora ZIMMEROVÁ. Component-Interaction Automata for Specification and Verification of Component Interactions. In IFM 2005 Doctoral Symposium on Integrated Formal Methods. Eindhoven, The Netherlands: Technische Universiteit Eindhoven (TU/e), 2005, s. 71-75.

HUTTEL, Hans a Jiří SRBA. Recursion vs. Replication in Simple Cryptographic Protocols. In Proceedings of 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05). Netherlands: Springer-Verlag, 2005, s. 175-184.

MORAVANSKÝ, Dalibor a Daniel NĚMEC. Tests of Heteroskedasticity and Eventual Conflicts among Them. In Proceedings of the 23rd International Conference Mathematical Methods in Economics 2005. Hradec Králové: GAUDEAMUS Univerzita Hradec Králové, 2005, s. 279-287. ISBN 978-80-7041-535-1.

SRBA, Jiří. Timed-Arc Petri Nets vs. Networks of Timed Automata. In Proceedings of the 26th International Conference on Application and Theory of {P}etri Nets (ICATPN 2005). Netherlands: Springer-Verlag, 2005, s. 385-402.

KUČERA, Antonín a Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. P. Gardner, N. Yoshida (Eds.). In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin: Springer, 2004, s. 371-386. ISBN 3-540-22940-X.

BRIM, Luboš. 3rd International Workshop on Parallel and Distributed Methods in verifiCation (PDMC'04). 2004.

JANČAR, Petr, Antonín KUČERA a Faron MOLLER. Deciding Bisimilarity between BPA and BPP Processes. R. Amadio, D. Lugiez (Eds.). In Proceedings of 14th International Conference on Concurrency Theory (CONCUR 2003). Berlin: Springer, 2003, s. 159-174. ISBN 3-540-40753-7.

BRIM, Luboš a Jiří BARNAT. Distribution of Explicit-State LTL Model-Checking. Editors Thomas Arts, Wan Fokking. Electronic Notes in Theoretical Computer Science. Elsevier Science, 2003, Volume 80, č. 1, s. 120-125.

BRIM, Luboš a Jitka ŽÍDKOVÁ. Using Assumptions to Distribute Alternation Free mu-Calculus Model Checking. In 2st International Workshop on Parallel and Distributed Model Checking (PDMC 2003). Boulder, Colorado, USA. Brno, Czech Republic: Elsevier, 2003, s. 19-34.

ŽÍDKOVÁ, Jitka. Using Assumptions to Distribute Model Checking. In Počítačové Architektury & Diagnostika. Brno, Česká republika: Vysoké učení technické v Brně, Fakulta Informačních technologií, Ustav počítačových systémů, 2003, s. 73-78. ISBN 80-214-2471-0.

BRIM, Luboš. Automatizovaná formální verifikace. In XXI. conference EurOpen 2002. Znojmo, Czech republic. Znojmo, Czech Republic: EuroOpen.cz, Praha, 2002, s. 1-7. ISBN 80-86583-00-7.

MATYÁŠ, Václav, Roman RAK a Zdeněk ŘÍHA. Biometrická identifikace a verifikace II - Základní kritéria měření výkonnosti biometrických metod. Data Security Management. Praha: Tate International, 2002, VI., č. 3, s. 32-35. ISSN 1211-8737.

KUČERA, Antonín a Richard MAYR. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. K. Diks, W. Rytter (Eds.). In Proceedings of 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002). Berlin: Springer, 2002, s. 433-445. ISBN 3-540-44040-2.

BARNAT, Jiří, Luboš BRIM a Ivana ČERNÁ. Property Driven Distribution of Nested DFS. In M. Leuschel and U. Ultes-Nitsche (Eds.): Proceedings of the 3rd International Workshop on Verification and Computational Logic. Pittsburgh, PA, USA: Dept. of Electronics and Computer Science, University of Southampton, 2002, s. 1-10.

KUČERA, Antonín a Jan STREJČEK. The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. J. Bradfield (Ed.). In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02). Berlin: Springer, 2002, s. 276-291. ISBN 3-540-44240-5.

BRIM, Luboš, Jitka CRHOVÁ a Karen YORAV. Using Assumptions to Distribute CTL Model Checking. In 1st International Workshop on Parallel and Distributed Model Checking (PDMC 2002). Brno, Czech Republic: Elsevier, 2002, s. 80-95. ISBN 0444512918.

BARNAT, Jiří. Using verified property to partition the state space in LTL model-checking. In F. Cassez, C. Jard, F. Laroussinie, and M.D. Ryan (Eds.): Modelling and Verification of Parallel processes. Nantes, France: IRCCyN, Ecole Centrale de Nantes, 2002, s. 262-267.

KUČERA, Antonín a Richard MAYR. Why is Simulation Harder Than Bisimulation? L. Brim, P. Jancar, M. Kretinsky, A. Kucera (Eds.). In Proceedings of 13th International Conference on Concurrency Theory (CONCUR 2002). Berlin: Springer, 2002, s. 594-609. ISBN 3-540-44043-7.

BARNAT, Jiří, Luboš BRIM a Jitka STŘÍBRNÁ. Distributed LTL Model-Checking in SPIN. In M.B. Dwyer (Ed.): Model Checking Software, 8th International SPIN Workshop. Toronto, Canada: Springer Verlag, 2001, s. 200-215. ISBN 3-540-42124-6.

BARNAT, Jiří, Luboš BRIM a Jitka STŘÍBRNÁ. Distributed LTL Model-Checking in SPIN. Brno: FI MU, 2000, 16 s. Technical Reports.

KUČERA, Antonín a Javier ESPARZA. A Logical Viewpoint on Process-Algebraic Quotients. J. Flum, M. Rodríguez-Artalejo (Eds.). In Computer Science Logic; Proceedings of 8th Annual Conference of the EACSL (CSL´99). Berlin: Springer, 1999, s. 499-514. Lecture Notes in Computer Science, vol. 1683. ISBN 3-540-66536-6.

KUČERA, Antonín a Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin: Springer, 1999, s. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4.