Orna Kupferman

Q: What Schools Are Affiliated With Orna Kupferman

Orna Kupferman is affiliated with the following schools: University of California, Berkeley, Technion – Israel Institute of Technology, Hebrew University of Jerusalem

Orna Kupferman's AcademicInfluence.com Rankings

Orna Kupferman

Computer Science

#3091

World Rank

#3241

Historical Rank

Theoretical Computer Science

#88

World Rank

#88

Historical Rank

Database

#6655

World Rank

#6890

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Orna Kupferman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Orna Kupferman is a Professor of Computer Science and former Vice Rector at the Hebrew University of Jerusalem. She was elected to the Academia Europaea in 2016. Early life and education Kupferman served in the Israel Defense Force from 1986 to 1988. She earned her PhD at the Technion in 1995, where she was supervised by Orna Grumberg. In 1996 Kupferman joined the technical staff at Bell Labs. She moved to University of California, Berkeley in 1997, working with Thomas Henzinger.

(See a Problem?)

Orna Kupferman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Alternating-time temporal logic (1997) (1722)
An automata-theoretic approach to branching-time model checking (2000) (668)
Model Checking of Safety Properties (1999) (650)
Alternating Refinement Relations (1998) (352)
Weak alternating automata are not that weak (1997) (299)
Safraless decision procedures (2005) (237)
Concurrent reachability games (1998) (229)
Vacuity Detection in Temporal Model Checking (1999) (205)
Fair Simulation (1997) (138)
Rational Synthesis (2009) (137)
Synthesizing Distributed Systems (2001) (136)
Weak alternating automata and tree automata emptiness (1998) (127)
Open Systems in Reactive Environments: Control and Synthesis (2000) (126)
Lattice Automata (2007) (116)
Safraless Compositional Synthesis (2006) (111)
From liveness to promptness (2007) (108)
Temporal Specifications with Accumulative Values (2011) (100)
Module Checking Revisited (1997) (98)
A Practical Approach to Coverage in Model Checking (2001) (96)
Coverage metrics for formal verification (2003) (95)
What's Decidable about Weighted Automata? (2011) (94)
Modular Model Checking (1997) (89)
Freedom, weakness, and determinism: from linear-time to branching-time (1998) (86)
Synthesis with rational environments (2014) (85)
The Complexity of the Graded µ-Calculus (2002) (84)
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (2000) (83)
Variable Automata over Infinite Alphabets (2010) (82)
Church's Problem Revisited (1999) (79)
On the Complexity of Verifying Concurrent Transition Systems (1997) (74)
Sanity Checks in Formal Verification (2006) (73)
From Pre-Historic to Post-Modern Symbolic Model Checking (1998) (72)
Büchi Complementation Made Tighter (2006) (71)
What causes a system to satisfy a specification? (2003) (69)
From Quantity to Quality (1997) (66)
On Complementing Nondeterministic Büchi Automata (2003) (61)
Coverage metrics for temporal logic model checking* (2006) (60)
On Object Systems and Behavioral Inheritance (2002) (59)
Regular Vacuity (2005) (58)
Once and for all (1995) (58)
Extended Temporal Logic Revisited (2001) (56)
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions (1995) (55)
An automata-theoretic approach to modular model checking (2000) (54)
From complementation to certification (2005) (54)
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking (1996) (53)
Reasoning about online algorithms with weighted automata (2009) (53)
Verification of Fair Transition Systems (1998) (52)
On the Complexity of Parity Word Automata (2001) (51)
µ-Calculus Synthesis (2000) (50)
From linear time to branching time (2005) (50)
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance (2008) (49)
Discounting in LTL (2014) (47)
A Framework for Inherent Vacuity (2009) (46)
Abstraction for Falsification (2005) (46)
Buy One, Get One Free!!! (1994) (45)
On the Complexity of Branching Modular Model Checking (Extended Abstract) (1995) (44)
Relating word and tree automata (1996) (41)
Formalizing and Reasoning about Quality (2013) (41)
Pushdown Specifications (2002) (41)
Formally Reasoning About Quality (2016) (39)
Coverage Metrics for Temporal Logic Model Checking (2001) (39)
Verification of Fair Transisiton Systems (1996) (38)
Robust Satisfaction (1999) (37)
Relating linear and branching model checking (1998) (37)
Vacuity detection in temporal model checking (2003) (37)
Recent Challenges and Ideas in Temporal Synthesis (2012) (35)
Automata Theory and Model Checking (2018) (34)
Memoryful Branching-Time Logic (2006) (34)
Complementation Constructions for Nondeterministic Automata on Infinite Words (2005) (33)
Unifying Büchi Complementation Constructions (2013) (33)
Resets vs. Aborts in Linear Temporal Logic (2003) (33)
Verifying Quantitative Properties Using Bound Functions (2005) (32)
On Verifying Fault Tolerance of Distributed Protocols (2008) (32)
The Weakness of Self-Complementation (1999) (31)
Improved model checking of hierarchical systems (2010) (31)
Profile trees for Büchi word automata, with application to determinization (2013) (30)
Vacuity in Testing (2008) (30)
Latticed Simulation Relations and Games (2007) (29)
Nondeterminism in the Presence of a Diverse or Unknown Future (2013) (28)
An Abstraction-Refinement Framework for Multi-Agent Systems (2006) (27)
On Bounded Specifications (2001) (27)
Temporal Synthesis for Bounded Systems and Environments (2011) (27)
Alternation Removal in Büchi Automata (2010) (26)
Flow Games (2017) (26)
Model Checking Linear Properties of Prefix-Recognizable Systems (2002) (26)
On the Construction of Fine Automata for Safety Properties (2006) (25)
An Improved Algorithm for the Membership Problem for Extended Regular Expressions (2002) (23)
Leaping Loops in the Presence of Abstraction (2007) (23)
The Blowup in Translating LTL to Deterministic Automata (2010) (22)
Network-formation games with regular objectives (2014) (22)
Rigorous Approximated Determinization of Weighted Automata (2011) (21)
Repairing Multi-Player Games (2015) (20)
Reasoning About Systems with Transition Fairness (2005) (19)
On Locally Checkable Properties (2006) (19)
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words (2006) (19)
Hardware and Software: Verification and Testing (2009) (19)
On the behavioral inheritance of state-based objects (2000) (19)
Typeness for omega-regular Automata (2004) (19)
How Deterministic are Good-For-Games Automata? (2017) (18)
Not checking for closure under stuttering (1996) (17)
Alternating Re nement Relations ? ? ? (1998) (17)
Avoiding Determinization (2006) (16)
Model Checking Systems and Specifications with Parameterized Atomic Propositions (2012) (16)
Quantitative Assume Guarantee Synthesis (2017) (15)
Co-ing Büchi Made Tight and Useful (2009) (15)
Trading Probability for Fairness (2002) (15)
On the Universal and Existential Fragments of the µ-Calculus (2003) (15)
Dynamic Resource Allocation Games (2016) (14)
Minimizing GFG Transition-Based Automata (2019) (14)
An Automata-Theoretic Approach to Infinite-State Systems (2010) (14)
Model checking for Branching-Time temporal logics (1995) (14)
Promptness in omega-Regular Automata (2010) (13)
Branching-Time Temporal Logic and Tree Automata (1996) (13)
Coverage of Implementations by Simulating Specifications (2002) (13)
Synthesis of Controllable Nash Equilibria in Quantitative Objective Game (2018) (13)
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy (2004) (13)
Once and for all [temporal logic] (1995) (12)
Synthesis from Component Libraries with Costs (2014) (12)
Good-Enough Synthesis (2020) (12)
Minimizing Deterministic Lattice Automata (2011) (12)
Synthesis of Uninitialized Systems (2002) (11)
Reasoning about Quality and Fuzziness of Strategic Behaviors (2019) (11)
An Abstraction-Refinement Methodology for Reasoning about Network Games (2017) (11)
Max and Sum Semantics for Alternating Weighted Automata (2011) (11)
Hierarchical Network Formation Games (2017) (11)
Formal Analysis of Online Algorithms (2011) (11)
Aborts vs Resets in Linear Temporal Logic (2002) (10)
What Triggers a Behavior? (2007) (10)
Synthesis of Trigger Properties (2010) (10)
Latticed-LTL synthesis in the presence of noisy inputs (2017) (10)
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications (2013) (10)
Coping with selfish on-going behaviors (2010) (9)
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis (2016) (9)
On High-Quality Synthesis (2016) (8)
Counting with Automata (1999) (8)
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction (2012) (8)
Timed Network Games (2023) (7)
Translating to Co-Büchi Made Tight, Unified, and Useful (2012) (7)
Properties and Utilization of Capacitated Automata (2014) (7)
Reasoning about Finite-State Switched Systems (2009) (7)
Congestion Games with Multisets of Resources and Applications in Synthesis (2015) (7)
A Framework for Ranking Vacuity Results (2013) (7)
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems (2014) (6)
On the universal and existential fragments of the mu-calculus (2006) (6)
Spanning the spectrum from safety to liveness (2015) (6)
High-Quality Synthesis Against Stochastic Environments (2016) (6)
Parityizing Rabin and Streett (2010) (6)
Promptness in ω-regular Automata (2010) (6)
Tightening the Exchange Rates Between Automata (2007) (6)
Branching-Depth Hierarchies (2003) (6)
A Space-eecient On-the--y Algorithm for Real-time Model Checking ? (1996) (6)
When does abstraction help? (2013) (5)
On relative and probabilistic finite counterability (2018) (5)
On Synthesis of Specifications with Arithmetic (2020) (5)
Regular Sensing (2014) (5)
Prime languages (2015) (5)
Co-Büching Them All (2011) (5)
Stochastization of Weighted Automata (2015) (5)
A Hierarchy of Nondeterminism (2022) (5)
w-Regular languages are testable with a constant number of queries (2004) (5)
The Sensing Cost of Monitoring and Synthesis (2015) (5)
Canonicity in GFG and Transition-Based Automata (2020) (5)
Variations on Safety (2014) (5)
Environment-Friendly Safety (2012) (4)
Timed Network Games with Clocks (2018) (4)
Automatic Generation of Quality Specifications (2013) (4)
Multi-player flow games (2018) (4)
The Quest for a Tight Translation of Büchi to co-Büchi Automata (2010) (4)
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata (2008) (4)
Erratum for “What causes a system to satisfy a specification?” (2010) (3)
Existence of Reduction Hierarchies (1997) (3)
Synthesis with Clairvoyance (2011) (3)
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems (2018) (3)
Fair Equivalence Relations (2000) (3)
An abstraction-refinement framework for trigger querying (2011) (3)
Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk) (2017) (3)
The Complexity of LTL Rational Synthesis (2022) (3)
Capacitated automata and systems (2019) (3)
Concurrency Counts (2001) (2)
omega-Regular Languages Are Testable with a Constant Number of Queries (2002) (2)
Minimization and Canonization of GFG Transition-Based Automata (2021) (2)
Perspective Games (2019) (2)
Flow Logic (2018) (2)
Better Under-Approximation of Programs by Hiding Variables (2007) (2)
Unary Prime Languages (2020) (2)
Eulerian Paths with Regular Constraints (2016) (2)
Response to "Comments on 'On Object Systems and Behavior Inheritance'" (2003) (2)
Weighted Safety (2013) (2)
Certifying Inexpressibility (2021) (2)
Parameterized Weighted Containment (2013) (2)
On the Succinctness of Nondeterminism (2006) (1)
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (2009) (1)
Approximating Deterministic Lattice Automata (2012) (1)
On the Duality between Vacuity and Coverage (2008) (1)
Minimization of Automata for Liveness Languages (2022) (1)
On (I/O)-Aware Good-For-Games Automata (2020) (1)
An Abstraction-Refinement Methodologyfor Reasoning about Network Games† (2018) (1)
Energy Games with Resource-Bounded Environments (2022) (1)
Synthesis with rational environments (2016) (1)
On Repetition Languages (2020) (1)
Using the past for resolving the future (2023) (1)
Properties and Utilization of Capacitated Automata (Invited Talk) (2014) (1)
From Reachability to Temporal Specifications in Cost-Sharing Games (2014) (1)
Multi-valued Logics, Automata, Simulations, and Games (2008) (1)
The Unfortunate-Flow Problem (2018) (1)
An abstraction-refinement framework for trigger querying (2013) (1)
Synthesis of Controllable Nash Equilibria in Games with Quantitative Objectives (2018) (1)
Coverage and Vacuity in Network Formation Games (2020) (1)
A Parametrized Analysis of Algorithms on Hierarchical Graphs (2017) (1)
Latticed-LTL synthesis in the presence of noisy inputs (2017) (1)
Games with Full, Longitudinal, and Transverse Observability (2020) (1)
Mutually Accepting Capacitated Automata (2020) (0)
Certifying DFA Bounds for Recognition and Separation (2022) (0)
Attention-Based Coverage Metrics (2013) (0)
Lower Bounds on Witnesses for Nonemptiness of (2009) (0)
Sensing as a Complexity Measure (2017) (0)
Playing with the Maximum-Flow Problem (2018) (0)
Alternating Reachability Games with Behavioral and Revenue Objectives (2018) (0)
Trading Probability for Fairness ( Extended abstract ) (2002) (0)
Certifying DFA Bounds for Recognition and Separation (2021) (0)
From Correctness to High Quality (2020) (0)
CONCUR Test-Of-Time Award 2022 (Invited Paper) (2022) (0)
Synthesis of Privacy-Preserving Systems (2022) (0)
Lazy Regular Sensing (2022) (0)
Weak Alternating Automata Are Not That Weak 1 (0)
Spanning the spectrum from safety to liveness (2017) (0)
Veriication of Fair Transition Systems 1 (1996) (0)
On relative and probabilistic finite counterability (2017) (0)
Exponential Gaps in our Knowledge (2007) (0)
On the Capacity of Capacitated Automata (2016) (0)
Formal Analysis of Scientific-Computation Methods (2003) (0)
Coverage Metri s for Temporal Logi Model (2002) (0)
Counting with AutomataOrna KupfermanHebrew (1999) (0)
Multi-Valued Reasoning about Reactive Systems (2022) (0)
Multi-Valued Automata and Their Applications (2010) (0)
Inherent Vacuity in Lattice Automata (2015) (0)
Pi 2 cap Sigma 2 equiv AFMC. (2003) (0)
Prime Languages I , II (2014) (0)
Spanning-Tree Games (2018) (0)
09501 Abstracts Collection - Software Synthesis (2009) (0)
Automata on Infinite Words and Their Applications in Formal Verification (2017) (0)
09501 Abstracts Collection Software Synthesis Dagstuhl Seminar (2010) (0)
Perspective Games with Notifications (2020) (0)
Lazy Regular Sensing (cid:63) (2022) (0)
Perspective Multi-Player Games (2021) (0)
F L ] 8 S ep 2 02 1 GoodEnough Synthesis (2021) (0)
Timed Vacuity (2018) (0)

This paper list is powered by the following services:

Other Resources About Orna Kupferman

What Schools Are Affiliated With Orna Kupferman?

Orna Kupferman is affiliated with the following schools:

Orna Kupferman's Academic­Influence.com Rankings

Why Is Orna Kupferman Influential?

Orna Kupferman's Published Works

Published Works

Other Resources About Orna Kupferman

What Schools Are Affiliated With Orna Kupferman?

Image Attributions

Orna Kupferman's AcademicInfluence.com Rankings