Orna Kupferman

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 94

Top Venues

Publications

Ravid Alon, Orna Kupferman
Restricted Flow Games. Taming the Infinities of Concurrency (2024)
Orna Kupferman, Noam Shenwald
The Complexity of LTL Rational Synthesis. ACM Trans. Comput. Log. 25 (2) (2024)
Orna Kupferman, Gal Vardi
Perspective Games. ACM Trans. Comput. Log. 25 (1) (2024)
Orna Kupferman, Ofer Leshkowitz, Naama Shamash Halevy
Synthesis with Privacy Against an Observer. FoSSaCS (1) (2024)
Ravid Alon, Orna Kupferman
Mutually Accepting Capacitated Automata. J. Autom. Lang. Comb. 28 (1-3) (2023)
Guy Avni, Shibashis Guha, Orna Kupferman
Timed network games. Inf. Comput. 290 (2023)
Bader Abu Radi, Orna Kupferman
On Semantically-Deterministic Automata. CoRR (2023)
Bader Abu Radi, Orna Kupferman
On Semantically-Deterministic Automata. ICALP (2023)
Orna Kupferman, Asaf Petruschka
Lazy regular sensing. Theor. Comput. Sci. 971 (2023)
Yoav Feinstein, Orna Kupferman
Monotonicity Characterizations of Regular Languages. FSTTCS (2023)
Orna Kupferman, Noam Shenwald
Games with Trading of Control. CONCUR (2023)
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
Reasoning about Quality and Fuzziness of Strategic Behaviors. ACM Trans. Comput. Log. 24 (3) (2023)
Orna Kupferman, Nir Lavee, Salomon Sickert
Certifying DFA Bounds for Recognition and Separation. Innov. Syst. Softw. Eng. 18 (3) (2022)
Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi
CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR (2022)
Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
A Hierarchy of Nondeterminism. CoRR (2022)
Orna Kupferman
Multi-Valued Reasoning about Reactive Systems. Found. Trends Theor. Comput. Sci. 15 (2) (2022)
Orna Kupferman, Asaf Petruschka
Lazy Regular Sensing. DCFS (2022)
Orna Kupferman, Ofer Leshkowitz
Synthesis of Privacy-Preserving Systems. FSTTCS (2022)
Luca Aceto, Orna Kupferman, Mickael Randour, Davide Sangiorgi
Interviews with the 2022 CONCUR Test-of-Time Award Recipients. Bull. EATCS 138 (2022)
Bader Abu Radi, Orna Kupferman
Minimization and Canonization of GFG Transition-Based Automata. Log. Methods Comput. Sci. 18 (3) (2022)
Shaull Almagor, Udi Boker, Orna Kupferman
What's decidable about weighted automata? Inf. Comput. 282 (2022)
Orna Kupferman, Noam Shenwald
The Complexity of LTL Rational Synthesis. TACAS (1) (2022)
Orna Kupferman, Naama Shamash Halevy
Energy Games with Resource-Bounded Environments. CONCUR (2022)
Bader Abu Radi, Orna Kupferman
Minimization of Automata for Liveness Languages. ATVA (2022)
Orna Kupferman
Using the past for resolving the future. Frontiers Comput. Sci. 4 (2022)
Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
A Hierarchy of Nondeterminism. MFCS (2021)
Bader Abu Radi, Orna Kupferman
Minimization and Canonization of GFG Transition-Based Automata. CoRR (2021)
Orna Kupferman, Salomon Sickert
Certifying Inexpressibility. CoRR (2021)
Orna Kupferman, Nir Lavee, Salomon Sickert
Certifying DFA Bounds for Recognition and Separation. CoRR (2021)
Orna Kupferman, Noam Shenwald
Perspective Multi-Player Games. LICS (2021)
Orna Kupferman, Nir Lavee, Salomon Sickert
Certifying DFA Bounds for Recognition and Separation. ATVA (2021)
Orna Kupferman, Salomon Sickert
Certifying Inexpressibility. FoSSaCS (2021)
Shaull Almagor, Orna Kupferman
Good-Enough Synthesis. CoRR (2021)
Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi
Unary Prime Languages. MFCS (2020)
Orna Kupferman
From Correctness to High Quality. FMCAD (2020)
Orna Kupferman, Ofer Leshkowitz
On Repetition Languages. MFCS (2020)
Ravid Alon, Orna Kupferman
Mutually Accepting Capacitated Automata. DCFS (2020)
Rachel Faran, Orna Kupferman
On (I/O)-Aware Good-For-Games Automata. ATVA (2020)
Gili Bielous, Orna Kupferman
Coverage and Vacuity in Network Formation Games. CSL (2020)
Orna Kupferman
Games with Full, Longitudinal, and Transverse Observability. RP (2020)
Orna Kupferman, Noam Shenwald
Perspective Games with Notifications. FSTTCS (2020)
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
Reasoning About Quality and Fuzziness of Strategic Behaviours. ECAI (2020)
Bader Abu Radi, Orna Kupferman
Canonicity in GFG and Transition-Based Automata. GandALF (2020)
Guy Avni, Thomas A. Henzinger, Orna Kupferman
Dynamic resource allocation games. Theor. Comput. Sci. 807 (2020)
Rachel Faran, Orna Kupferman
On Synthesis of Specifications with Arithmetic. SOFSEM (2020)
Shaull Almagor, Orna Kupferman
Good-Enough Synthesis. CAV (2) (2020)
Shibashis Guha, Orna Kupferman, Gal Vardi
Multi-player flow games. Auton. Agents Multi Agent Syst. 33 (6) (2019)
Orna Kupferman, Sarai Sheinvald
Capacitated automata and systems. Inf. Comput. 269 (2019)
Rachel Faran, Orna Kupferman
A Parametrized Analysis of Algorithms on Hierarchical Graphs. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Orna Kupferman, Gal Vardi
Perspective Games. LICS (2019)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
Reasoning about Quality and Fuzziness of Strategic Behaviours. CoRR (2019)
Bader Abu Radi, Orna Kupferman
Minimizing GFG Transition-Based Automata. ICALP (2019)
Orna Kupferman, Gal Vardi
Flow Logic. Log. Methods Comput. Sci. 15 (4) (2019)
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
Reasoning about Quality and Fuzziness of Strategic Behaviours. IJCAI (2019)
Ayrat Khalimov, Orna Kupferman
Register-Bounded Synthesis. CONCUR (2019)
Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi
Spanning-Tree Games. MFCS (2018)
Orna Kupferman, Gal Vardi
The Unfortunate-Flow Problem. ICALP (2018)
Orna Kupferman, Tami Tamir
Alternating Reachability Games with Behavioral and Revenue Objectives. LPAR (2018)
Shibashis Guha, Orna Kupferman, Gal Vardi
Multi-Player Flow Games. AAMAS (2018)
Rachel Faran, Orna Kupferman
Spanning the spectrum from safety to liveness. Acta Informatica 55 (8) (2018)
Rachel Faran, Orna Kupferman
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems. LPAR (2018)
Shaull Almagor, Orna Kupferman, Giuseppe Perelli
Synthesis of Controllable Nash Equilibria in Quantitative Objective Game. IJCAI (2018)
Guy Avni, Shibashis Guha, Orna Kupferman
. Games 9 (3) (2018)
Orna Kupferman, Gal Vardi
Flow Logic. CoRR (2018)
Guy Avni, Orna Kupferman
Synthesis from component libraries with costs. Theor. Comput. Sci. 712 (2018)
Guy Avni, Shibashis Guha, Orna Kupferman
Timed Network Games with Clocks. MFCS (2018)
Guy Avni, Shibashis Guha, Orna Kupferman
Timed Network Games with Clocks. CoRR (2018)
Hana Chockler, Shibashis Guha, Orna Kupferman
Timed Vacuity. FM (2018)
Orna Kupferman
Playing with the Maximum-Flow Problem. LPAR (2018)
Orna Kupferman, Gal Vardi
On relative and probabilistic finite counterability. Formal Methods Syst. Des. 52 (2) (2018)
Shaull Almagor, Orna Kupferman
Latticed-LTL synthesis in the presence of noisy inputs. Discret. Event Dyn. Syst. 27 (3) (2017)
Udi Boker, Orna Kupferman, Michal Skrzypczak
How Deterministic are Good-For-Games Automata? CoRR (2017)
Rachel Faran, Orna Kupferman
A Parametrized Analysis of Algorithms on Hierarchical Graphs. DCFS (2017)
Orna Kupferman, Gal Vardi
Flow Logic. CONCUR (2017)
Guy Avni, Shibashis Guha, Orna Kupferman
An Abstraction-Refinement Methodology for Reasoning about Network Games. IJCAI (2017)
Orna Kupferman, Tami Tamir
Hierarchical Network Formation Games. TACAS (1) (2017)
Udi Boker, Orna Kupferman, Michal Skrzypczak
How Deterministic are Good-For-Games Automata?. FSTTCS (2017)
Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, Yaron Velner
Quantitative Assume Guarantee Synthesis. CAV (2) (2017)
Orna Kupferman
Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk). STOC (2017)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
Sensing as a Complexity Measure. DCFS (2017)
Orna Kupferman, Gal Vardi, Moshe Y. Vardi
Flow Games. FSTTCS (2017)
Guy Avni, Shibashis Guha, Orna Kupferman
Timed Network Games. MFCS (2017)
Guy Avni, Thomas A. Henzinger, Orna Kupferman
Dynamic Resource Allocation Games. SAGT (2016)
Orna Kupferman
On High-Quality Synthesis. CSR (2016)
Orna Kupferman, Sarai Sheinvald
On the Capacity of Capacitated Automata. LATA (2016)
Orna Kupferman, Gal Vardi
Eulerian Paths with Regular Constraints. MFCS (2016)
Shaull Almagor, Orna Kupferman
High-Quality Synthesis Against Stochastic Environments. CSL (2016)
Shaull Almagor, Udi Boker, Orna Kupferman
Formally Reasoning About Quality. J. ACM 63 (3) (2016)
Shaull Almagor, Orna Kupferman
High-Quality Synthesis Against Stochastic Environments. CoRR (2016)
Shaull Almagor, Orna Kupferman, Yaron Velner
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CoRR (2016)
Shaull Almagor, Orna Kupferman, Yaron Velner
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CONCUR (2016)
Guy Avni, Orna Kupferman, Tami Tamir
Network-formation games with regular objectives. Inf. Comput. 251 (2016)
Orna Kupferman, Giuseppe Perelli, Moshe Y. Vardi
Synthesis with rational environments. Ann. Math. Artif. Intell. 78 (1) (2016)
Rachel Faran, Orna Kupferman
Spanning the Spectrum from Safety to Liveness. ATVA (2015)
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
Profile trees for Büchi word automata, with application to determinization. Inf. Comput. 245 (2015)
Guy Avni, Orna Kupferman
Stochastization of Weighted Automata. MFCS (1) (2015)
Orna Kupferman, Gal Vardi
On Relative and Probabilistic Finite Counterability. CSL (2015)
Orna Kupferman, Jonathan Mosheiff
Prime languages. Inf. Comput. 240 (2015)
Shaull Almagor, Denis Kuperberg, Orna Kupferman
The Sensing Cost of Monitoring and Synthesis. FSTTCS (2015)

Orna Kupferman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Orna Kupferman