- Module Checking Revisited Orna Kupferman1 and Moshe Y. Vardi2
- Leaping Loops in the Presence of Abstraction Thomas Ball1
- Verifying Quantitative Properties Using Bound Functions
- Safraless Decision Procedures Orna Kupferman
- Model Checking of Safety Properties Orna Kupferman
- The Weakness of Self-Complementation Orna Kupferman
- Complementation Constructions for Nondeterministic Automata on Infinite Words
- Sanity Checks in Formal Verification Orna Kupferman
- Memoryfull Branching-Time Logic Orna Kupferman1
- Reasoning about Online Algorithms with Weighted Automata Benjamin Aminof, Orna Kupferman, Robby Lampert
- Variable Automata over Infinite Alphabets Orna Grumberga
- Temporal Synthesis for Bounded Systems and Environments
- A Framework for Inherent Vacuity Dana Fisman1,2
- On the Relative Succinctness of Nondeterministic Buchi and co-Buchi Word Automata
- Abstraction for Falsification Thomas Ball1
- Weak Alternating Automata Are Not That Weak Orna Kupferman
- A Measured Collapse of The Modal Alternation Hierarchy
- Trading Probability for Fairness (Extended abstract)
- Relating Word and Tree Automata Orna Kupferman 1
- Better Under-approximation of Programs by Hiding Variables
- Model Checking Linear Properties of Prefix-Recognizable Systems Orna Kupferman
- An Abstraction-Refinement Framework for Multi-Agent Systems Thomas Ball
- An Abstraction-Refinement Framework for Trigger Querying
- Rigorous Approximated Determinization of Weighted Automata
- Minimizing Deterministic Lattice Automata Shulamit Halamish and Orna Kupferman
- Co-Buching Them All U. Boker and O. Kupferman
- Parityizing Rabin and Streett , Orna Kupferman1
- The Blow-Up in Translating LTL to Deterministic Automata
- Improved Model Checking of Hierarchical Systems$ Benjamin Aminofa,1
- Reasoning about Finite-State Switched Systems Dana Fisman1,2
- Co-ing Buchi Made Tight and Useful Udi Boker and Orna Kupferman
- Lower Bounds on Witnesses for Nonemptiness of Universal co-Buchi Automata
- Vacuity in Testing Thomas Ball1
- On Verifying Fault Tolerance of Distributed Protocols Dana Fisman1,2
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Tightening the Exchange Rates Between Automata
- From Liveness to Promptness Orna Kupferman
- On Locally Checkable Properties Orna Kupferman1
- On the Construction of Fine Automata for Safety Properties
- On the Succinctness of Nondeterminism Benjamin Aminof and Orna Kupferman
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Coverage Metrics for Formal Verification Hana Chockler
- Resets vs. Aborts in Linear Temporal Logic Roy Armoni1
- Pushdown Specifications Orna Kupferman
- -regular Languages are Testable with a Constant Number of Queries
- An Improved Algorithm for the Membership Problem for Extended Regular Expressions
- Coverage Metrics for Temporal Logic Model Checking Hana Chockler
- -calculus Synthesis Orna Kupferman
- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
- From Pre-historic to Post-modern Symbolic Model Checking
- acmj032-03 ACM-TRANSACTION February 23, 2005 2:59 From Linear Time to Branching Time
- Synthesis with Incomplete Informatio Orna Kupferman
- Promptness in -regular Automata Shaull Almagor1
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- A Practical Approach to Coverage in Model Checking Hana Chockler
- On Complementing Nondeterministic Buchi Automata Sankar Gurumurthy
- Weak Alternating Automata and Tree Automata Emptiness Orna Kupferman
- Concurrent Reachability Games Luca de Alfaro Thomas A. Henzinger Orna Kupferman
- Temporal Specifications with Accumulative Values
- What Triggers a Behavior? Orna Kupferman and Yoad Lustig
- Lattice Automata Orna Kupferman and Yoad Lustig
- Avoiding Determinization Orna Kupferman
- Rational Synthesis Dana Fisman1
- Extended Temporal Logic Revisited Orna Kupferman
- Fair Equivalence Relations Orna Kupferman
- Reasoning about Systems with Transition Fairness Benjamin Aminof1
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
- A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance
- Synthesis of Trigger Properties Orna Kupferman Moshe Vardi
- Orna Kupferman and Moshe Y. Vardi! Hebrew University, School of Engineering and Computer Science, Jerusalem 91904, Israel Email: orna@cs.huji.ac.il, URL: http://www.cs.huji.ac.il/" orna# Rice University, Department of Computer Science, Houston, TX 77251-1
- Alternation Removal in Buchi Automata Udi Boker, Orna Kupferman and Adin Rosenberg
- The Complexity of the Graded Orna Kupferman , Ulrike Sattler , Moshe Y. Vardi
- Coping with Selfish On-going Behaviors Orna Kupferman
- Robust Satisfaction Orna Kupferman
- Alternating Refinement Relations Rajeev Alur1
- Safraless Compositional Synthesis Orna Kupferman1
- Regular Vacuity Doron Bustan2
- From Complementation to Certification Orna Kupferman
- What's Decidable About Weighted Automata? Shaull Almagor1
- Max and Sum Semantics for Alternating Weighted Automata
- Formal Analysis of Online Algorithms Benjamin Aminof1, Orna Kupferman1, and Robby Lampert2
- Recent Challenges and Ideas in Temporal Synthesis Orna Kupferman
