| 2009 |
|---|
| 115 | EE | Orna Kupferman,
Nir Piterman:
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.
FOSSACS 2009: 182-196 |
| 114 | EE | Benjamin Aminof,
Orna Kupferman,
Robby Lampert:
Reasoning about online algorithms with weighted automata.
SODA 2009: 835-844 |
| 113 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
From liveness to promptness.
Formal Methods in System Design 34(2): 83-103 (2009) |
| 2008 |
|---|
| 112 | EE | Dana Fisman,
Orna Kupferman,
Sarai Sheinvald-Faragy,
Moshe Y. Vardi:
A Framework for Inherent Vacuity.
Haifa Verification Conference 2008: 7-22 |
| 111 | EE | Benjamin Aminof,
Orna Kupferman,
Omer Lev:
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata.
LPAR 2008: 183-197 |
| 110 | EE | Dana Fisman,
Orna Kupferman,
Yoad Lustig:
On Verifying Fault Tolerance of Distributed Protocols.
TACAS 2008: 315-331 |
| 109 | EE | Thomas Ball,
Orna Kupferman:
Vacuity in Testing.
TAP 2008: 4-17 |
| 108 | EE | Orna Kupferman,
Yoad Lustig:
Multi-valued Logics, Automata, Simulations, and Games.
VMCAI 2008: 5 |
| 107 | EE | Hana Chockler,
Joseph Y. Halpern,
Orna Kupferman:
What causes a system to satisfy a specification?.
ACM Trans. Comput. Log. 9(3): (2008) |
| 2007 |
|---|
| 106 | EE | Orna Kupferman,
Yoad Lustig:
Latticed Simulation Relations and Games.
ATVA 2007: 316-330 |
| 105 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
From Liveness to Promptness.
CAV 2007: 406-419 |
| 104 | EE | Thomas Ball,
Orna Kupferman,
Mooly Sagiv:
Leaping Loops in the Presence of Abstraction.
CAV 2007: 491-503 |
| 103 | EE | Orna Kupferman:
Tightening the Exchange Rates Between Automata.
CSL 2007: 7-22 |
| 102 | EE | Orna Kupferman,
Yoad Lustig:
What Triggers a Behavior?
FMCAD 2007: 146-153 |
| 101 | EE | Orna Kupferman,
Yoad Lustig:
Lattice Automata.
VMCAI 2007: 199-213 |
| 100 | EE | Thomas Ball,
Orna Kupferman:
Better Under-Approximation of Programs by Hiding Variables.
VMCAI 2007: 314-328 |
| 99 | EE | Luca de Alfaro,
Thomas A. Henzinger,
Orna Kupferman:
Concurrent reachability games.
Theor. Comput. Sci. 386(3): 188-217 (2007) |
| 2006 |
|---|
| 98 | EE | Orna Kupferman,
Robby Lampert:
On the Construction of Fine Automata for Safety Properties.
ATVA 2006: 110-124 |
| 97 | EE | Benjamin Aminof,
Orna Kupferman:
On the Succinctness of Nondeterminism.
ATVA 2006: 125-140 |
| 96 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Safraless Compositional Synthesis.
CAV 2006: 31-44 |
| 95 | EE | Orna Kupferman:
Sanity Checks in Formal Verification.
CONCUR 2006: 37-51 |
| 94 | EE | Orna Kupferman,
Sarai Sheinvald-Faragy:
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words.
CONCUR 2006: 492-508 |
| 93 | EE | Orna Kupferman:
Avoiding Determinization.
LICS 2006: 243-254 |
| 92 | EE | Orna Kupferman,
Moshe Y. Vardi:
Memoryful Branching-Time Logic.
LICS 2006: 265-274 |
| 91 | EE | Thomas Ball,
Orna Kupferman:
An Abstraction-Refinement Framework for Multi-Agent Systems.
LICS 2006: 379-388 |
| 90 | EE | Orna Kupferman,
Yoad Lustig,
Moshe Y. Vardi:
On Locally Checkable Properties.
LPAR 2006: 302-316 |
| 89 | EE | Orna Kupferman,
Shmuel Safra,
Moshe Y. Vardi:
Relating word and tree automata.
Ann. Pure Appl. Logic 138(1-3): 126-146 (2006) |
| 88 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage metrics for temporal logic model checking*.
Formal Methods in System Design 28(3): 189-212 (2006) |
| 87 | EE | Ehud Friedgut,
Orna Kupferman,
Moshe Y. Vardi:
Büchi Complementation Made Tighter.
Int. J. Found. Comput. Sci. 17(4): 851-868 (2006) |
| 86 | EE | Orna Kupferman,
Gila Morgenstern,
Aniello Murano:
Typeness for omega-regular Automata.
Int. J. Found. Comput. Sci. 17(4): 869-884 (2006) |
| 85 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage metrics for formal verification.
STTT 8(4-5): 373-386 (2006) |
| 84 | EE | 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) |
| 2005 |
|---|
| 83 | EE | Thomas Ball,
Orna Kupferman,
Greta Yorsh:
Abstraction for Falsification.
CAV 2005: 67-81 |
| 82 | EE | Doron Bustan,
Alon Flaisher,
Orna Grumberg,
Orna Kupferman,
Moshe Y. Vardi:
Regular Vacuity.
CHARME 2005: 191-206 |
| 81 | EE | Arindam Chakrabarti,
Krishnendu Chatterjee,
Thomas A. Henzinger,
Orna Kupferman,
Rupak Majumdar:
Verifying Quantitative Properties Using Bound Functions.
CHARME 2005: 50-64 |
| 80 | EE | Orna Kupferman,
Moshe Y. Vardi:
Safraless Decision Procedures.
FOCS 2005: 531-542 |
| 79 | EE | Orna Kupferman,
Moshe Y. Vardi:
Complementation Constructions for Nondeterministic Automata on Infinite Words.
TACAS 2005: 206-221 |
| 78 | EE | Orna Kupferman,
Moshe Y. Vardi:
From linear time to branching time.
ACM Trans. Comput. Log. 6(2): 273-294 (2005) |
| 77 | EE | Orna Kupferman,
Moshe Y. Vardi:
From complementation to certification.
Theor. Comput. Sci. 345(1): 83-100 (2005) |
| 2004 |
|---|
| 76 | EE | Orna Kupferman,
Gila Morgenstern,
Aniello Murano:
Typeness for omega-Regular Automata.
ATVA 2004: 324-338 |
| 75 | EE | Ehud Friedgut,
Orna Kupferman,
Moshe Y. Vardi:
Büchi Complementation Made Tighter.
ATVA 2004: 64-78 |
| 74 | EE | Benjamin Aminof,
Thomas Ball,
Orna Kupferman:
Reasoning About Systems with Transition Fairness.
LPAR 2004: 194-208 |
| 73 | EE | Doron Bustan,
Orna Kupferman,
Moshe Y. Vardi:
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy.
STACS 2004: 522-533 |
| 72 | EE | Orna Kupferman,
Moshe Y. Vardi:
From Complementation to Certification.
TACAS 2004: 591-606 |
| 71 | EE | Hana Chockler,
Orna Kupferman:
w-Regular languages are testable with a constant number of queries.
Theor. Comput. Sci. 329(1-3): 71-92 (2004) |
| 2003 |
|---|
| 70 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage Metrics for Formal Verification.
CHARME 2003: 111-125 |
| 69 | EE | Sankar Gurumurthy,
Orna Kupferman,
Fabio Somenzi,
Moshe Y. Vardi:
On Complementing Nondeterministic Büchi Automata.
CHARME 2003: 96-110 |
| 68 | EE | Orna Kupferman,
Moshe Y. Vardi:
Pi2 cap Sigma2 equiv AFMC.
ICALP 2003: 697-713 |
| 67 | EE | Thomas A. Henzinger,
Orna Kupferman,
Rupak Majumdar:
On the Universal and Existential Fragments of the µ-Calculus.
TACAS 2003: 49-64 |
| 66 | EE | Roy Armoni,
Doron Bustan,
Orna Kupferman,
Moshe Y. Vardi:
Resets vs. Aborts in Linear Temporal Logic.
TACAS 2003: 65-80 |
| 65 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Fair Equivalence Relations.
Verification: Theory and Practice 2003: 702-732 |
| 64 | EE | Hana Chockler,
Joseph Y. Halpern,
Orna Kupferman:
What Causes a System to Satisfy a Specification?
CoRR cs.LO/0312036: (2003) |
| 63 | EE | Thomas A. Henzinger,
Orna Kupferman,
Shaz Qadeer:
From Pre-Historic to Post-Modern Symbolic Model Checking.
Formal Methods in System Design 23(3): 303-327 (2003) |
| 62 | EE | Orna Kupferman,
David Harel:
Response to "Comments on 'On Object Systems and Behavior Inheritance'".
IEEE Trans. Software Eng. 29(6): 576 (2003) |
| 61 | EE | Orna Kupferman,
Moshe Y. Vardi:
Vacuity detection in temporal model checking.
STTT 4(2): 224-233 (2003) |
| 2002 |
|---|
| 60 | EE | Orna Kupferman,
Ulrike Sattler,
Moshe Y. Vardi:
The Complexity of the Graded µ-Calculus.
CADE 2002: 423-437 |
| 59 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Model Checking Linear Properties of Prefix-Recognizable Systems.
CAV 2002: 371-385 |
| 58 | EE | Marcin Jurdzinski,
Orna Kupferman,
Thomas A. Henzinger:
Trading Probability for Fairness.
CSL 2002: 292-305 |
| 57 | EE | Thomas A. Henzinger,
Sriram C. Krishnan,
Orna Kupferman,
Freddy Y. C. Mang:
Synthesis of Uninitialized Systems.
ICALP 2002: 644-656 |
| 56 | | Hana Chockler,
Orna Kupferman:
Coverage of Implementations by Simulating Specifications.
IFIP TCS 2002: 409-421 |
| 55 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Pushdown Specifications.
LPAR 2002: 262-277 |
| 54 | EE | Orna Kupferman,
Sharon Zuhovitzky:
An Improved Algorithm for the Membership Problem for Extended Regular Expressions.
MFCS 2002: 446-458 |
| 53 | EE | Hana Chockler,
Orna Kupferman:
omega-Regular Languages Are Testable with a Constant Number of Queries.
RANDOM 2002: 26-28 |
| 52 | EE | David Harel,
Orna Kupferman:
On Object Systems and Behavioral Inheritance.
IEEE Trans. Software Eng. 28(9): 889-903 (2002) |
| 51 | EE | Thomas A. Henzinger,
Orna Kupferman,
Sriram K. Rajamani:
Fair Simulation.
Inf. Comput. 173(1): 64-81 (2002) |
| 50 | EE | David Harel,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Verifying Concurrent Transition Systems.
Inf. Comput. 173(2): 143-161 (2002) |
| 49 | EE | Rajeev Alur,
Thomas A. Henzinger,
Orna Kupferman:
Alternating-time temporal logic.
J. ACM 49(5): 672-713 (2002) |
| 2001 |
|---|
| 48 | EE | Hana Chockler,
Orna Kupferman,
Robert P. Kurshan,
Moshe Y. Vardi:
A Practical Approach to Coverage in Model Checking.
CAV 2001: 66-78 |
| 47 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Extended Temporal Logic Revisited.
CONCUR 2001: 519-535 |
| 46 | EE | Valerie King,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Parity Word Automata.
FoSSaCS 2001: 276-286 |
| 45 | | Orna Kupferman,
Moshe Y. Vardi:
Synthesizing Distributed Systems.
LICS 2001 |
| 44 | EE | Orna Kupferman,
Moshe Y. Vardi:
On Bounded Specifications.
LPAR 2001: 24-38 |
| 43 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage Metrics for Temporal Logic Model Checking.
TACAS 2001: 528-542 |
| 42 | EE | Orna Kupferman,
Moshe Y. Vardi:
Weak alternating automata are not that weak.
ACM Trans. Comput. Log. 2(3): 408-429 (2001) |
| 41 | | Orna Kupferman,
Moshe Y. Vardi:
Model Checking of Safety Properties.
Formal Methods in System Design 19(3): 291-314 (2001) |
| 40 | | Orna Kupferman,
Moshe Y. Vardi,
Pierre Wolper:
Module Checking.
Inf. Comput. 164(2): 322-344 (2001) |
| 2000 |
|---|
| 39 | | Orna Kupferman,
Moshe Y. Vardi:
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems.
CAV 2000: 36-52 |
| 38 | EE | Orna Kupferman,
P. Madhusudan,
P. S. Thiagarajan,
Moshe Y. Vardi:
Open Systems in Reactive Environments: Control and Synthesis.
CONCUR 2000: 92-107 |
| 37 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Fair Equivalence Relations.
FSTTCS 2000: 151-163 |
| 36 | EE | Orna Kupferman,
Moshe Y. Vardi:
µ-Calculus Synthesis.
MFCS 2000: 497-507 |
| 35 | EE | David Harel,
Orna Kupferman:
On the Behavioral Inheritance of State-Based Objects.
TOOLS (34) 2000: 83-94 |
| 34 | EE | Orna Kupferman,
Moshe Y. Vardi:
An automata-theortetic approach to modular model checking.
ACM Trans. Program. Lang. Syst. 22(1): 87-128 (2000) |
| 33 | EE | Shoham Shamir,
Orna Kupferman,
Eli Shamir:
Branching-Depth Hierarchies.
Electr. Notes Theor. Comput. Sci. 39(1): (2000) |
| 32 | EE | Orna Kupferman,
Moshe Y. Vardi,
Pierre Wolper:
An automata-theoretic approach to branching-time model checking.
J. ACM 47(2): 312-360 (2000) |
| 1999 |
|---|
| 31 | EE | Orna Kupferman,
Moshe Y. Vardi:
Model Checking of Safety Properties.
CAV 1999: 172-183 |
| 30 | EE | Orna Kupferman,
Moshe Y. Vardi:
Vacuity Detection in Temporal Model Checking.
CHARME 1999: 82-96 |
| 29 | EE | Orna Kupferman,
Moshe Y. Vardi:
Robust Satisfaction.
CONCUR 1999: 383-398 |
| 28 | EE | Orna Kupferman,
Moshe Y. Vardi:
The Weakness of Self-Complementation.
STACS 1999: 455-466 |
| 27 | EE | Orna Kupferman,
Moshe Y. Vardi:
Church's problem revisited.
Bulletin of Symbolic Logic 5(2): 245-263 (1999) |
| 26 | EE | Orna Kupferman:
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions.
J. Log. Comput. 9(2): 135-147 (1999) |
| 1998 |
|---|
| 25 | | Thomas A. Henzinger,
Orna Kupferman,
Shaz Qadeer:
From Pre-historic to Post-modern Symbolic Model Checking.
CAV 1998: 195-206 |
| 24 | EE | Rajeev Alur,
Thomas A. Henzinger,
Orna Kupferman,
Moshe Y. Vardi:
Alternating Refinement Relations.
CONCUR 1998: 163-178 |
| 23 | EE | Luca de Alfaro,
Thomas A. Henzinger,
Orna Kupferman:
Concurrent Reachability Games.
FOCS 1998: 564-575 |
| 22 | | Orna Kupferman,
Moshe Y. Vardi:
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time.
LICS 1998: 81-92 |
| 21 | | Orna Kupferman,
Moshe Y. Vardi:
Relating linear and branching model checking.
PROCOMET 1998: 304-326 |
| 20 | EE | Orna Kupferman,
Moshe Y. Vardi:
Weak Alternating Automata and Tree Automata Emptiness.
STOC 1998: 224-233 |
| 19 | EE | Orna Kupferman,
Moshe Y. Vardi:
Verification of Fair Transition Systems.
Chicago J. Theor. Comput. Sci. 1998: (1998) |
| 1997 |
|---|
| 18 | | Orna Kupferman,
Moshe Y. Vardi:
Model Checking Revisited.
CAV 1997: 36-47 |
| 17 | EE | Rajeev Alur,
Thomas A. Henzinger,
Orna Kupferman:
Alternating-Time Temporal Logic.
COMPOS 1997: 23-60 |
| 16 | EE | Orna Kupferman,
Moshe Y. Vardi:
Modular Model Checking.
COMPOS 1997: 381-401 |
| 15 | | David Harel,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Verifying Concurrent Transition Systems.
CONCUR 1997: 258-272 |
| 14 | | Thomas A. Henzinger,
Orna Kupferman,
Sriram K. Rajamani:
Fair Simulation.
CONCUR 1997: 273-287 |
| 13 | | Orna Kupferman,
Robert P. Kurshan,
Mihalis Yannakakis:
Existence of Reduction Hierarchies.
CSL 1997: 327-340 |
| 12 | EE | Rajeev Alur,
Thomas A. Henzinger,
Orna Kupferman:
Alternating-time Temporal Logic.
FOCS 1997: 100-109 |
| 11 | | Thomas A. Henzinger,
Orna Kupferman:
From Quantity to Quality.
HART 1997: 48-62 |
| 10 | EE | Orna Kupferman,
Moshe Y. Vardi:
Weak Alternating Automata Are Not That Weak.
ISTCS 1997: 147-158 |
| 1996 |
|---|
| 9 | | Orna Kupferman,
Moshe Y. Vardi:
Verification of Fair Transisiton Systems.
CAV 1996: 372-382 |
| 8 | | Orna Kupferman,
Moshe Y. Vardi:
Module Checking.
CAV 1996: 75-86 |
| 7 | | Thomas A. Henzinger,
Orna Kupferman,
Moshe Y. Vardi:
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking.
CONCUR 1996: 514-529 |
| 6 | | Orna Kupferman,
Shmuel Safra,
Moshe Y. Vardi:
Relating Word and Tree Automata.
LICS 1996: 322-332 |
| 5 | | Orna Kupferman,
Orna Grumberg:
Branching-Time Temporal Logic and Tree Automata.
Inf. Comput. 125(1): 62-69 (1996) |
| 4 | | Orna Kupferman,
Orna Grumberg:
Buy One, Get One Free!!!
J. Log. Comput. 6(4): 523-539 (1996) |
| 1995 |
|---|
| 3 | | Orna Kupferman:
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions.
CAV 1995: 325-338 |
| 2 | | Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Branching Modular Model Checking (Extended Abstract).
CONCUR 1995: 408-422 |
| 1 | | Orna Kupferman,
Amir Pnueli:
Once and For All
LICS 1995: 25-35 |
