Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Burcu Kulahcioglu"'
We present a coverage-guided testing algorithm for distributed systems implementations. Our main innovation is the use of an abstract formal model of the system that is used to define coverage. Such abstract models are frequently developed in early p
Externí odkaz:
http://arxiv.org/abs/2410.02307
Byzantine consensus protocols aim at maintaining safety guarantees under any network synchrony model and at providing liveness in partially or fully synchronous networks. However, several Byzantine consensus protocols have been shown to violate liven
Externí odkaz:
http://arxiv.org/abs/2310.09006
Autor:
Levin N. Winter, Florena Buse, Daan de Graaf, Klaus von Gleissenthall, Burcu Kulahcioglu Ozkan
Publikováno v:
Proceedings of the ACM on Programming Languages, 7(OOPSLA(1))
Proceedings of the ACM on Programming Languages, 7(OOPSLA1):101, 757-788. Association for Computing Machinery (ACM)
Winter, L N, Buse, F, De Graaf, D, Von Gleissenthall, K & Kulahcioglu Ozkan, B 2023, ' Randomized Testing of Byzantine Fault Tolerant Algorithms ', Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA1, 101, pp. 757-788 . https://doi.org/10.1145/3586053
Proceedings of the ACM on Programming Languages, 7(OOPSLA1):101, 757-788. Association for Computing Machinery (ACM)
Winter, L N, Buse, F, De Graaf, D, Von Gleissenthall, K & Kulahcioglu Ozkan, B 2023, ' Randomized Testing of Byzantine Fault Tolerant Algorithms ', Proceedings of the ACM on Programming Languages, vol. 7, no. OOPSLA1, 101, pp. 757-788 . https://doi.org/10.1145/3586053
Byzantine fault-tolerant algorithms promise agreement on a correct value, even if a subset of processes can deviate from the algorithm arbitrarily. While these algorithms provide strong guarantees in theory, in practice, protocol bugs and implementat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1d6098ec2d252c1c1288fddc93ecbd9
http://resolver.tudelft.nl/uuid:2c31913f-2230-41fc-b5e2-fbeed13beea6
http://resolver.tudelft.nl/uuid:2c31913f-2230-41fc-b5e2-fbeed13beea6
Publikováno v:
SPLASH 2020 : ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity
SPLASH 2020 : ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity, Oct 2021, Chiccago / Virtual, United States. ⟨10.1145/3428278⟩
Proc. {ACM} Program. Lang.
Proceedings of the ACM on Programming Languages
SPLASH 2020 : ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity, Oct 2021, Chiccago / Virtual, United States. ⟨10.1145/3428278⟩
Proc. {ACM} Program. Lang.
Proceedings of the ACM on Programming Languages
Large scale production distributed systems are difficult to design and test. Correctness must be ensured when processes run asynchronously, at arbitrary rates relative to each other, and in the presence of failures, e.g., process crashes or message l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56491f8b18f80661d48e82b11ee88283
https://hal.inria.fr/hal-03134294/file/main.pdf
https://hal.inria.fr/hal-03134294/file/main.pdf
Autor:
Burcu Kulahcioglu Ozkan
Publikováno v:
Networked Systems ISBN: 9783030670863
NETYS
NETYS
We present a method for verifying whether all executions of a set of transactions satisfy a given invariant when run on weakly consistent systems. Existing approaches check that all executions under weak consistency are equivalent to some serial exec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91e893c53f350de874f6760e9e557449
https://doi.org/10.1007/978-3-030-67087-0_17
https://doi.org/10.1007/978-3-030-67087-0_17
Autor:
Burcu Kulahcioglu Ozkan, Georg Weissenbacher, Filip Niksic, Mitra Tabaei Befrouei, Rupak Majumdar
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-28
Several recently proposed randomized testing tools for concurrent and distributed systems come with theoretical guarantees on their success. The key to these guarantees is a notion of bug depth—the minimum length of a sequence of events sufficient
Publikováno v:
ACM SIGSOFT Software Engineering Notes. 42:1-5
Modern geo-replicated data stores provide high availability by relaxing the underlying consistency requirements. Programs layered over such data stores are called weakly consistent programs. Due to the reduced consistency requirements, they exhibit h
Publikováno v:
PPoPP
Linearizability is a key correctness property for concurrent data types. Linearizability requires that the behavior of concurrently invoked operations of the data type be equivalent to the behavior in an execution where each operation takes effect at
Publikováno v:
Proceedings of the ACM on Programming Languages
Distributed and concurrent applications often have subtle bugs that only get exposed under specific schedules. While these schedules may be found by systematic model checking techniques, in practice, model checkers do not scale to large systems. On t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c7e7fe25764714e4a86a1679515b5aa
https://hdl.handle.net/21.11116/0000-0005-D8F2-621.11116/0000-0009-1039-5
https://hdl.handle.net/21.11116/0000-0005-D8F2-621.11116/0000-0009-1039-5
Publikováno v:
Erlang Workshop
We present iDeA, an immersive user interface for debugging concurrent actor programs communicating through asynchronous message passing. iDeA is based on the hypothesis that debugging and understanding actor programs is a cognitive task which can be