default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrna Kupferman
Orna Bernholtz
Person information
- affiliation: Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Orna Kupferman, Gal Vardi:
Perspective Games. ACM Trans. Comput. Log. 25(1): 4:1-4:26 (2024)- [j71]Orna Kupferman
, Noam Shenwald:
The Complexity of LTL Rational Synthesis. ACM Trans. Comput. Log. 25(2): 10:1-10:31 (2024) - [c203]Ravid Alon, Orna Kupferman:
Restricted Flow Games. Taming the Infinities of Concurrency 2024: 22-50 - [c202]Orna Kupferman, Ofer Leshkowitz, Naama Shamash Halevy:
Synthesis with Privacy Against an Observer. FoSSaCS (1) 2024: 256-277 - [e3]Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov:
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. LIPIcs 289, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-311-9 [contents] - 2023
- [j70]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed network games. Inf. Comput. 290: 104996 (2023) - [j69]Ravid Alon, Orna Kupferman:
Mutually Accepting Capacitated Automata. J. Autom. Lang. Comb. 28(1-3): 5-25 (2023) - [j68]Orna Kupferman, Asaf Petruschka:
Lazy regular sensing. Theor. Comput. Sci. 971: 114057 (2023) - [j67]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): 21:1-21:38 (2023) - [c201]Orna Kupferman, Noam Shenwald:
Games with Trading of Control. CONCUR 2023: 19:1-19:17 - [c200]Yoav Feinstein, Orna Kupferman:
Monotonicity Characterizations of Regular Languages. FSTTCS 2023: 26:1-26:19 - [c199]Bader Abu Radi, Orna Kupferman:
On Semantically-Deterministic Automata. ICALP 2023: 109:1-109:20 - [e2]Orna Kupferman, Pawel Sobocinski:
Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings. Lecture Notes in Computer Science 13992, Springer 2023, ISBN 978-3-031-30828-4 [contents] - [i16]Bader Abu Radi, Orna Kupferman:
On Semantically-Deterministic Automata. CoRR abs/2305.15489 (2023) - 2022
- [j66]Luca Aceto, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
Interviews with the 2022 CONCUR Test-of-Time Award Recipients. Bull. EATCS 138 (2022) - [j65]Orna Kupferman:
Using the past for resolving the future. Frontiers Comput. Sci. 4 (2022) - [j64]Orna Kupferman:
Multi-Valued Reasoning about Reactive Systems. Found. Trends Theor. Comput. Sci. 15(2): 126-228 (2022) - [j63]Shaull Almagor, Udi Boker, Orna Kupferman:
What's decidable about weighted automata? Inf. Comput. 282: 104651 (2022) - [j62]Orna Kupferman, Nir Lavee, Salomon Sickert:
Certifying DFA Bounds for Recognition and Separation. Innov. Syst. Softw. Eng. 18(3): 405-416 (2022) - [j61]Bader Abu Radi, Orna Kupferman:
Minimization and Canonization of GFG Transition-Based Automata. Log. Methods Comput. Sci. 18(3) (2022) - [c198]Bader Abu Radi, Orna Kupferman:
Minimization of Automata for Liveness Languages. ATVA 2022: 191-207 - [c197]Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi:
CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR 2022: 1:1-1:3 - [c196]Orna Kupferman, Naama Shamash Halevy:
Energy Games with Resource-Bounded Environments. CONCUR 2022: 19:1-19:23 - [c195]Orna Kupferman, Asaf Petruschka:
Lazy Regular Sensing. DCFS 2022: 155-169 - [c194]Orna Kupferman, Ofer Leshkowitz:
Synthesis of Privacy-Preserving Systems. FSTTCS 2022: 42:1-42:23 - [c193]Orna Kupferman, Noam Shenwald:
The Complexity of LTL Rational Synthesis. TACAS (1) 2022: 25-45 - [i15]Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz:
A Hierarchy of Nondeterminism. CoRR abs/2209.09866 (2022) - 2021
- [c192]Orna Kupferman, Nir Lavee, Salomon Sickert:
Certifying DFA Bounds for Recognition and Separation. ATVA 2021: 48-64 - [c191]Orna Kupferman, Salomon Sickert:
Certifying Inexpressibility. FoSSaCS 2021: 385-405 - [c190]Orna Kupferman, Noam Shenwald:
Perspective Multi-Player Games. LICS 2021: 1-13 - [c189]Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz:
A Hierarchy of Nondeterminism. MFCS 2021: 85:1-85:21 - [p3]Javier Esparza, Orna Kupferman, Moshe Y. Vardi:
Verification. Handbook of Automata Theory (II.) 2021: 1415-1456 - [i14]Orna Kupferman, Salomon Sickert:
Certifying Inexpressibility. CoRR abs/2101.08756 (2021) - [i13]Bader Abu Radi, Orna Kupferman:
Minimization and Canonization of GFG Transition-Based Automata. CoRR abs/2106.06745 (2021) - [i12]Orna Kupferman, Nir Lavee, Salomon Sickert:
Certifying DFA Bounds for Recognition and Separation. CoRR abs/2107.01566 (2021) - [i11]Shaull Almagor, Orna Kupferman:
Good-Enough Synthesis. CoRR abs/2109.03594 (2021) - 2020
- [j60]Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic resource allocation games. Theor. Comput. Sci. 807: 42-55 (2020) - [c188]Rachel Faran, Orna Kupferman:
On (I/O)-Aware Good-For-Games Automata. ATVA 2020: 161-178 - [c187]Shaull Almagor, Orna Kupferman:
Good-Enough Synthesis. CAV (2) 2020: 541-563 - [c186]Gili Bielous, Orna Kupferman:
Coverage and Vacuity in Network Formation Games. CSL 2020: 10:1-10:18 - [c185]Ravid Alon, Orna Kupferman:
Mutually Accepting Capacitated Automata. DCFS 2020: 1-12 - [c184]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning About Quality and Fuzziness of Strategic Behaviours. ECAI 2020: 2887-2888 - [c183]Orna Kupferman:
From Correctness to High Quality. FMCAD 2020: 1 - [c182]Orna Kupferman, Noam Shenwald:
Perspective Games with Notifications. FSTTCS 2020: 51:1-51:16 - [c181]Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi:
Unary Prime Languages. MFCS 2020: 51:1-51:12 - [c180]Orna Kupferman, Ofer Leshkowitz:
On Repetition Languages. MFCS 2020: 59:1-59:14 - [c179]Orna Kupferman:
Games with Full, Longitudinal, and Transverse Observability. RP 2020: 20-34 - [c178]Rachel Faran, Orna Kupferman:
On Synthesis of Specifications with Arithmetic. SOFSEM 2020: 161-173 - [c177]Bader Abu Radi, Orna Kupferman:
Canonicity in GFG and Transition-Based Automata. GandALF 2020: 199-215
2010 – 2019
- 2019
- [j59]Shibashis Guha, Orna Kupferman, Gal Vardi:
Multi-player flow games. Auton. Agents Multi Agent Syst. 33(6): 798-820 (2019) - [j58]Orna Kupferman, Sarai Sheinvald:
Capacitated automata and systems. Inf. Comput. 269 (2019) - [j57]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. 30(6-7): 831-873 (2019) - [j56]Rachel Faran, Orna Kupferman:
A Parametrized Analysis of Algorithms on Hierarchical Graphs. Int. J. Found. Comput. Sci. 30(6-7): 979-1003 (2019) - [j55]Orna Kupferman, Gal Vardi:
Flow Logic. Log. Methods Comput. Sci. 15(4) (2019) - [c176]Ayrat Khalimov, Orna Kupferman:
Register-Bounded Synthesis. CONCUR 2019: 25:1-25:16 - [c175]Bader Abu Radi, Orna Kupferman:
Minimizing GFG Transition-Based Automata. ICALP 2019: 100:1-100:16 - [c174]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning about Quality and Fuzziness of Strategic Behaviours. IJCAI 2019: 1588-1594 - [c173]Orna Kupferman, Gal Vardi:
Perspective Games. LICS 2019: 1-13 - [i10]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning about Quality and Fuzziness of Strategic Behaviours. CoRR abs/1905.11537 (2019) - 2018
- [j54]Rachel Faran, Orna Kupferman:
Spanning the spectrum from safety to liveness. Acta Informatica 55(8): 703-732 (2018) - [j53]Orna Kupferman, Gal Vardi:
On relative and probabilistic finite counterability. Formal Methods Syst. Des. 52(2): 117-146 (2018) - [j52]Guy Avni, Shibashis Guha, Orna Kupferman:
An Abstraction-Refinement Methodologyfor Reasoning about Network Games†. Games 9(3): 39 (2018) - [j51]Guy Avni, Orna Kupferman:
Synthesis from component libraries with costs. Theor. Comput. Sci. 712: 50-72 (2018) - [c172]Shibashis Guha, Orna Kupferman, Gal Vardi:
Multi-Player Flow Games. AAMAS 2018: 104-112 - [c171]Hana Chockler, Shibashis Guha, Orna Kupferman:
Timed Vacuity. FM 2018: 438-455 - [c170]Orna Kupferman, Gal Vardi:
The Unfortunate-Flow Problem. ICALP 2018: 157:1-157:14 - [c169]Shaull Almagor, Orna Kupferman, Giuseppe Perelli:
Synthesis of Controllable Nash Equilibria in Quantitative Objective Game. IJCAI 2018: 35-41 - [c168]Orna Kupferman:
Playing with the Maximum-Flow Problem. LPAR 2018: 18-25 - [c167]Rachel Faran, Orna Kupferman:
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems. LPAR 2018: 343-362 - [c166]Orna Kupferman, Tami Tamir:
Alternating Reachability Games with Behavioral and Revenue Objectives. LPAR 2018: 498-514 - [c165]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed Network Games with Clocks. MFCS 2018: 23:1-23:18 - [c164]Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi:
Spanning-Tree Games. MFCS 2018: 35:1-35:16 - [p2]Orna Kupferman:
Automata Theory and Model Checking. Handbook of Model Checking 2018: 107-151 - [i9]Orna Kupferman, Gal Vardi:
Flow Logic. CoRR abs/1806.05956 (2018) - [i8]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed Network Games with Clocks. CoRR abs/1808.04882 (2018) - 2017
- [j50]Shaull Almagor, Orna Kupferman:
Latticed-LTL synthesis in the presence of noisy inputs. Discret. Event Dyn. Syst. 27(3): 547-572 (2017) - [c163]Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, Yaron Velner:
Quantitative Assume Guarantee Synthesis. CAV (2) 2017: 353-374 - [c162]Orna Kupferman, Gal Vardi:
Flow Logic. CONCUR 2017: 9:1-9:18 - [c161]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. DCFS 2017: 3-15 - [c160]Rachel Faran, Orna Kupferman:
A Parametrized Analysis of Algorithms on Hierarchical Graphs. DCFS 2017: 114-127 - [c159]Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata?. FSTTCS 2017: 18:1-18:14 - [c158]Orna Kupferman, Gal Vardi, Moshe Y. Vardi:
Flow Games. FSTTCS 2017: 38:38-38:16 - [c157]Guy Avni, Shibashis Guha, Orna Kupferman:
An Abstraction-Refinement Methodology for Reasoning about Network Games. IJCAI 2017: 70-76 - [c156]Guy Avni, Shibashis Guha, Orna Kupferman:
Timed Network Games. MFCS 2017: 37:1-37:16 - [c155]Orna Kupferman:
Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk). STOC 2017: 6 - [c154]Orna Kupferman, Tami Tamir:
Hierarchical Network Formation Games. TACAS (1) 2017: 229-246 - [i7]Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata? CoRR abs/1710.04115 (2017) - 2016
- [j49]Orna Kupferman, Giuseppe Perelli, Moshe Y. Vardi:
Synthesis with rational environments. Ann. Math. Artif. Intell. 78(1): 3-20 (2016) - [j48]Guy Avni, Orna Kupferman, Tami Tamir:
Network-formation games with regular objectives. Inf. Comput. 251: 165-178 (2016) - [j47]Shaull Almagor, Udi Boker, Orna Kupferman:
Formally Reasoning About Quality. J. ACM 63(3): 24:1-24:56 (2016) - [c153]Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CONCUR 2016: 9:1-9:15 - [c152]Shaull Almagor, Orna Kupferman:
High-Quality Synthesis Against Stochastic Environments. CSL 2016: 28:1-28:17 - [c151]Orna Kupferman:
On High-Quality Synthesis. CSR 2016: 1-15 - [c150]Orna Kupferman, Sarai Sheinvald:
On the Capacity of Capacitated Automata. LATA 2016: 307-319 - [c149]Orna Kupferman, Gal Vardi:
Eulerian Paths with Regular Constraints. MFCS 2016: 62:1-62:15 - [c148]Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic Resource Allocation Games. SAGT 2016: 153-166 - [i6]Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CoRR abs/1604.07064 (2016) - [i5]Shaull Almagor, Orna Kupferman:
High-Quality Synthesis Against Stochastic Environments. CoRR abs/1608.06567 (2016) - 2015
- [j46]Orna Kupferman, Jonathan Mosheiff:
Prime languages. Inf. Comput. 240: 90-107 (2015) - [j45]Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Profile trees for Büchi word automata, with application to determinization. Inf. Comput. 245: 136-151 (2015) - [j44]Shulamit Halamish, Orna Kupferman:
Minimizing Deterministic Lattice Automata. ACM Trans. Comput. Log. 16(1): 1:1-1:21 (2015) - [c147]Rachel Faran, Orna Kupferman:
Spanning the Spectrum from Safety to Liveness. ATVA 2015: 183-200 - [c146]Hila Gonen, Orna Kupferman:
Inherent Vacuity in Lattice Automata. Fields of Logic and Computation II 2015: 174-192 - [c145]Shaull Almagor, Guy Avni, Orna Kupferman:
Repairing Multi-Player Games. CONCUR 2015: 325-339 - [c144]Orna Kupferman, Gal Vardi:
On Relative and Probabilistic Finite Counterability. CSL 2015: 175-192 - [c143]Guy Avni, Orna Kupferman, Tami Tamir:
Congestion Games with Multisets of Resources and Applications in Synthesis. FSTTCS 2015: 365-379 - [c142]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
The Sensing Cost of Monitoring and Synthesis. FSTTCS 2015: 380-393 - [c141]Guy Avni, Orna Kupferman:
Stochastization of Weighted Automata. MFCS (1) 2015: 89-102 - 2014
- [j43]Guy Avni, Orna Kupferman:
An abstraction-refinement framework for trigger querying. Formal Methods Syst. Des. 44(2): 149-175 (2014) - [j42]Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. 15(4): 27:1-27:25 (2014) - [j41]Guy Avni, Orna Kupferman:
Parameterized Weighted Containment. ACM Trans. Comput. Log. 16(1): 6:1-6:25 (2014) - [c140]Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems. ATVA 2014: 348-363 - [c139]Guy Avni, Orna Kupferman, Tami Tamir:
From Reachability to Temporal Specifications in Cost-Sharing Games. IJCAR 2014: 1-15 - [c138]Guy Avni, Orna Kupferman:
Synthesis from Component Libraries with Costs. CONCUR 2014: 156-172 - [c137]Orna Kupferman, Giuseppe Perelli, Moshe Y. Vardi:
Synthesis with Rational Environments. EUMAS 2014: 219-235 - [c136]Guy Avni, Orna Kupferman, Tami Tamir:
Network-Formation Games with Regular Objectives. FoSSaCS 2014: 119-133 - [c135]Shaull Almagor, Orna Kupferman:
Latticed-LTL Synthesis in the Presence of Noisy Inputs. FoSSaCS 2014: 226-241 - [c134]Orna Kupferman, Tami Tamir:
Properties and Utilization of Capacitated Automata (Invited Talk). FSTTCS 2014: 33-44 - [c133]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Regular Sensing. FSTTCS 2014: 161-173 - [c132]Orna Kupferman:
Variations on Safety. TACAS 2014: 1-14 - [c131]Shaull Almagor, Udi Boker, Orna Kupferman:
Discounting in LTL. TACAS 2014: 424-439 - [i4]Shaull Almagor, Udi Boker, Orna Kupferman:
Discounting in LTL. CoRR abs/1406.4249 (2014) - 2013
- [j40]Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi:
Unifying Büchi Complementation Constructions. Log. Methods Comput. Sci. 9(1) (2013) - [j39]Guy Avni, Orna Kupferman:
When does abstraction help? Inf. Process. Lett. 113(22-24): 901-905 (2013) - [j38]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Rigorous approximated determinization of weighted automata. Theor. Comput. Sci. 480: 104-117 (2013) - [c130]Sigal Weiner, Matan Hasson, Orna Kupferman, Eyal Pery, Zohar Shevach:
Weighted Safety. ATVA 2013: 133-147 - [c129]Shoham Ben-David, Orna Kupferman:
A Framework for Ranking Vacuity Results. ATVA 2013: 148-162 - [c128]Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications. ATVA 2013: 397-411 - [c127]Shaull Almagor, Guy Avni, Orna Kupferman:
Automatic Generation of Quality Specifications. CAV 2013: 479-494 - [c126]Guy Avni, Orna Kupferman:
Parameterized Weighted Containment. FoSSaCS 2013: 369-384 - [c125]Shoham Ben-David, Hana Chockler, Orna Kupferman:
Attention-Based Coverage Metrics. Haifa Verification Conference 2013: 230-245 - [c124]