Chana Weil-Kennedy

24 papers A* 1B 5Journal 13Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction. VMCAI (1) Paul Eichler, Swen Jacobs, Chana Weil-Kennedy
2025	J	`jnl`	Runtime Verification of Interactions Using Automata. CoRR Chana Weil-Kennedy, Darine Rammal, Christophe Gaston, Arnault Lapitre
2025	B	`conf`	Temporal Hyperproperties for Population Protocols. FoSSaCS Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, César Sánchez
2024	—	`conf`	A Uniform Framework for Language Inclusion Problems. Taming the Infinities of Concurrency Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
2024	J	`jnl`	A Uniform Framework for Language Inclusion Problems. CoRR Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy
2024	J	`jnl`	Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction. CoRR Paul Eichler, Swen Jacobs, Chana Weil-Kennedy
2024	J	`jnl`	Temporal Hyperproperties for Population Protocols. CoRR Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, César Sánchez
2024	A*	`conf`	Verification of Population Protocols with Unordered Data. ICALP Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy
2024	J	`jnl`	Verification of Population Protocols with Unordered Data. CoRR Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy
2023	—	`—`	Observation Petri Nets. Chana Weil-Kennedy
2022	J	`jnl`	Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version). CoRR A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
2022	B	`conf`	Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
2021	J	`jnl`	Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version). CoRR A. R. Balasubramanian, Chana Weil-Kennedy
2021	—	`conf`	Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. GandALF A. R. Balasubramanian, Chana Weil-Kennedy
2021	J	`jnl`	The complexity of verifying population protocols. Distributed Comput. Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
2020	—	`conf`	Efficient Restrictions of Immediate Observation Petri Nets. RP Michael Raskin, Chana Weil-Kennedy
2020	J	`jnl`	Efficient Restrictions of Immediate Observation Petri Nets. CoRR Michael Raskin, Chana Weil-Kennedy
2020	B	`conf`	Flatness and Complexity of Immediate Observation Petri Nets. CONCUR Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza
2020	J	`jnl`	On the Flatness of Immediate Observation Petri Nets. CoRR Mikhail A. Raskin, Chana Weil-Kennedy
2019	B	`conf`	Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
2019	J	`jnl`	Parameterized Analysis of Immediate Observation Petri Nets. CoRR Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
2019	J	`jnl`	The Complexity of Verifying Population Protocols. CoRR Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
2018	B	`conf`	Verification of Immediate Observation Population Protocols. CONCUR Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy
2018	J	`jnl`	Verification of Immediate Observation Population Protocols. CoRR Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy