| Root causing linearizability violations B Çirisci, C Enea, A Farzan, SO Mutluergil International Conference on Computer Aided Verification, 350-375, 2020 | 3 | 2020 |
| Using Structure of Automata for Faster Synchronizing Heuristics. B Cirisci, MK Kahraman, CU Yildirimoglu, K Kaya, H Yenigün MODELSWARD, 544-551, 2018 | 3 | 2018 |
| Using Synchronizing Heuristics to Construct Homing Sequences B Çirişci, MY Emek, E Sorguç, K Kaya, H Yenigün SciTePress, 2019 | 2 | 2019 |
| Quorum tree abstractions of consensus protocols B Cirisci, C Enea, SO Mutluergil European Symposium on Programming, 337-362, 2023 | 1 | 2023 |
| CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis HC Tunç, AP Deshmukh, B Çirisci, C Enea, A Pavlogiannis arXiv preprint arXiv:2403.17818, 2024 | | 2024 |
| A language-agnostic framework for mining static analysis rules from code changes SDB Effendi, B Çirisci, R Mukherjee, HA Nguyen, O Tripp 2023 IEEE/ACM 45th International Conference on Software Engineering …, 2023 | | 2023 |
| A pragmatic approach to stateful partial order reduction B Cirisci, C Enea, A Farzan, SO Mutluergil International Conference on Verification, Model Checking, and Abstract …, 2023 | | 2023 |
| Formal verification of concurrent data structures B Cirisci Université Paris Cité, 2022 | | 2022 |
| The Upper Bound for the Length of the Shortest Homing Sequences B Çirişci | | 2019 |
| Synchronizing heuristics for weakly connected automata with various topologies B Cirisci, B Sevilmiş, EY Sivri, PK Karaçam, K Kaya, H Yenigün Model-Driven Engineering and Software Development: 6th International …, 2019 | | 2019 |
| Synchronizing Heuristics for Non-Strongly Connected Automata B Çirişci, KM Kahraman, ÇU Yıldırımoğlu, H Yenigün, K Kaya | | 2017 |
