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] - [i17]Orna Kupferman, Ofer Leshkowitz, Namma Shamash Halevy:
Synthesis with Privacy Against an Observer. CoRR abs/2411.08635 (2024) - 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]Shaull Almagor, Udi Boker, Orna Kupferman:
Formalizing and Reasoning about Quality. ICALP (2) 2013: 15-27 - [c123]Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak:
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) 2013: 89-100 - [c122]Orna Kupferman, Jonathan Mosheiff:
Prime Languages. MFCS 2013: 607-618 - [c121]Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Profile Trees for Büchi Word Automata, with Application to Determinization. GandALF 2013: 107-121 - 2012
- [j37]Orna Kupferman, Tami Tamir:
Coping with selfish on-going behaviors. Inf. Comput. 210: 1-12 (2012) - [j36]Benjamin Aminof, Orna Kupferman, Aniello Murano:
Improved model checking of hierarchical systems. Inf. Comput. 210: 68-86 (2012) - [j35]Orna Kupferman, Amir Pnueli, Moshe Y. Vardi:
Once and for all. J. Comput. Syst. Sci. 78(3): 981-996 (2012) - [j34]Udi Boker, Orna Kupferman:
Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. 13(4): 29:1-29:26 (2012) - [c120]Shulamit Halamish, Orna Kupferman:
Approximating Deterministic Lattice Automata. ATVA 2012: 27-41 - [c119]Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
Model Checking Systems and Specifications with Parameterized Atomic Propositions. ATVA 2012: 122-136 - [c118]Guy Avni, Orna Kupferman:
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. CONCUR 2012: 84-99 - [c117]Orna Kupferman, Sigal Weiner:
Environment-Friendly Safety. Haifa Verification Conference 2012: 227-242 - [c116]Orna Kupferman:
Recent Challenges and Ideas in Temporal Synthesis. SOFSEM 2012: 88-98 - 2011
- [c115]Shaull Almagor, Orna Kupferman:
Max and Sum Semantics for Alternating Weighted Automata. ATVA 2011: 13-27 - [c114]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Formal Analysis of Online Algorithms. ATVA 2011: 213-227 - [c113]Shaull Almagor, Udi Boker, Orna Kupferman:
What's Decidable about Weighted Automata? ATVA 2011: 482-491 - [c112]Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke:
Unifying Büchi Complementation Constructions. CSL 2011: 248-263 - [c111]Udi Boker, Orna Kupferman:
Co-Büching Them All. FoSSaCS 2011: 184-198 - [c110]Shulamit Halamish, Orna Kupferman:
Minimizing Deterministic Lattice Automata. FoSSaCS 2011: 199-213 - [c109]Orna Kupferman, Dorsa Sadigh, Sanjit A. Seshia:
Synthesis with Clairvoyance. Haifa Verification Conference 2011: 5-19 - [c108]Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. LICS 2011: 43-52 - [c107]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Rigorous Approximated Determinization of Weighted Automata. LICS 2011: 345-354 - [c106]Guy Avni, Orna Kupferman:
An Abstraction-Refinement Framework for Trigger Querying. SAS 2011: 263-279 - [c105]Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis:
Temporal Synthesis for Bounded Systems and Environments. STACS 2011: 615-626 - 2010
- [j33]Orna Kupferman, Yoad Lustig:
Latticed Simulation Relations and Games. Int. J. Found. Comput. Sci. 21(2): 167-189 (2010) - [j32]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Reasoning about online algorithms with weighted automata. ACM Trans. Algorithms 6(2): 28:1-28:36 (2010) - [j31]Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
Erratum for "What causes a system to satisfy a specification?". ACM Trans. Comput. Log. 11(4): 29:1-29:2 (2010) - [c104]Shaull Almagor, Yoram Hirshfeld, Orna Kupferman:
Promptness in omega-Regular Automata. ATVA 2010: 22-36 - [c103]Udi Boker, Orna Kupferman:
The Quest for a Tight Translation of Büchi to co-Büchi Automata. Fields of Logic and Computation 2010: 147-164 - [c102]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
An Automata-Theoretic Approach to Infinite-State Systems. Essays in Memory of Amir Pnueli 2010: 202-259 - [c101]Udi Boker, Orna Kupferman, Avital Steinitz:
Parityizing Rabin and Streett. FSTTCS 2010: 412-423 - [c100]Udi Boker, Orna Kupferman, Adin Rosenberg:
Alternation Removal in Büchi Automata. ICALP (2) 2010: 76-87 - [c99]Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
Variable Automata over Infinite Alphabets. LATA 2010: 561-572 - [c98]Orna Kupferman, Moshe Y. Vardi:
Synthesis of Trigger Properties. LPAR (Dakar) 2010: 312-331 - [c97]Orna Kupferman, Tami Tamir:
Coping with Selfish On-Going Behaviors. LPAR (Dakar) 2010: 501-516 - [c96]Orna Kupferman, Adin Rosenberg:
The Blowup in Translating LTL to Deterministic Automata. MoChArt 2010: 85-94 - [c95]Dana Fisman, Orna Kupferman, Yoad Lustig:
Rational Synthesis. TACAS 2010: 190-204 - [c94]Benjamin Aminof, Orna Kupferman, Aniello Murano:
Improved Model Checking of Hierarchical Systems. VMCAI 2010: 61-77 - [p1]Orna Kupferman:
Multi-Valued Automata and Their Applications. Logics and Languages for Reliability and Security 2010: 179-194
2000 – 2009
- 2009
- [j30]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
From liveness to promptness. Formal Methods Syst. Des. 34(2): 83-103 (2009) - [c93]Orna Kupferman, Nir Piterman:
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. FoSSaCS 2009: 182-196 - [c92]Dana Fisman, Orna Kupferman:
Reasoning about Finite-State Switched Systems. Haifa Verification Conference 2009: 71-86 - [c91]Udi Boker, Orna Kupferman:
Co-ing Büchi Made Tight and Useful. LICS 2009: 245-254 - [c90]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Reasoning about online algorithms with weighted automata. SODA 2009: 835-844 - [e1]Rastislav Bodík, Orna Kupferman, Douglas R. Smith, Eran Yahav:
Software Synthesis, 06.12. - 11.12.2009. Dagstuhl Seminar Proceedings 09501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i3]Rastislav Bodík, Orna Kupferman, Douglas R. Smith, Eran Yahav:
09501 Abstracts Collection - Software Synthesis. Software Synthesis 2009 - [i2]Dana Fisman, Orna Kupferman, Yoad Lustig:
Rational Synthesis. CoRR abs/0907.3019 (2009) - 2008
- [j29]Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
What causes a system to satisfy a specification?. ACM Trans. Comput. Log. 9(3): 20:1-20:26 (2008) - [c89]Orna Kupferman, Wenchao Li, Sanjit A. Seshia:
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance. FMCAD 2008: 1-9 - [c88]Dana Fisman, Orna Kupferman, Sarai Sheinvald-Faragy, Moshe Y. Vardi:
A Framework for Inherent Vacuity. Haifa Verification Conference 2008: 7-22 - [c87]Benjamin Aminof, Orna Kupferman, Omer Lev:
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. LPAR 2008: 183-197 - [c86]Dana Fisman, Orna Kupferman, Yoad Lustig:
On Verifying Fault Tolerance of Distributed Protocols. TACAS 2008: 315-331 - [c85]Thomas Ball, Orna Kupferman:
Vacuity in Testing. TAP 2008: 4-17 - [c84]Orna Kupferman, Yoad Lustig:
Multi-valued Logics, Automata, Simulations, and Games. VMCAI 2008: 5 - 2007
- [j28]Orna Kupferman:
Exponential Gaps in our Knowledge. Bull. EATCS 92: 45-64 (2007) - [j27]Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman:
Concurrent reachability games. Theor. Comput. Sci. 386(3): 188-217 (2007) - [c83]Orna Kupferman, Yoad Lustig:
Latticed Simulation Relations and Games. ATVA 2007: 316-330 - [c82]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
From Liveness to Promptness. CAV 2007: 406-419 - [c81]Thomas Ball, Orna Kupferman, Mooly Sagiv:
Leaping Loops in the Presence of Abstraction. CAV 2007: 491-503 - [c80]Orna Kupferman:
Tightening the Exchange Rates Between Automata. CSL 2007: 7-22 - [c79]Orna Kupferman, Yoad Lustig:
What Triggers a Behavior? FMCAD 2007: 146-153 - [c78]Orna Kupferman, Yoad Lustig:
Lattice Automata. VMCAI 2007: 199-213 - [c77]Thomas Ball, Orna Kupferman:
Better Under-Approximation of Programs by Hiding Variables. VMCAI 2007: 314-328 - 2006
- [j26]Orna Kupferman, Shmuel Safra, Moshe Y. Vardi:
Relating word and tree automata. Ann. Pure Appl. Log. 138(1-3): 126-146 (2006) - [j25]Hana Chockler, Orna Kupferman, Moshe Y. Vardi:
Coverage metrics for temporal logic model checking*. Formal Methods Syst. Des. 28(3): 189-212 (2006) - [j24]Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi:
Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. 17(4): 851-868 (2006) - [j23]Orna Kupferman, Gila Morgenstern, Aniello Murano:
Typeness for omega-regular Automata. Int. J. Found. Comput. Sci. 17(4): 869-884 (2006) - [j22]Hana Chockler, Orna Kupferman, Moshe Y. Vardi:
Coverage metrics for formal verification. Int. J. Softw. Tools Technol. Transf. 8(4-5): 373-386 (2006) - [j21]Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar:
On the universal and existential fragments of the mu-calculus. Theor. Comput. Sci. 354(2): 173-186 (2006) - [c76]Orna Kupferman, Robby Lampert:
On the Construction of Fine Automata for Safety Properties. ATVA 2006: 110-124 - [c75]Benjamin Aminof, Orna Kupferman:
On the Succinctness of Nondeterminism. ATVA 2006: 125-140 - [c74]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Safraless Compositional Synthesis. CAV 2006: 31-44 - [c73]Orna Kupferman:
Sanity Checks in Formal Verification. CONCUR 2006: 37-51 - [c72]Orna Kupferman, Sarai Sheinvald-Faragy:
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words. CONCUR 2006: 492-508 - [c71]Orna Kupferman:
Avoiding Determinization. LICS 2006: 243-254 - [c70]Orna Kupferman, Moshe Y. Vardi:
Memoryful Branching-Time Logic. LICS 2006: 265-274 - [c69]Thomas Ball, Orna Kupferman:
An Abstraction-Refinement Framework for Multi-Agent Systems. LICS 2006: 379-388 - [c68]Orna Kupferman, Yoad Lustig, Moshe Y. Vardi:
On Locally Checkable Properties. LPAR 2006: 302-316 - 2005
- [j20]Orna Kupferman, Moshe Y. Vardi:
From complementation to certification. Theor. Comput. Sci. 345(1): 83-100 (2005) - [j19]Orna Kupferman, Moshe Y. Vardi:
From linear time to branching time. ACM Trans. Comput. Log. 6(2): 273-294 (2005) - [c67]Thomas Ball, Orna Kupferman, Greta Yorsh:
Abstraction for Falsification. CAV 2005: 67-81 - [c66]Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar:
Verifying Quantitative Properties Using Bound Functions. CHARME 2005: 50-64 - [c65]Doron Bustan, Alon Flaisher, Orna Grumberg, Orna Kupferman, Moshe Y. Vardi:
Regular Vacuity. CHARME 2005: 191-206 - [c64]Orna Kupferman, Moshe Y. Vardi:
Safraless Decision Procedures. FOCS 2005: 531-542 - [c63]Orna Kupferman, Moshe Y. Vardi:
Complementation Constructions for Nondeterministic Automata on Infinite Words. TACAS 2005: 206-221 - 2004
- [j18]Hana Chockler, Orna Kupferman:
w-Regular languages are testable with a constant number of queries. Theor. Comput. Sci. 329(1-3): 71-92 (2004) - [c62]Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi:
Büchi Complementation Made Tighter. ATVA 2004: 64-78 - [c61]Orna Kupferman, Gila Morgenstern, Aniello Murano:
Typeness for omega-Regular Automata. ATVA 2004: 324-338 - [c60]Benjamin Aminof, Thomas Ball, Orna Kupferman:
Reasoning About Systems with Transition Fairness. LPAR 2004: 194-208 - [c59]Doron Bustan, Orna Kupferman, Moshe Y. Vardi:
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy. STACS 2004: 522-533 - [c58]Orna Kupferman, Moshe Y. Vardi:
From Complementation to Certification. TACAS 2004: 591-606 - 2003
- [j17]Thomas A. Henzinger, Orna Kupferman, Shaz Qadeer:
From Pre-Historic to Post-Modern Symbolic Model Checking. Formal Methods Syst. Des. 23(3): 303-327 (2003) - [j16]Orna Kupferman, Moshe Y. Vardi:
Vacuity detection in temporal model checking. Int. J. Softw. Tools Technol. Transf. 4(2): 224-233 (2003) - [j15]Orna Kupferman, David Harel:
Response to "Comments on 'On Object Systems and Behavior Inheritance'". IEEE Trans. Software Eng. 29(6): 576 (2003) - [c57]Gadiel Auerbach, Orna Kupferman:
Formal Analysis of Scientific-Computation Methods. ADHS 2003: 295-300 - [c56]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Fair Equivalence Relations. Verification: Theory and Practice 2003: 702-732 - [c55]Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi:
On Complementing Nondeterministic Büchi Automata. CHARME 2003: 96-110 - [c54]Hana Chockler, Orna Kupferman, Moshe Y. Vardi:
Coverage Metrics for Formal Verification. CHARME 2003: 111-125 - [c53]Orna Kupferman, Moshe Y. Vardi:
Π2 ∩ Σ2 ≡ AFMC. ICALP 2003: 697-713 - [c52]Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar:
On the Universal and Existential Fragments of the µ-Calculus. TACAS 2003: 49-64 - [c51]Roy Armoni, Doron Bustan, Orna Kupferman, Moshe Y. Vardi:
Resets vs. Aborts in Linear Temporal Logic. TACAS 2003: 65-80 - [i1]Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
What Causes a System to Satisfy a Specification? CoRR cs.LO/0312036 (2003) - 2002
- [j14]Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani:
Fair Simulation. Inf. Comput. 173(1): 64-81 (2002) - [j13]David Harel, Orna Kupferman, Moshe Y. Vardi:
On the Complexity of Verifying Concurrent Transition Systems. Inf. Comput. 173(2): 143-161 (2002) - [j12]Rajeev Alur, Thomas A. Henzinger, Orna Kupferman:
Alternating-time temporal logic. J. ACM 49(5): 672-713 (2002) - [j11]David Harel, Orna Kupferman:
On Object Systems and Behavioral Inheritance. IEEE Trans. Software Eng. 28(9): 889-903 (2002) - [c50]Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi:
The Complexity of the Graded µ-Calculus. CADE 2002: 423-437 - [c49]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Model Checking Linear Properties of Prefix-Recognizable Systems. CAV 2002: 371-385 - [c48]Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger:
Trading Probability for Fairness. CSL 2002: 292-305 - [c47]Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y. C. Mang:
Synthesis of Uninitialized Systems. ICALP 2002: 644-656 - [c46]Hana Chockler, Orna Kupferman:
Coverage of Implementations by Simulating Specifications. IFIP TCS 2002: 409-421 - [c45]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Pushdown Specifications. LPAR 2002: 262-277 - [c44]Orna Kupferman, Sharon Zuhovitzky:
An Improved Algorithm for the Membership Problem for Extended Regular Expressions. MFCS 2002: 446-458 - [c43]Hana Chockler, Orna Kupferman:
omega-Regular Languages Are Testable with a Constant Number of Queries. RANDOM 2002: 26-28 - 2001
- [j10]Orna Kupferman, Moshe Y. Vardi:
Model Checking of Safety Properties. Formal Methods Syst. Des. 19(3): 291-314 (2001) - [j9]Orna Kupferman, Moshe Y. Vardi, Pierre Wolper:
Module Checking. Inf. Comput. 164(2): 322-344 (2001) - [j8]Orna Kupferman, Moshe Y. Vardi:
Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(3): 408-429 (2001) - [c42]Hana Chockler, Orna Kupferman, Robert P. Kurshan, Moshe Y. Vardi:
A Practical Approach to Coverage in Model Checking. CAV 2001: 66-78 - [c41]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Extended Temporal Logic Revisited. CONCUR 2001: 519-535 - [c40]Valerie King, Orna Kupferman, Moshe Y. Vardi:
On the Complexity of Parity Word Automata. FoSSaCS 2001: 276-286 - [c39]Orna Kupferman, Moshe Y. Vardi:
Synthesizing Distributed Systems. LICS 2001: 389-398 - [c38]Orna Kupferman, Moshe Y. Vardi:
On Bounded Specifications. LPAR 2001: 24-38 - [c37]Hana Chockler, Orna Kupferman, Moshe Y. Vardi:
Coverage Metrics for Temporal Logic Model Checking. TACAS 2001: 528-542 - 2000
- [j7]Orna Kupferman, Moshe Y. Vardi, Pierre Wolper:
An automata-theoretic approach to branching-time model checking. J. ACM 47(2): 312-360 (2000) - [j6]Orna Kupferman, Moshe Y. Vardi:
An automata-theortetic approach to modular model checking. ACM Trans. Program. Lang. Syst. 22(1): 87-128 (2000) - [c36]Orna Kupferman, Moshe Y. Vardi:
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems. CAV 2000: 36-52 - [c35]Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi:
Open Systems in Reactive Environments: Control and Synthesis. CONCUR 2000: 92-107 - [c34]Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Fair Equivalence Relations. FSTTCS 2000: 151-163 - [c33]Orna Kupferman, Moshe Y. Vardi:
µ-Calculus Synthesis. MFCS 2000: 497-507 - [c32]David Harel, Orna Kupferman:
On the Behavioral Inheritance of State-Based Objects. TOOLS (34) 2000: 83-94 - [c31]Shoham Shamir, Orna Kupferman, Eli Shamir:
Branching-Depth Hierarchies. EXPRESS 2000: 65-78
1990 – 1999
- 1999
- [j5]Orna Kupferman, Moshe Y. Vardi:
Church's problem revisited. Bull. Symb. Log. 5(2): 245-263 (1999) - [j4]Orna Kupferman:
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. J. Log. Comput. 9(2): 135-147 (1999) - [c30]Orna Kupferman, Moshe Y. Vardi:
Model Checking of Safety Properties. CAV 1999: 172-183 - [c29]Orna Kupferman, Moshe Y. Vardi:
Vacuity Detection in Temporal Model Checking. CHARME 1999: 82-96 - [c28]Orna Kupferman, Moshe Y. Vardi:
Robust Satisfaction. CONCUR 1999: 383-398 - [c27]Orna Kupferman, Moshe Y. Vardi:
The Weakness of Self-Complementation. STACS 1999: 455-466 - 1998
- [j3]Orna Kupferman, Moshe Y. Vardi:
Verification of Fair Transition Systems. Chic. J. Theor. Comput. Sci. 1998 (1998) - [c26]Thomas A. Henzinger, Orna Kupferman, Shaz Qadeer:
From Pre-historic to Post-modern Symbolic Model Checking. CAV 1998: 195-206 - [c25]Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi:
Alternating Refinement Relations. CONCUR 1998: 163-178 - [c24]Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman:
Concurrent Reachability Games. FOCS 1998: 564-575 - [c23]Orna Kupferman, Moshe Y. Vardi:
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. LICS 1998: 81-92 - [c22]Orna Kupferman, Moshe Y. Vardi:
Relating linear and branching model checking. PROCOMET 1998: 304-326 - [c21]Orna Kupferman, Moshe Y. Vardi:
Weak Alternating Automata and Tree Automata Emptiness. STOC 1998: 224-233 - 1997
- [c20]Orna Kupferman, Moshe Y. Vardi:
Module Checking Revisited. CAV 1997: 36-47 - [c19]Rajeev Alur, Thomas A. Henzinger, Orna Kupferman:
Alternating-Time Temporal Logic. COMPOS 1997: 23-60 - [c18]Orna Kupferman, Moshe Y. Vardi:
Modular Model Checking. COMPOS 1997: 381-401 - [c17]David Harel, Orna Kupferman, Moshe Y. Vardi:
On the Complexity of Verifying Concurrent Transition Systems. CONCUR 1997: 258-272 - [c16]Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani:
Fair Simulation. CONCUR 1997: 273-287 - [c15]Orna Kupferman, Robert P. Kurshan, Mihalis Yannakakis:
Existence of Reduction Hierarchies. CSL 1997: 327-340 - [c14]Rajeev Alur, Thomas A. Henzinger, Orna Kupferman:
Alternating-time Temporal Logic. FOCS 1997: 100-109 - [c13]Thomas A. Henzinger, Orna Kupferman:
From Quantity to Quality. HART 1997: 48-62 - [c12]Orna Kupferman, Moshe Y. Vardi:
Weak Alternating Automata Are Not That Weak. ISTCS 1997: 147-158 - 1996
- [j2]Orna Kupferman, Orna Grumberg:
Branching-Time Temporal Logic and Tree Automata. Inf. Comput. 125(1): 62-69 (1996) - [j1]Orna Kupferman, Orna Grumberg:
Buy One, Get One Free!!! J. Log. Comput. 6(4): 523-539 (1996) - [c11]Orna Kupferman, Moshe Y. Vardi:
Module Checking. CAV 1996: 75-86 - [c10]Orna Kupferman, Moshe Y. Vardi:
Verification of Fair Transisiton Systems. CAV 1996: 372-382 - [c9]Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi:
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. CONCUR 1996: 514-529 - [c8]Gerard J. Holzmann, Orna Kupferman:
Not checking for closure under stuttering. The Spin Verification System 1996: 17-22 - [c7]Orna Kupferman, Shmuel Safra, Moshe Y. Vardi:
Relating Word and Tree Automata. LICS 1996: 322-332 - 1995
- [b1]Orna Kupferman:
Model checking for Branching-Time temporal logics. Technion - Israel Institute of Technology, Israel, 1995 - [c6]Orna Kupferman:
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. CAV 1995: 325-338 - [c5]Orna Kupferman, Moshe Y. Vardi:
On the Complexity of Branching Modular Model Checking (Extended Abstract). CONCUR 1995: 408-422 - [c4]Orna Kupferman, Amir Pnueli:
Once and For All. LICS 1995: 25-35 - 1994
- [c3]Orna Bernholtz, Moshe Y. Vardi, Pierre Wolper:
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). CAV 1994: 142-155 - [c2]Orna Bernholtz, Orna Grumberg:
Buy One, Get One Free!!! ICTL 1994: 210-224 - 1993
- [c1]Orna Bernholtz, Orna Grumberg:
Branching Time Temporal Logic and Amorphous Tree Automata. CONCUR 1993: 262-277
Coauthor Index
[p3] [c158] [j49] [j45] [c137] [j40] [c121] [j35] [c112] [c105] [c102] [c98] [j30] [c88] [c82] [j26] [j25] [j24] [j22] [c74] [c70] [c68] [j20] [j19] [c65] [c64] [c63] [c62] [c59] [c58] [j16] [c56] [c55] [c54] [c53] [c51] [j13] [c50] [c49] [c45] [j10] [j9] [j8] [c42] [c41] [c40] [c39] [c38] [c37] [j7] [j6] [c36] [c35] [c34] [c33] [j5] [c30] [c29] [c28] [c27] [j3] [c25] [c23] [c22] [c21] [c20] [c18] [c17] [c12] [c11] [c10] [c9] [c7] [c5] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
