var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://leventebajczi.github.io/publications.bib\",\"jsonp\":\"1\",\"theme\":\"side\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"C for Yourself: Comparison of Front-End Techniques for Formal Verification\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bajczi\"],\"firstnames\":[\"Levente\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ádám\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]}],\"booktitle\":\"2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)\",\"doi\":\"10.1145/3524482.3527646\",\"unique-id\":\"32836583\",\"year\":\"2022\",\"orcid-numbers\":\"Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Molnár, Vince/0000-0002-8204-7595\",\"abstract\":\"With the improvement of hardware and algorithms, the main challenge of software model checking has shifted from pure algorithmic performance toward supporting a wider set of input programs. Successful toolchains tackle the problem of parsing a wide range of inputs in an efficient way by reusing solutions from existing compiler technologies such as Eclipse CDT or LLVM. Our experience suggests that well-established techniques in compiler technology are not necessarily beneficial to model checkers and sometimes can even hurt their performance. In this paper, we review the tools mature enough to participate in the Software Verification Competition in terms of the employed analysis and frontend techniques. We find that successful tools do exhibit a bias toward certain combinations. We explore the theoretical reasons and suggest an adaptable approach for model checking frameworks. We validate our recommendations by implementing a new frontend for a model checking framework and show that it indeed benefits some of the algorithms.\",\"url_pdf\":\"https://leventebajczi.github.io/publications/formalise22.pdf\",\"url_slides\":\"https://leventebajczi.github.io/publications/slides/formalise22.pdf\",\"url_mtmt\":\"https://m2.mtmt.hu/api/publication/32836583\",\"bibtex\":\"@inproceedings{MTMT:32836583,\\n\\ttitle = {C for Yourself: Comparison of Front-End Techniques for Formal Verification},\\n\\tauthor = {Bajczi, Levente and Ádám, Zsófia and Molnár, Vince},\\n\\tbooktitle = {2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)},\\n\\tdoi = {10.1145/3524482.3527646},\\n\\tunique-id = {32836583},\\n\\tyear = {2022},\\n\\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Molnár, Vince/0000-0002-8204-7595},\\n\\tabstract = {With the improvement of hardware and algorithms, the main challenge of software model checking has shifted from pure algorithmic performance toward supporting a wider set of input programs. Successful toolchains tackle the problem of parsing a wide range of inputs in an efficient way by reusing solutions from existing compiler technologies such as Eclipse CDT or LLVM. Our experience suggests that well-established techniques in compiler technology are not necessarily beneficial to model checkers and sometimes can even hurt their performance. In this paper, we review the tools mature enough to participate in the Software Verification Competition in terms of the employed analysis and frontend techniques. We find that successful tools do exhibit a bias toward certain combinations. We explore the theoretical reasons and suggest an adaptable approach for model checking frameworks. We validate our recommendations by implementing a new frontend for a model checking framework and show that it indeed benefits some of the algorithms.},\\n\\n    url_pdf    = {https://leventebajczi.github.io/publications/formalise22.pdf},\\n    url_slides = {https://leventebajczi.github.io/publications/slides/formalise22.pdf},\\n\\turl_mtmt = {https://m2.mtmt.hu/api/publication/32836583},\\n}\\n\\n\",\"author_short\":[\"Bajczi, L.\",\"Ádám, Z.\",\"Molnár, V.\"],\"key\":\"MTMT:32836583\",\"id\":\"MTMT:32836583\",\"bibbaseid\":\"bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://leventebajczi.github.io/publications/formalise22.pdf\",\" slides\":\"https://leventebajczi.github.io/publications/slides/formalise22.pdf\",\" mtmt\":\"https://m2.mtmt.hu/api/publication/32836583\"},\"metadata\":{\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bajczi\"],\"firstnames\":[\"Levente\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Vörös\"],\"firstnames\":[\"András\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]}],\"doi\":\"10.1145/3358238\",\"journal-iso\":\"ACM T EMBED COMPUT S\",\"journal\":\"ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS\",\"volume\":\"18\",\"unique-id\":\"30865515\",\"issn\":\"1539-9087\",\"abstract\":\"Formal verification is approaching a point where it will be reliably applicable to embedded software. Even though formal verification can efficiently analyze multi-threaded applications, multi-core processors are often considered too dangerous to use in critical systems, despite the many benefits they can offer. One reason is the advanced memory consistency model of such CPUs. Nowadays, most software verifiers assume strict sequential consistency, which is also the naïve view of programmers. Modern multi-core processors, however, rarely guarantee this assumption by default. In addition, complex processor architectures may easily contain design faults. Thanks to the recent advances in hardware verification, these faults are increasingly visible and can be detected even in existing processors, giving an opportunity to compensate for the problem in software. In this paper, we propose a generic approach to consider inconsistent behavior of the hardware in the analysis of software. Our approach is based on formal methods and can be used to detect the activation of existing hardware faults on the application level and facilitate their mitigation in software. The approach relies heavily on recent results of model checking and hardware verification and offers new, integrative research directions. We propose a partial solution based on existing model checking tools to demonstrate feasibility and evaluate their performance in this context.\",\"year\":\"2019\",\"eissn\":\"1558-3465\",\"orcid-numbers\":\"Bajczi, Levente/0000-0002-6551-5860; Molnár, Vince/0000-0002-8204-7595\",\"url_pdf\":\"https://leventebajczi.github.io/publications/emsoft19.pdf\",\"url_slides\":\"https://leventebajczi.github.io/publications/slides/emsoft19.pdf\",\"url_mtmt\":\"https://m2.mtmt.hu/api/publication/30865515\",\"bibtex\":\"@article{MTMT:30865515,\\n\\ttitle = {Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software},\\n\\tauthor = {Bajczi, Levente and Vörös, András and Molnár, Vince},\\n\\tdoi = {10.1145/3358238},\\n\\tjournal-iso = {ACM T EMBED COMPUT S},\\n\\tjournal = {ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS},\\n\\tvolume = {18},\\n\\tunique-id = {30865515},\\n\\tissn = {1539-9087},\\n\\tabstract = {Formal verification is approaching a point where it will be reliably applicable to embedded software. Even though formal verification can efficiently analyze multi-threaded applications, multi-core processors are often considered too dangerous to use in critical systems, despite the many benefits they can offer. One reason is the advanced memory consistency model of such CPUs. Nowadays, most software verifiers assume strict sequential consistency, which is also the naïve view of programmers. Modern multi-core processors, however, rarely guarantee this assumption by default. In addition, complex processor architectures may easily contain design faults. Thanks to the recent advances in hardware verification, these faults are increasingly visible and can be detected even in existing processors, giving an opportunity to compensate for the problem in software. In this paper, we propose a generic approach to consider inconsistent behavior of the hardware in the analysis of software. Our approach is based on formal methods and can be used to detect the activation of existing hardware faults on the application level and facilitate their mitigation in software. The approach relies heavily on recent results of model checking and hardware verification and offers new, integrative research directions. We propose a partial solution based on existing model checking tools to demonstrate feasibility and evaluate their performance in this context.},\\n\\tyear = {2019},\\n\\teissn = {1558-3465},\\n\\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Molnár, Vince/0000-0002-8204-7595},\\n\\n    url_pdf    = {https://leventebajczi.github.io/publications/emsoft19.pdf},\\n    url_slides = {https://leventebajczi.github.io/publications/slides/emsoft19.pdf},\\n\\turl_mtmt = {https://m2.mtmt.hu/api/publication/30865515},\\t\\n}\\n\\n\",\"author_short\":[\"Bajczi, L.\",\"Vörös, A.\",\"Molnár, V.\"],\"key\":\"MTMT:30865515\",\"id\":\"MTMT:30865515\",\"bibbaseid\":\"bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://leventebajczi.github.io/publications/emsoft19.pdf\",\" slides\":\"https://leventebajczi.github.io/publications/slides/emsoft19.pdf\",\" mtmt\":\"https://m2.mtmt.hu/api/publication/30865515\"},\"metadata\":{\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ádám\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Bajczi\"],\"firstnames\":[\"Levente\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dobos-Kovács\"],\"firstnames\":[\"Mihály\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hajdu\"],\"firstnames\":[\"Ákos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]}],\"doi\":\"10.1007/978-3-030-99527-0_34\",\"journal-iso\":\"LECT NOTES COMPUT SC\",\"journal\":\"LECTURE NOTES IN COMPUTER SCIENCE\",\"volume\":\"13244\",\"unique-id\":\"32801008\",\"issn\":\"0302-9743\",\"keywords\":\"Computer Science, Software Engineering\",\"year\":\"2022\",\"eissn\":\"1611-3349\",\"pages\":\"474-478\",\"orcid-numbers\":\"Ádám, Zsófia/0000-0003-2354-1750; Bajczi, Levente/0000-0002-6551-5860; Dobos-Kovács, Mihály/0000-0002-0064-2965; Hajdu, Ákos/0000-0001-8001-8865; Molnár, Vince/0000-0002-8204-7595\",\"abstract\":\"THETA is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.\",\"url_pdf\":\"https://leventebajczi.github.io/publications/tacas22.pdf\",\"url_slides\":\"https://leventebajczi.github.io/publications/slides/tacas22.pdf\",\"url_poster\":\"https://leventebajczi.github.io/publications/posters/tacas22.pdf\",\"url_mtmt\":\"https://m2.mtmt.hu/api/publication/32801008\",\"bibtex\":\"@article{MTMT:32801008,\\n\\ttitle = {Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)},\\n\\tauthor = {Ádám, Zsófia and Bajczi, Levente and Dobos-Kovács, Mihály and Hajdu, Ákos and Molnár, Vince},\\n\\tdoi = {10.1007/978-3-030-99527-0_34},\\n\\tjournal-iso = {LECT NOTES COMPUT SC},\\n\\tjournal = {LECTURE NOTES IN COMPUTER SCIENCE},\\n\\tvolume = {13244},\\n\\tunique-id = {32801008},\\n\\tissn = {0302-9743},\\n\\tkeywords = {Computer Science, Software Engineering},\\n\\tyear = {2022},\\n\\teissn = {1611-3349},\\n\\tpages = {474-478},\\n\\torcid-numbers = {Ádám, Zsófia/0000-0003-2354-1750; Bajczi, Levente/0000-0002-6551-5860; Dobos-Kovács, Mihály/0000-0002-0064-2965; Hajdu, Ákos/0000-0001-8001-8865; Molnár, Vince/0000-0002-8204-7595},\\n\\tabstract = {THETA is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.},\\n\\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas22.pdf},\\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas22.pdf},\\n    url_poster = {https://leventebajczi.github.io/publications/posters/tacas22.pdf},\\n\\turl_mtmt = {https://m2.mtmt.hu/api/publication/32801008},\\n}\\n\\n\\n\",\"author_short\":[\"Ádám, Z.\",\"Bajczi, L.\",\"Dobos-Kovács, M.\",\"Hajdu, Á.\",\"Molnár, V.\"],\"key\":\"MTMT:32801008\",\"id\":\"MTMT:32801008\",\"bibbaseid\":\"dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://leventebajczi.github.io/publications/tacas22.pdf\",\" slides\":\"https://leventebajczi.github.io/publications/slides/tacas22.pdf\",\" poster\":\"https://leventebajczi.github.io/publications/posters/tacas22.pdf\",\" mtmt\":\"https://m2.mtmt.hu/api/publication/32801008\"},\"keyword\":[\"Computer Science\",\"Software Engineering\"],\"metadata\":{\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\"downloads\":8,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution)\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bajczi\"],\"firstnames\":[\"Levente\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ádám\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Micskei\"],\"firstnames\":[\"Zoltán\",\"Imre\"],\"suffixes\":[]}],\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems\",\"doi\":\"10.1007/978-3-031-57256-2_16\",\"unique-id\":\"34768972\",\"abstract\":\"ConcurrentWitness2Test is a violation witness validator for concurrent software. Taking both nondeterminism of data and interleaving-based nondeterminism into account, the tool aims to use the metadata described in the violation witnesses to synthesize an executable test harness. While plagued by some initial challenges yet to overcome, the validation performance of ConcurrentWitness2Test corroborates the usefulness of the proposed approach.\",\"year\":\"2024\",\"pages\":\"330-334\",\"orcid-numbers\":\"Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Micskei, Zoltán Imre/0000-0003-1846-261X\",\"url_pdf\":\"https://leventebajczi.github.io/publications/tacas24cwt.pdf\",\"url_slides\":\"https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf\",\"url_mtmt\":\"https://m2.mtmt.hu/api/publication/34768972\",\"bibtex\":\"@inproceedings{MTMT:34768972,\\n\\ttitle = {ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution)},\\n\\tauthor = {Bajczi, Levente and Ádám, Zsófia and Micskei, Zoltán Imre},\\n\\tbooktitle = {Tools and Algorithms for the Construction and Analysis of Systems},\\n\\tdoi = {10.1007/978-3-031-57256-2_16},\\n\\tunique-id = {34768972},\\n\\tabstract = {ConcurrentWitness2Test is a violation witness validator for concurrent software. Taking both nondeterminism of data and interleaving-based nondeterminism into account, the tool aims to use the metadata described in the violation witnesses to synthesize an executable test harness. While plagued by some initial challenges yet to overcome, the validation performance of ConcurrentWitness2Test corroborates the usefulness of the proposed approach.},\\n\\tyear = {2024},\\n\\tpages = {330-334},\\n\\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Micskei, Zoltán Imre/0000-0003-1846-261X},\\n\\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas24cwt.pdf},\\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf},\\n    url_mtmt = {https://m2.mtmt.hu/api/publication/34768972},\\n}\\n\\n\",\"author_short\":[\"Bajczi, L.\",\"Ádám, Z.\",\"Micskei, Z. I.\"],\"key\":\"MTMT:34768972\",\"id\":\"MTMT:34768972\",\"bibbaseid\":\"bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://leventebajczi.github.io/publications/tacas24cwt.pdf\",\" slides\":\"https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf\",\" mtmt\":\"https://m2.mtmt.hu/api/publication/34768972\"},\"metadata\":{\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution)\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bajczi\"],\"firstnames\":[\"Levente\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Telbisz\"],\"firstnames\":[\"Csanád\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Somorjai\"],\"firstnames\":[\"Márk\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ádám\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dobos-Kovács\"],\"firstnames\":[\"Mihály\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Szekeres\"],\"firstnames\":[\"Dániel\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mondok\"],\"firstnames\":[\"Milán\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]}],\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems\",\"doi\":\"10.1007/978-3-031-57256-2_30\",\"unique-id\":\"34768428\",\"abstract\":\"Theta is a model checking framework, with a strong emphasis on effectively handling concurrency in software using abstraction refinement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verification using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances of Theta regarding concurrent and recursive software support.\",\"year\":\"2024\",\"pages\":\"412-417\",\"orcid-numbers\":\"Bajczi, Levente/0000-0002-6551-5860; Telbisz, Csanád/0000-0002-6260-5908; Ádám, Zsófia/0000-0003-2354-1750; Dobos-Kovács, Mihály/0000-0002-0064-2965; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Molnár, Vince/0000-0002-8204-7595\",\"url_pdf\":\"https://leventebajczi.github.io/publications/tacas24theta.pdf\",\"url_slides\":\"https://leventebajczi.github.io/publications/slides/tacas24theta.pdf\",\"url_mtmt\":\"https://m2.mtmt.hu/api/publication/34768428\",\"bibtex\":\"@inproceedings{MTMT:34768428,\\n\\ttitle = {Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution)},\\n\\tauthor = {Bajczi, Levente and Telbisz, Csanád and Somorjai, Márk and Ádám, Zsófia and Dobos-Kovács, Mihály and Szekeres, Dániel and Mondok, Milán and Molnár, Vince},\\n\\tbooktitle = {Tools and Algorithms for the Construction and Analysis of Systems},\\n\\tdoi = {10.1007/978-3-031-57256-2_30},\\n\\tunique-id = {34768428},\\n\\tabstract = {Theta is a model checking framework, with a strong emphasis on effectively handling concurrency in software using abstraction refinement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verification using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances of Theta regarding concurrent and recursive software support.},\\n\\tyear = {2024},\\n\\tpages = {412-417},\\n\\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Telbisz, Csanád/0000-0002-6260-5908; Ádám, Zsófia/0000-0003-2354-1750; Dobos-Kovács, Mihály/0000-0002-0064-2965; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Molnár, Vince/0000-0002-8204-7595},\\n\\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas24theta.pdf},\\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24theta.pdf},\\n    url_mtmt = {https://m2.mtmt.hu/api/publication/34768428},\\n}\\n\\n\",\"author_short\":[\"Bajczi, L.\",\"Telbisz, C.\",\"Somorjai, M.\",\"Ádám, Z.\",\"Dobos-Kovács, M.\",\"Szekeres, D.\",\"Mondok, M.\",\"Molnár, V.\"],\"key\":\"MTMT:34768428\",\"id\":\"MTMT:34768428\",\"bibbaseid\":\"bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://leventebajczi.github.io/publications/tacas24theta.pdf\",\" slides\":\"https://leventebajczi.github.io/publications/slides/tacas24theta.pdf\",\" mtmt\":\"https://m2.mtmt.hu/api/publication/34768428\"},\"metadata\":{\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution)\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bajczi\"],\"firstnames\":[\"Levente\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Szekeres\"],\"firstnames\":[\"Dániel\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mondok\"],\"firstnames\":[\"Milán\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ádám\"],\"firstnames\":[\"Zsófia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Somorjai\"],\"firstnames\":[\"Márk\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Telbisz\"],\"firstnames\":[\"Csanád\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Dobos-Kovács\"],\"firstnames\":[\"Mihály\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Molnár\"],\"firstnames\":[\"Vince\"],\"suffixes\":[]}],\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems\",\"doi\":\"10.1007/978-3-031-57256-2_23\",\"unique-id\":\"34768422\",\"abstract\":\"Theta is a model checking framework conventionally based on abstraction refinement techniques. While abstraction is useful for a large number of verification problems, the over-reliance on the technique led to Theta being unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to create EmergenTheta , a sandbox for the new approaches we want Theta to support. By differentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route to EmergenTheta , and its first debut on SV-COMP’24 in the ReachSafety category.\",\"year\":\"2024\",\"pages\":\"371-375\",\"orcid-numbers\":\"Bajczi, Levente/0000-0002-6551-5860; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Ádám, Zsófia/0000-0003-2354-1750; Telbisz, Csanád/0000-0002-6260-5908; Dobos-Kovács, Mihály/0000-0002-0064-2965; Molnár, Vince/0000-0002-8204-7595\",\"url_pdf\":\"https://leventebajczi.github.io/publications/tacas24etheta.pdf\",\"url_slides\":\"https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf\",\"url_mtmt\":\"https://m2.mtmt.hu/api/publication/34768422\",\"bibtex\":\"@inproceedings{MTMT:34768422,\\n\\ttitle = {EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution)},\\n\\tauthor = {Bajczi, Levente and Szekeres, Dániel and Mondok, Milán and Ádám, Zsófia and Somorjai, Márk and Telbisz, Csanád and Dobos-Kovács, Mihály and Molnár, Vince},\\n\\tbooktitle = {Tools and Algorithms for the Construction and Analysis of Systems},\\n\\tdoi = {10.1007/978-3-031-57256-2_23},\\n\\tunique-id = {34768422},\\n\\tabstract = {Theta is a model checking framework conventionally based on abstraction refinement techniques. While abstraction is useful for a large number of verification problems, the over-reliance on the technique led to Theta being unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to create EmergenTheta , a sandbox for the new approaches we want Theta to support. By differentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route to EmergenTheta , and its first debut on SV-COMP’24 in the ReachSafety category.},\\n\\tyear = {2024},\\n\\tpages = {371-375},\\n\\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Ádám, Zsófia/0000-0003-2354-1750; Telbisz, Csanád/0000-0002-6260-5908; Dobos-Kovács, Mihály/0000-0002-0064-2965; Molnár, Vince/0000-0002-8204-7595},\\n\\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas24etheta.pdf},\\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf},\\n    url_mtmt = {https://m2.mtmt.hu/api/publication/34768422},\\n}\\n\",\"author_short\":[\"Bajczi, L.\",\"Szekeres, D.\",\"Mondok, M.\",\"Ádám, Z.\",\"Somorjai, M.\",\"Telbisz, C.\",\"Dobos-Kovács, M.\",\"Molnár, V.\"],\"key\":\"MTMT:34768422\",\"id\":\"MTMT:34768422\",\"bibbaseid\":\"bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024\",\"role\":\"author\",\"urls\":{\" pdf\":\"https://leventebajczi.github.io/publications/tacas24etheta.pdf\",\" slides\":\"https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf\",\" mtmt\":\"https://m2.mtmt.hu/api/publication/34768422\"},\"metadata\":{\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\"downloads\":1,\"html\":\"\"}],\n      metadata: {\"owner\":\"bajczi, l\",\"authorlinks\":{\"bajczi, l\":\"https://leventebajczi.com/publications.html\"}},\n      ownerID: \"GynLprJytscbSLvgL\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publications.bib\" href=\"data:text/bibtex;base64,@inproceedings{MTMT:32836583,
	title = {C for Yourself: Comparison of Front-End Techniques for Formal Verification},
	author = {Bajczi, Levente and Ádám, Zsófia and Molnár, Vince},
	booktitle = {2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)},
	doi = {10.1145/3524482.3527646},
	unique-id = {32836583},
	year = {2022},
	orcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Molnár, Vince/0000-0002-8204-7595},
	abstract = {With the improvement of hardware and algorithms, the main challenge of software model checking has shifted from pure algorithmic performance toward supporting a wider set of input programs. Successful toolchains tackle the problem of parsing a wide range of inputs in an efficient way by reusing solutions from existing compiler technologies such as Eclipse CDT or LLVM. Our experience suggests that well-established techniques in compiler technology are not necessarily beneficial to model checkers and sometimes can even hurt their performance. In this paper, we review the tools mature enough to participate in the Software Verification Competition in terms of the employed analysis and frontend techniques. We find that successful tools do exhibit a bias toward certain combinations. We explore the theoretical reasons and suggest an adaptable approach for model checking frameworks. We validate our recommendations by implementing a new frontend for a model checking framework and show that it indeed benefits some of the algorithms.},

    url_pdf    = {https://leventebajczi.github.io/publications/formalise22.pdf},
    url_slides = {https://leventebajczi.github.io/publications/slides/formalise22.pdf},
	url_mtmt = {https://m2.mtmt.hu/api/publication/32836583},
}



@article{MTMT:30865515,
	title = {Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software},
	author = {Bajczi, Levente and Vörös, András and Molnár, Vince},
	doi = {10.1145/3358238},
	journal-iso = {ACM T EMBED COMPUT S},
	journal = {ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS},
	volume = {18},
	unique-id = {30865515},
	issn = {1539-9087},
	abstract = {Formal verification is approaching a point where it will be reliably applicable to embedded software. Even though formal verification can efficiently analyze multi-threaded applications, multi-core processors are often considered too dangerous to use in critical systems, despite the many benefits they can offer. One reason is the advanced memory consistency model of such CPUs. Nowadays, most software verifiers assume strict sequential consistency, which is also the naïve view of programmers. Modern multi-core processors, however, rarely guarantee this assumption by default. In addition, complex processor architectures may easily contain design faults. Thanks to the recent advances in hardware verification, these faults are increasingly visible and can be detected even in existing processors, giving an opportunity to compensate for the problem in software. In this paper, we propose a generic approach to consider inconsistent behavior of the hardware in the analysis of software. Our approach is based on formal methods and can be used to detect the activation of existing hardware faults on the application level and facilitate their mitigation in software. The approach relies heavily on recent results of model checking and hardware verification and offers new, integrative research directions. We propose a partial solution based on existing model checking tools to demonstrate feasibility and evaluate their performance in this context.},
	year = {2019},
	eissn = {1558-3465},
	orcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Molnár, Vince/0000-0002-8204-7595},

    url_pdf    = {https://leventebajczi.github.io/publications/emsoft19.pdf},
    url_slides = {https://leventebajczi.github.io/publications/slides/emsoft19.pdf},
	url_mtmt = {https://m2.mtmt.hu/api/publication/30865515},	
}



@article{MTMT:32801008,
	title = {Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)},
	author = {Ádám, Zsófia and Bajczi, Levente and Dobos-Kovács, Mihály and Hajdu, Ákos and Molnár, Vince},
	doi = {10.1007/978-3-030-99527-0_34},
	journal-iso = {LECT NOTES COMPUT SC},
	journal = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {13244},
	unique-id = {32801008},
	issn = {0302-9743},
	keywords = {Computer Science, Software Engineering},
	year = {2022},
	eissn = {1611-3349},
	pages = {474-478},
	orcid-numbers = {Ádám, Zsófia/0000-0003-2354-1750; Bajczi, Levente/0000-0002-6551-5860; Dobos-Kovács, Mihály/0000-0002-0064-2965; Hajdu, Ákos/0000-0001-8001-8865; Molnár, Vince/0000-0002-8204-7595},
	abstract = {THETA is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.},

    url_pdf    = {https://leventebajczi.github.io/publications/tacas22.pdf},
    url_slides = {https://leventebajczi.github.io/publications/slides/tacas22.pdf},
    url_poster = {https://leventebajczi.github.io/publications/posters/tacas22.pdf},
	url_mtmt = {https://m2.mtmt.hu/api/publication/32801008},
}




@inproceedings{MTMT:34768972,
	title = {ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution)},
	author = {Bajczi, Levente and Ádám, Zsófia and Micskei, Zoltán Imre},
	booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
	doi = {10.1007/978-3-031-57256-2_16},
	unique-id = {34768972},
	abstract = {ConcurrentWitness2Test is a violation witness validator for concurrent software. Taking both nondeterminism of data and interleaving-based nondeterminism into account, the tool aims to use the metadata described in the violation witnesses to synthesize an executable test harness. While plagued by some initial challenges yet to overcome, the validation performance of ConcurrentWitness2Test corroborates the usefulness of the proposed approach.},
	year = {2024},
	pages = {330-334},
	orcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Micskei, Zoltán Imre/0000-0003-1846-261X},

    url_pdf    = {https://leventebajczi.github.io/publications/tacas24cwt.pdf},
    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf},
    url_mtmt = {https://m2.mtmt.hu/api/publication/34768972},
}



@inproceedings{MTMT:34768428,
	title = {Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution)},
	author = {Bajczi, Levente and Telbisz, Csanád and Somorjai, Márk and Ádám, Zsófia and Dobos-Kovács, Mihály and Szekeres, Dániel and Mondok, Milán and Molnár, Vince},
	booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
	doi = {10.1007/978-3-031-57256-2_30},
	unique-id = {34768428},
	abstract = {Theta is a model checking framework, with a strong emphasis on effectively handling concurrency in software using abstraction refinement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verification using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances of Theta regarding concurrent and recursive software support.},
	year = {2024},
	pages = {412-417},
	orcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Telbisz, Csanád/0000-0002-6260-5908; Ádám, Zsófia/0000-0003-2354-1750; Dobos-Kovács, Mihály/0000-0002-0064-2965; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Molnár, Vince/0000-0002-8204-7595},

    url_pdf    = {https://leventebajczi.github.io/publications/tacas24theta.pdf},
    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24theta.pdf},
    url_mtmt = {https://m2.mtmt.hu/api/publication/34768428},
}



@inproceedings{MTMT:34768422,
	title = {EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution)},
	author = {Bajczi, Levente and Szekeres, Dániel and Mondok, Milán and Ádám, Zsófia and Somorjai, Márk and Telbisz, Csanád and Dobos-Kovács, Mihály and Molnár, Vince},
	booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
	doi = {10.1007/978-3-031-57256-2_23},
	unique-id = {34768422},
	abstract = {Theta is a model checking framework conventionally based on abstraction refinement techniques. While abstraction is useful for a large number of verification problems, the over-reliance on the technique led to Theta being unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to create EmergenTheta , a sandbox for the new approaches we want Theta to support. By differentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route to EmergenTheta , and its first debut on SV-COMP’24 in the ReachSafety category.},
	year = {2024},
	pages = {371-375},
	orcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Ádám, Zsófia/0000-0003-2354-1750; Telbisz, Csanád/0000-0002-6260-5908; Dobos-Kovács, Mihály/0000-0002-0064-2965; Molnár, Vince/0000-0002-8204-7595},

    url_pdf    = {https://leventebajczi.github.io/publications/tacas24etheta.pdf},
    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf},
    url_mtmt = {https://m2.mtmt.hu/api/publication/34768422},
}
\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://leventebajczi.github.io/publications.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://leventebajczi.github.io/publications.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https://leventebajczi.github.io%2Fpublications.bib&amp;jsonp=1&amp;theme=side&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https://leventebajczi.github.io%2Fpublications.bib&amp;jsonp=1&amp;theme=side\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https://leventebajczi.github.io%2Fpublications.bib&amp;jsonp=1&amp;theme=side\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas24cwt.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/tacas24cwt.pdf', event);\">\n    ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://leventebajczi.com/publications.html\">Bajczi, L.</a>; Ádám, Z.;  and Micskei, Z. I.\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, pages 330-334,  2024. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas24cwt.pdf\"\n     onclick=\"log_download('bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/tacas24cwt.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf\"\n     onclick=\"log_download('bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution) [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://m2.mtmt.hu/api/publication/34768972\"\n     onclick=\"log_download('bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024', 'https://m2.mtmt.hu/api/publication/34768972', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution) [link]\"\n       title=\" mtmt\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> mtmt</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-031-57256-2_16\"\n     onclick=\"log_download('bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024', 'http://doi.org/10.1007/978-3-031-57256-2_16', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bajczi-dm-micskei-concurrentwitness2testtestharnessingthepowerofconcurrencycompetitioncontribution-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MTMT:34768972,\n\ttitle = {ConcurrentWitness2Test: Test-Harnessing the Power of Concurrency (Competition Contribution)},\n\tauthor = {Bajczi, Levente and Ádám, Zsófia and Micskei, Zoltán Imre},\n\tbooktitle = {Tools and Algorithms for the Construction and Analysis of Systems},\n\tdoi = {10.1007/978-3-031-57256-2_16},\n\tunique-id = {34768972},\n\tabstract = {ConcurrentWitness2Test is a violation witness validator for concurrent software. Taking both nondeterminism of data and interleaving-based nondeterminism into account, the tool aims to use the metadata described in the violation witnesses to synthesize an executable test harness. While plagued by some initial challenges yet to overcome, the validation performance of ConcurrentWitness2Test corroborates the usefulness of the proposed approach.},\n\tyear = {2024},\n\tpages = {330-334},\n\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Micskei, Zoltán Imre/0000-0003-1846-261X},\n\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas24cwt.pdf},\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24cwt.pdf},\n    url_mtmt = {https://m2.mtmt.hu/api/publication/34768972},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  ConcurrentWitness2Test is a violation witness validator for concurrent software. Taking both nondeterminism of data and interleaving-based nondeterminism into account, the tool aims to use the metadata described in the violation witnesses to synthesize an executable test harness. While plagued by some initial challenges yet to overcome, the validation performance of ConcurrentWitness2Test corroborates the usefulness of the proposed approach.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas24theta.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/tacas24theta.pdf', event);\">\n    Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://leventebajczi.com/publications.html\">Bajczi, L.</a>; Telbisz, C.; Somorjai, M.; Ádám, Z.; Dobos-Kovács, M.; Szekeres, D.; Mondok, M.;  and Molnár, V.\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, pages 412-417,  2024. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas24theta.pdf\"\n     onclick=\"log_download('bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/tacas24theta.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/slides/tacas24theta.pdf\"\n     onclick=\"log_download('bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/slides/tacas24theta.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution) [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://m2.mtmt.hu/api/publication/34768428\"\n     onclick=\"log_download('bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024', 'https://m2.mtmt.hu/api/publication/34768428', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution) [link]\"\n       title=\" mtmt\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> mtmt</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-031-57256-2_30\"\n     onclick=\"log_download('bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024', 'http://doi.org/10.1007/978-3-031-57256-2_30', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bajczi-telbisz-somorjai-dm-doboskovcs-szekeres-mondok-molnr-thetaabstractionbasedtechniquesforverifyingconcurrencycompetitioncontribution-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MTMT:34768428,\n\ttitle = {Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution)},\n\tauthor = {Bajczi, Levente and Telbisz, Csanád and Somorjai, Márk and Ádám, Zsófia and Dobos-Kovács, Mihály and Szekeres, Dániel and Mondok, Milán and Molnár, Vince},\n\tbooktitle = {Tools and Algorithms for the Construction and Analysis of Systems},\n\tdoi = {10.1007/978-3-031-57256-2_30},\n\tunique-id = {34768428},\n\tabstract = {Theta is a model checking framework, with a strong emphasis on effectively handling concurrency in software using abstraction refinement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verification using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances of Theta regarding concurrent and recursive software support.},\n\tyear = {2024},\n\tpages = {412-417},\n\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Telbisz, Csanád/0000-0002-6260-5908; Ádám, Zsófia/0000-0003-2354-1750; Dobos-Kovács, Mihály/0000-0002-0064-2965; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Molnár, Vince/0000-0002-8204-7595},\n\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas24theta.pdf},\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24theta.pdf},\n    url_mtmt = {https://m2.mtmt.hu/api/publication/34768428},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Theta is a model checking framework, with a strong emphasis on effectively handling concurrency in software using abstraction refinement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verification using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances of Theta regarding concurrent and recursive software support.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas24etheta.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/tacas24etheta.pdf', event);\">\n    EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://leventebajczi.com/publications.html\">Bajczi, L.</a>; Szekeres, D.; Mondok, M.; Ádám, Z.; Somorjai, M.; Telbisz, C.; Dobos-Kovács, M.;  and Molnár, V.\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, pages 371-375,  2024. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas24etheta.pdf\"\n     onclick=\"log_download('bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/tacas24etheta.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf\"\n     onclick=\"log_download('bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024', 'https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution) [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://m2.mtmt.hu/api/publication/34768422\"\n     onclick=\"log_download('bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024', 'https://m2.mtmt.hu/api/publication/34768422', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution) [link]\"\n       title=\" mtmt\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> mtmt</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-031-57256-2_23\"\n     onclick=\"log_download('bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024', 'http://doi.org/10.1007/978-3-031-57256-2_23', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bajczi-szekeres-mondok-dm-somorjai-telbisz-doboskovcs-molnr-emergenthetaverificationbeyondabstractionrefinementcompetitioncontribution-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MTMT:34768422,\n\ttitle = {EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution)},\n\tauthor = {Bajczi, Levente and Szekeres, Dániel and Mondok, Milán and Ádám, Zsófia and Somorjai, Márk and Telbisz, Csanád and Dobos-Kovács, Mihály and Molnár, Vince},\n\tbooktitle = {Tools and Algorithms for the Construction and Analysis of Systems},\n\tdoi = {10.1007/978-3-031-57256-2_23},\n\tunique-id = {34768422},\n\tabstract = {Theta is a model checking framework conventionally based on abstraction refinement techniques. While abstraction is useful for a large number of verification problems, the over-reliance on the technique led to Theta being unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to create EmergenTheta , a sandbox for the new approaches we want Theta to support. By differentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route to EmergenTheta , and its first debut on SV-COMP’24 in the ReachSafety category.},\n\tyear = {2024},\n\tpages = {371-375},\n\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Szekeres, Dániel/0000-0002-2912-028X; Mondok, Milán/0000-0001-5396-2172; Ádám, Zsófia/0000-0003-2354-1750; Telbisz, Csanád/0000-0002-6260-5908; Dobos-Kovács, Mihály/0000-0002-0064-2965; Molnár, Vince/0000-0002-8204-7595},\n\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas24etheta.pdf},\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas24etheta.pdf},\n    url_mtmt = {https://m2.mtmt.hu/api/publication/34768422},\n}\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Theta is a model checking framework conventionally based on abstraction refinement techniques. While abstraction is useful for a large number of verification problems, the over-reliance on the technique led to Theta being unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to create EmergenTheta , a sandbox for the new approaches we want Theta to support. By differentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route to EmergenTheta , and its first debut on SV-COMP’24 in the ReachSafety category.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://leventebajczi.github.io/publications/formalise22.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022', 'https://leventebajczi.github.io/publications/formalise22.pdf', event);\">\n    C for Yourself: Comparison of Front-End Techniques for Formal Verification.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://leventebajczi.com/publications.html\">Bajczi, L.</a>; Ádám, Z.;  and Molnár, V.\n</span>\n\n  \n\n</span>\n\n  In <i>2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)</i>,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://leventebajczi.github.io/publications/formalise22.pdf\"\n     onclick=\"log_download('bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022', 'https://leventebajczi.github.io/publications/formalise22.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"C for Yourself: Comparison of Front-End Techniques for Formal Verification [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/slides/formalise22.pdf\"\n     onclick=\"log_download('bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022', 'https://leventebajczi.github.io/publications/slides/formalise22.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"C for Yourself: Comparison of Front-End Techniques for Formal Verification [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://m2.mtmt.hu/api/publication/32836583\"\n     onclick=\"log_download('bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022', 'https://m2.mtmt.hu/api/publication/32836583', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"C for Yourself: Comparison of Front-End Techniques for Formal Verification [link]\"\n       title=\" mtmt\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> mtmt</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3524482.3527646\"\n     onclick=\"log_download('bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022', 'http://doi.org/10.1145/3524482.3527646', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bajczi-dm-molnr-cforyourselfcomparisonoffrontendtechniquesforformalverification-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{MTMT:32836583,\n\ttitle = {C for Yourself: Comparison of Front-End Techniques for Formal Verification},\n\tauthor = {Bajczi, Levente and Ádám, Zsófia and Molnár, Vince},\n\tbooktitle = {2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)},\n\tdoi = {10.1145/3524482.3527646},\n\tunique-id = {32836583},\n\tyear = {2022},\n\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Ádám, Zsófia/0000-0003-2354-1750; Molnár, Vince/0000-0002-8204-7595},\n\tabstract = {With the improvement of hardware and algorithms, the main challenge of software model checking has shifted from pure algorithmic performance toward supporting a wider set of input programs. Successful toolchains tackle the problem of parsing a wide range of inputs in an efficient way by reusing solutions from existing compiler technologies such as Eclipse CDT or LLVM. Our experience suggests that well-established techniques in compiler technology are not necessarily beneficial to model checkers and sometimes can even hurt their performance. In this paper, we review the tools mature enough to participate in the Software Verification Competition in terms of the employed analysis and frontend techniques. We find that successful tools do exhibit a bias toward certain combinations. We explore the theoretical reasons and suggest an adaptable approach for model checking frameworks. We validate our recommendations by implementing a new frontend for a model checking framework and show that it indeed benefits some of the algorithms.},\n\n    url_pdf    = {https://leventebajczi.github.io/publications/formalise22.pdf},\n    url_slides = {https://leventebajczi.github.io/publications/slides/formalise22.pdf},\n\turl_mtmt = {https://m2.mtmt.hu/api/publication/32836583},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  With the improvement of hardware and algorithms, the main challenge of software model checking has shifted from pure algorithmic performance toward supporting a wider set of input programs. Successful toolchains tackle the problem of parsing a wide range of inputs in an efficient way by reusing solutions from existing compiler technologies such as Eclipse CDT or LLVM. Our experience suggests that well-established techniques in compiler technology are not necessarily beneficial to model checkers and sometimes can even hurt their performance. In this paper, we review the tools mature enough to participate in the Software Verification Competition in terms of the employed analysis and frontend techniques. We find that successful tools do exhibit a bias toward certain combinations. We explore the theoretical reasons and suggest an adaptable approach for model checking frameworks. We validate our recommendations by implementing a new frontend for a model checking framework and show that it indeed benefits some of the algorithms.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas22.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://leventebajczi.github.io/publications/tacas22.pdf', event);\">\n    Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ádám, Z.; <a class=\"bibbase author link\" href=\"https://leventebajczi.com/publications.html\">Bajczi, L.</a>; Dobos-Kovács, M.; Hajdu, Á.;  and Molnár, V.\n</span>\n\n  \n\n</span>\n\n  <i>LECTURE NOTES IN COMPUTER SCIENCE</i>, 13244: 474-478.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://leventebajczi.github.io/publications/tacas22.pdf\"\n     onclick=\"log_download('dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://leventebajczi.github.io/publications/tacas22.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution) [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/slides/tacas22.pdf\"\n     onclick=\"log_download('dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://leventebajczi.github.io/publications/slides/tacas22.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution) [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/posters/tacas22.pdf\"\n     onclick=\"log_download('dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://leventebajczi.github.io/publications/posters/tacas22.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution) [pdf]\"\n       title=\" poster\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> poster</span></a>\n  &nbsp;\n  \n  <a href=\"https://m2.mtmt.hu/api/publication/32801008\"\n     onclick=\"log_download('dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'https://m2.mtmt.hu/api/publication/32801008', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution) [link]\"\n       title=\" mtmt\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> mtmt</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-99527-0_34\"\n     onclick=\"log_download('dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022', 'http://doi.org/10.1007/978-3-030-99527-0_34', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>8 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dm-bajczi-doboskovcs-hajdu-molnr-thetaportfolioofcegarbasedanalyseswithdynamicalgorithmselectioncompetitioncontribution-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{MTMT:32801008,\n\ttitle = {Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)},\n\tauthor = {Ádám, Zsófia and Bajczi, Levente and Dobos-Kovács, Mihály and Hajdu, Ákos and Molnár, Vince},\n\tdoi = {10.1007/978-3-030-99527-0_34},\n\tjournal-iso = {LECT NOTES COMPUT SC},\n\tjournal = {LECTURE NOTES IN COMPUTER SCIENCE},\n\tvolume = {13244},\n\tunique-id = {32801008},\n\tissn = {0302-9743},\n\tkeywords = {Computer Science, Software Engineering},\n\tyear = {2022},\n\teissn = {1611-3349},\n\tpages = {474-478},\n\torcid-numbers = {Ádám, Zsófia/0000-0003-2354-1750; Bajczi, Levente/0000-0002-6551-5860; Dobos-Kovács, Mihály/0000-0002-0064-2965; Hajdu, Ákos/0000-0001-8001-8865; Molnár, Vince/0000-0002-8204-7595},\n\tabstract = {THETA is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.},\n\n    url_pdf    = {https://leventebajczi.github.io/publications/tacas22.pdf},\n    url_slides = {https://leventebajczi.github.io/publications/slides/tacas22.pdf},\n    url_poster = {https://leventebajczi.github.io/publications/posters/tacas22.pdf},\n\turl_mtmt = {https://m2.mtmt.hu/api/publication/32801008},\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  THETA is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://leventebajczi.github.io/publications/emsoft19.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019', 'https://leventebajczi.github.io/publications/emsoft19.pdf', event);\">\n    Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://leventebajczi.com/publications.html\">Bajczi, L.</a>; Vörös, A.;  and Molnár, V.\n</span>\n\n  \n\n</span>\n\n  <i>ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS</i>, 18.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://leventebajczi.github.io/publications/emsoft19.pdf\"\n     onclick=\"log_download('bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019', 'https://leventebajczi.github.io/publications/emsoft19.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software [pdf]\"\n       title=\" pdf\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> pdf</span></a>\n  &nbsp;\n  \n  <a href=\"https://leventebajczi.github.io/publications/slides/emsoft19.pdf\"\n     onclick=\"log_download('bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019', 'https://leventebajczi.github.io/publications/slides/emsoft19.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software [pdf]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n  <a href=\"https://m2.mtmt.hu/api/publication/30865515\"\n     onclick=\"log_download('bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019', 'https://m2.mtmt.hu/api/publication/30865515', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software [link]\"\n       title=\" mtmt\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> mtmt</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3358238\"\n     onclick=\"log_download('bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019', 'http://doi.org/10.1145/3358238', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bajczi-vrs-molnr-willmyprogrambreakonthisfaultyprocessorformalanalysisofhardwarefaultactivationsinconcurrentembeddedsoftware-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{MTMT:30865515,\n\ttitle = {Will My Program Break on This Faulty Processor?. Formal Analysis of Hardware Fault Activations in Concurrent Embedded Software},\n\tauthor = {Bajczi, Levente and Vörös, András and Molnár, Vince},\n\tdoi = {10.1145/3358238},\n\tjournal-iso = {ACM T EMBED COMPUT S},\n\tjournal = {ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS},\n\tvolume = {18},\n\tunique-id = {30865515},\n\tissn = {1539-9087},\n\tabstract = {Formal verification is approaching a point where it will be reliably applicable to embedded software. Even though formal verification can efficiently analyze multi-threaded applications, multi-core processors are often considered too dangerous to use in critical systems, despite the many benefits they can offer. One reason is the advanced memory consistency model of such CPUs. Nowadays, most software verifiers assume strict sequential consistency, which is also the naïve view of programmers. Modern multi-core processors, however, rarely guarantee this assumption by default. In addition, complex processor architectures may easily contain design faults. Thanks to the recent advances in hardware verification, these faults are increasingly visible and can be detected even in existing processors, giving an opportunity to compensate for the problem in software. In this paper, we propose a generic approach to consider inconsistent behavior of the hardware in the analysis of software. Our approach is based on formal methods and can be used to detect the activation of existing hardware faults on the application level and facilitate their mitigation in software. The approach relies heavily on recent results of model checking and hardware verification and offers new, integrative research directions. We propose a partial solution based on existing model checking tools to demonstrate feasibility and evaluate their performance in this context.},\n\tyear = {2019},\n\teissn = {1558-3465},\n\torcid-numbers = {Bajczi, Levente/0000-0002-6551-5860; Molnár, Vince/0000-0002-8204-7595},\n\n    url_pdf    = {https://leventebajczi.github.io/publications/emsoft19.pdf},\n    url_slides = {https://leventebajczi.github.io/publications/slides/emsoft19.pdf},\n\turl_mtmt = {https://m2.mtmt.hu/api/publication/30865515},\t\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Formal verification is approaching a point where it will be reliably applicable to embedded software. Even though formal verification can efficiently analyze multi-threaded applications, multi-core processors are often considered too dangerous to use in critical systems, despite the many benefits they can offer. One reason is the advanced memory consistency model of such CPUs. Nowadays, most software verifiers assume strict sequential consistency, which is also the naïve view of programmers. Modern multi-core processors, however, rarely guarantee this assumption by default. In addition, complex processor architectures may easily contain design faults. Thanks to the recent advances in hardware verification, these faults are increasingly visible and can be detected even in existing processors, giving an opportunity to compensate for the problem in software. In this paper, we propose a generic approach to consider inconsistent behavior of the hardware in the analysis of software. Our approach is based on formal methods and can be used to detect the activation of existing hardware faults on the application level and facilitate their mitigation in software. The approach relies heavily on recent results of model checking and hardware verification and offers new, integrative research directions. We propose a partial solution based on existing model checking tools to demonstrate feasibility and evaluate their performance in this context.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);