Orna Kupferman

311 papers A* 40A 17B 91C 4Misc 1Journal 94Unranked 59

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Coverage Games. CoRR Orna Kupferman, Noam Shenwald
2026	B	`conf`	Memory Requirements in Non-Zero-Sum Games. CSL Yoav Feinstein, Orna Kupferman
2025	J	`jnl`	A Hierarchy of Nondeterminism. Log. Methods Comput. Sci. Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
2025	B	`conf`	Coverage Games. CONCUR Orna Kupferman, Noam Shenwald
2025	B	`conf`	Energy Games with Weight Uncertainty. ATVA Orna Kupferman, Naama Shamash Halevy
2025	J	`jnl`	Monotonicity characterizations of regular languages. Inf. Comput. Yoav Feinstein, Orna Kupferman
2025	—	`conf`	Non-Zero-Sum Games with Multiple Weighted Objectives. TACAS (2) Yoav Feinstein, Orna Kupferman, Noam Shenwald
2025	B	`conf`	Positional-Player Games. MFCS Orna Kupferman, Noam Shenwald
2025	—	`conf`	Synthesis with Guided Environments. TACAS (2) Orna Kupferman, Ofer Leshkowitz
2025	J	`jnl`	Synthesis with Guided Environments. CoRR Orna Kupferman, Ofer Leshkowitz
2025	J	`jnl`	Synthesis with Privacy Against an Observer. Log. Methods Comput. Sci. Orna Kupferman, Ofer Leshkowitz, Namma Shamash Halevy
2025	J	`jnl`	Variable automata over infinite alphabets. Formal Methods Syst. Des. Orna Grumberg, Orna Kupferman, Sarai Sheinvald
2024	A	`ed.`	41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, March 12-14, 2024 STACS Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
2024	B	`conf`	Easy Complementation of History-Deterministic Büchi Automata. ATVA Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
2024	B	`conf`	Games with Weighted Multiple Objectives. ATVA Orna Kupferman, Noam Shenwald
2024	J	`jnl`	Perspective Games. ACM Trans. Comput. Log. Orna Kupferman, Gal Vardi
2024	B	`conf`	Playing Games on Automata. ATVA Orna Kupferman
2024	—	`conf`	Restricted Flow Games. Taming the Infinities of Concurrency Ravid Alon, Orna Kupferman
2024	—	`conf`	Synthesis with Privacy Against an Observer. FoSSaCS (1) Orna Kupferman, Ofer Leshkowitz, Naama Shamash Halevy
2024	J	`jnl`	Synthesis with Privacy Against an Observer. CoRR Orna Kupferman, Ofer Leshkowitz, Naama Shamash Halevy
2024	J	`jnl`	The Complexity of LTL Rational Synthesis. ACM Trans. Comput. Log. Orna Kupferman, Noam Shenwald
2023	B	`ed.`	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 FoSSaCS Orna Kupferman, Pawel Sobocinski
2023	B	`conf`	Games with Trading of Control. CONCUR Orna Kupferman, Noam Shenwald
2023	J	`jnl`	Lazy regular sensing. Theor. Comput. Sci. Orna Kupferman, Asaf Petruschka
2023	—	`conf`	Monotonicity Characterizations of Regular Languages. FSTTCS Yoav Feinstein, Orna Kupferman
2023	J	`jnl`	Mutually Accepting Capacitated Automata. J. Autom. Lang. Comb. Ravid Alon, Orna Kupferman
2023	A*	`conf`	On Semantically-Deterministic Automata. ICALP Bader Abu Radi, Orna Kupferman
2023	J	`jnl`	On Semantically-Deterministic Automata. CoRR Bader Abu Radi, Orna Kupferman
2023	J	`jnl`	Reasoning about Quality and Fuzziness of Strategic Behaviors. ACM Trans. Comput. Log. Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
2023	J	`jnl`	Timed network games. Inf. Comput. Guy Avni, Shibashis Guha, Orna Kupferman
2022	J	`jnl`	A Hierarchy of Nondeterminism. CoRR Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
2022	B	`conf`	CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi
2022	J	`jnl`	Certifying DFA Bounds for Recognition and Separation. Innov. Syst. Softw. Eng. Orna Kupferman, Nir Lavee, Salomon Sickert
2022	B	`conf`	Energy Games with Resource-Bounded Environments. CONCUR Orna Kupferman, Naama Shamash Halevy
2022	J	`jnl`	Interviews with the 2022 CONCUR Test-of-Time Award Recipients. Bull. EATCS Luca Aceto, Orna Kupferman, Mickael Randour, Davide Sangiorgi
2022	—	`conf`	Lazy Regular Sensing. DCFS Orna Kupferman, Asaf Petruschka
2022	J	`jnl`	Minimization and Canonization of GFG Transition-Based Automata. Log. Methods Comput. Sci. Bader Abu Radi, Orna Kupferman
2022	B	`conf`	Minimization of Automata for Liveness Languages. ATVA Bader Abu Radi, Orna Kupferman
2022	J	`jnl`	Multi-Valued Reasoning about Reactive Systems. Found. Trends Theor. Comput. Sci. Orna Kupferman
2022	—	`conf`	Synthesis of Privacy-Preserving Systems. FSTTCS Orna Kupferman, Ofer Leshkowitz
2022	—	`conf`	The Complexity of LTL Rational Synthesis. TACAS (1) Orna Kupferman, Noam Shenwald
2022	J	`jnl`	Using the past for resolving the future. Frontiers Comput. Sci. Orna Kupferman
2022	J	`jnl`	What's decidable about weighted automata? Inf. Comput. Shaull Almagor, Udi Boker, Orna Kupferman
2021	B	`conf`	A Hierarchy of Nondeterminism. MFCS Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz
2021	B	`conf`	Certifying DFA Bounds for Recognition and Separation. ATVA Orna Kupferman, Nir Lavee, Salomon Sickert
2021	J	`jnl`	Certifying DFA Bounds for Recognition and Separation. CoRR Orna Kupferman, Nir Lavee, Salomon Sickert
2021	B	`conf`	Certifying Inexpressibility. FoSSaCS Orna Kupferman, Salomon Sickert
2021	J	`jnl`	Certifying Inexpressibility. CoRR Orna Kupferman, Salomon Sickert
2021	J	`jnl`	Good-Enough Synthesis. CoRR Shaull Almagor, Orna Kupferman
2021	J	`jnl`	Minimization and Canonization of GFG Transition-Based Automata. CoRR Bader Abu Radi, Orna Kupferman
2021	A*	`conf`	Perspective Multi-Player Games. LICS Orna Kupferman, Noam Shenwald
2021	—	`ch.`	Verification. Handbook of Automata Theory (II.) Javier Esparza, Orna Kupferman, Moshe Y. Vardi
2020	—	`conf`	Canonicity in GFG and Transition-Based Automata. GandALF Bader Abu Radi, Orna Kupferman
2020	B	`conf`	Coverage and Vacuity in Network Formation Games. CSL Gili Bielous, Orna Kupferman
2020	J	`jnl`	Dynamic resource allocation games. Theor. Comput. Sci. Guy Avni, Thomas A. Henzinger, Orna Kupferman
2020	B	`conf`	From Correctness to High Quality. FMCAD Orna Kupferman
2020	—	`conf`	Games with Full, Longitudinal, and Transverse Observability. RP Orna Kupferman
2020	—	`conf`	Good-Enough Synthesis. CAV (2) Shaull Almagor, Orna Kupferman
2020	—	`conf`	Mutually Accepting Capacitated Automata. DCFS Ravid Alon, Orna Kupferman
2020	B	`conf`	On (I/O)-Aware Good-For-Games Automata. ATVA Rachel Faran, Orna Kupferman
2020	B	`conf`	On Repetition Languages. MFCS Orna Kupferman, Ofer Leshkowitz
2020	B	`conf`	On Synthesis of Specifications with Arithmetic. SOFSEM Rachel Faran, Orna Kupferman
2020	—	`conf`	Perspective Games with Notifications. FSTTCS Orna Kupferman, Noam Shenwald
2020	A	`conf`	Reasoning About Quality and Fuzziness of Strategic Behaviours. ECAI Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
2020	B	`conf`	Unary Prime Languages. MFCS Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi
2019	J	`jnl`	A Parametrized Analysis of Algorithms on Hierarchical Graphs. Int. J. Found. Comput. Sci. Rachel Faran, Orna Kupferman
2019	J	`jnl`	Capacitated automata and systems. Inf. Comput. Orna Kupferman, Sarai Sheinvald
2019	J	`jnl`	Flow Logic. Log. Methods Comput. Sci. Orna Kupferman, Gal Vardi
2019	A*	`conf`	Minimizing GFG Transition-Based Automata. ICALP Bader Abu Radi, Orna Kupferman
2019	J	`jnl`	Multi-player flow games. Auton. Agents Multi Agent Syst. Shibashis Guha, Orna Kupferman, Gal Vardi
2019	A*	`conf`	Perspective Games. LICS Orna Kupferman, Gal Vardi
2019	A*	`conf`	Reasoning about Quality and Fuzziness of Strategic Behaviours. IJCAI Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
2019	J	`jnl`	Reasoning about Quality and Fuzziness of Strategic Behaviours. CoRR Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
2019	B	`conf`	Register-Bounded Synthesis. CONCUR Ayrat Khalimov, Orna Kupferman
2019	J	`jnl`	Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. Shaull Almagor, Denis Kuperberg, Orna Kupferman
2018	B	`conf`	Alternating Reachability Games with Behavioral and Revenue Objectives. LPAR Orna Kupferman, Tami Tamir
2018	J	`jnl`	An Abstraction-Refinement Methodologyfor Reasoning about Network Games Games Guy Avni, Shibashis Guha, Orna Kupferman
2018	—	`ch.`	Automata Theory and Model Checking. Handbook of Model Checking Orna Kupferman
2018	J	`jnl`	Flow Logic. CoRR Orna Kupferman, Gal Vardi
2018	B	`conf`	LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems. LPAR Rachel Faran, Orna Kupferman
2018	A	`conf`	Multi-Player Flow Games. AAMAS Shibashis Guha, Orna Kupferman, Gal Vardi
2018	J	`jnl`	On relative and probabilistic finite counterability. Formal Methods Syst. Des. Orna Kupferman, Gal Vardi
2018	B	`conf`	Playing with the Maximum-Flow Problem. LPAR Orna Kupferman
2018	J	`jnl`	Spanning the spectrum from safety to liveness. Acta Informatica Rachel Faran, Orna Kupferman
2018	B	`conf`	Spanning-Tree Games. MFCS Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi
2018	J	`jnl`	Synthesis from component libraries with costs. Theor. Comput. Sci. Guy Avni, Orna Kupferman
2018	A*	`conf`	Synthesis of Controllable Nash Equilibria in Quantitative Objective Game. IJCAI Shaull Almagor, Orna Kupferman, Giuseppe Perelli
2018	A*	`conf`	The Unfortunate-Flow Problem. ICALP Orna Kupferman, Gal Vardi
2018	B	`conf`	Timed Network Games with Clocks. MFCS Guy Avni, Shibashis Guha, Orna Kupferman
2018	J	`jnl`	Timed Network Games with Clocks. CoRR Guy Avni, Shibashis Guha, Orna Kupferman
2018	B	`conf`	Timed Vacuity. FM Hana Chockler, Shibashis Guha, Orna Kupferman
2017	—	`conf`	A Parametrized Analysis of Algorithms on Hierarchical Graphs. DCFS Rachel Faran, Orna Kupferman
2017	A*	`conf`	An Abstraction-Refinement Methodology for Reasoning about Network Games. IJCAI Guy Avni, Shibashis Guha, Orna Kupferman
2017	A*	`conf`	Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk). STOC Orna Kupferman
2017	—	`conf`	Flow Games. FSTTCS Orna Kupferman, Gal Vardi, Moshe Y. Vardi
2017	B	`conf`	Flow Logic. CONCUR Orna Kupferman, Gal Vardi
2017	—	`conf`	Hierarchical Network Formation Games. TACAS (1) Orna Kupferman, Tami Tamir
2017	J	`jnl`	How Deterministic are Good-For-Games Automata? CoRR Udi Boker, Orna Kupferman, Michal Skrzypczak
2017	—	`conf`	How Deterministic are Good-For-Games Automata?. FSTTCS Udi Boker, Orna Kupferman, Michal Skrzypczak
2017	J	`jnl`	Latticed-LTL synthesis in the presence of noisy inputs. Discret. Event Dyn. Syst. Shaull Almagor, Orna Kupferman
2017	—	`conf`	Quantitative Assume Guarantee Synthesis. CAV (2) Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, Yaron Velner
2017	—	`conf`	Sensing as a Complexity Measure. DCFS Shaull Almagor, Denis Kuperberg, Orna Kupferman
2017	B	`conf`	Timed Network Games. MFCS Guy Avni, Shibashis Guha, Orna Kupferman
2016	B	`conf`	Dynamic Resource Allocation Games. SAGT Guy Avni, Thomas A. Henzinger, Orna Kupferman
2016	B	`conf`	Eulerian Paths with Regular Constraints. MFCS Orna Kupferman, Gal Vardi
2016	J	`jnl`	Formally Reasoning About Quality. J. ACM Shaull Almagor, Udi Boker, Orna Kupferman
2016	B	`conf`	High-Quality Synthesis Against Stochastic Environments. CSL Shaull Almagor, Orna Kupferman
2016	J	`jnl`	High-Quality Synthesis Against Stochastic Environments. CoRR Shaull Almagor, Orna Kupferman
2016	B	`conf`	Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CONCUR Shaull Almagor, Orna Kupferman, Yaron Velner
2016	J	`jnl`	Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CoRR Shaull Almagor, Orna Kupferman, Yaron Velner
2016	J	`jnl`	Network-formation games with regular objectives. Inf. Comput. Guy Avni, Orna Kupferman, Tami Tamir
2016	Misc	`conf`	On High-Quality Synthesis. CSR Orna Kupferman
2016	C	`conf`	On the Capacity of Capacitated Automata. LATA Orna Kupferman, Sarai Sheinvald
2016	J	`jnl`	Synthesis with rational environments. Ann. Math. Artif. Intell. Orna Kupferman, Giuseppe Perelli, Moshe Y. Vardi
2015	—	`conf`	Congestion Games with Multisets of Resources and Applications in Synthesis. FSTTCS Guy Avni, Orna Kupferman, Tami Tamir
2015	—	`conf`	Inherent Vacuity in Lattice Automata. Fields of Logic and Computation II Hila Gonen, Orna Kupferman
2015	J	`jnl`	Minimizing Deterministic Lattice Automata. ACM Trans. Comput. Log. Shulamit Halamish, Orna Kupferman
2015	B	`conf`	On Relative and Probabilistic Finite Counterability. CSL Orna Kupferman, Gal Vardi
2015	J	`jnl`	Prime languages. Inf. Comput. Orna Kupferman, Jonathan Mosheiff
2015	J	`jnl`	Profile trees for Büchi word automata, with application to determinization. Inf. Comput. Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
2015	B	`conf`	Repairing Multi-Player Games. CONCUR Shaull Almagor, Guy Avni, Orna Kupferman
2015	B	`conf`	Spanning the Spectrum from Safety to Liveness. ATVA Rachel Faran, Orna Kupferman
2015	—	`conf`	Stochastization of Weighted Automata. MFCS (1) Guy Avni, Orna Kupferman
2015	—	`conf`	The Sensing Cost of Monitoring and Synthesis. FSTTCS Shaull Almagor, Denis Kuperberg, Orna Kupferman
2014	B	`conf`	A Game-Theoretic Approach to Simulation of Data-Parameterized Systems. ATVA Orna Grumberg, Orna Kupferman, Sarai Sheinvald
2014	J	`jnl`	An abstraction-refinement framework for trigger querying. Formal Methods Syst. Des. Guy Avni, Orna Kupferman
2014	A	`conf`	Discounting in LTL. TACAS Shaull Almagor, Udi Boker, Orna Kupferman
2014	J	`jnl`	Discounting in LTL. CoRR Shaull Almagor, Udi Boker, Orna Kupferman
2014	A	`conf`	From Reachability to Temporal Specifications in Cost-Sharing Games. IJCAR Guy Avni, Orna Kupferman, Tami Tamir
2014	B	`conf`	Latticed-LTL Synthesis in the Presence of Noisy Inputs. FoSSaCS Shaull Almagor, Orna Kupferman
2014	B	`conf`	Network-Formation Games with Regular Objectives. FoSSaCS Guy Avni, Orna Kupferman, Tami Tamir
2014	J	`jnl`	Parameterized Weighted Containment. ACM Trans. Comput. Log. Guy Avni, Orna Kupferman
2014	—	`conf`	Properties and Utilization of Capacitated Automata (Invited Talk). FSTTCS Orna Kupferman, Tami Tamir
2014	—	`conf`	Regular Sensing. FSTTCS Shaull Almagor, Denis Kuperberg, Orna Kupferman
2014	B	`conf`	Synthesis from Component Libraries with Costs. CONCUR Guy Avni, Orna Kupferman
2014	C	`conf`	Synthesis with Rational Environments. EUMAS Orna Kupferman, Giuseppe Perelli, Moshe Y. Vardi
2014	J	`jnl`	Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
2014	A	`conf`	Variations on Safety. TACAS Orna Kupferman
2013	B	`conf`	A Framework for Ranking Vacuity Results. ATVA Shoham Ben-David, Orna Kupferman
2013	B	`conf`	An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications. ATVA Orna Grumberg, Orna Kupferman, Sarai Sheinvald
2013	—	`conf`	Attention-Based Coverage Metrics. Haifa Verification Conference Shoham Ben-David, Hana Chockler, Orna Kupferman
2013	A*	`conf`	Automatic Generation of Quality Specifications. CAV Shaull Almagor, Guy Avni, Orna Kupferman
2013	—	`conf`	Formalizing and Reasoning about Quality. ICALP (2) Shaull Almagor, Udi Boker, Orna Kupferman
2013	—	`conf`	Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak
2013	B	`conf`	Parameterized Weighted Containment. FoSSaCS Guy Avni, Orna Kupferman
2013	B	`conf`	Prime Languages. MFCS Orna Kupferman, Jonathan Mosheiff
2013	—	`conf`	Profile Trees for Büchi Word Automata, with Application to Determinization. GandALF Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
2013	J	`jnl`	Rigorous approximated determinization of weighted automata. Theor. Comput. Sci. Benjamin Aminof, Orna Kupferman, Robby Lampert
2013	J	`jnl`	Unifying Büchi Complementation Constructions Log. Methods Comput. Sci. Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi
2013	B	`conf`	Weighted Safety. ATVA Sigal Weiner, Matan Hasson, Orna Kupferman, Eyal Pery, Zohar Shevach
2013	J	`jnl`	When does abstraction help? Inf. Process. Lett. Guy Avni, Orna Kupferman
2012	B	`conf`	Approximating Deterministic Lattice Automata. ATVA Shulamit Halamish, Orna Kupferman
2012	J	`jnl`	Coping with selfish on-going behaviors. Inf. Comput. Orna Kupferman, Tami Tamir
2012	—	`conf`	Environment-Friendly Safety. Haifa Verification Conference Orna Kupferman, Sigal Weiner
2012	J	`jnl`	Improved model checking of hierarchical systems. Inf. Comput. Benjamin Aminof, Orna Kupferman, Aniello Murano
2012	B	`conf`	Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. CONCUR Guy Avni, Orna Kupferman
2012	B	`conf`	Model Checking Systems and Specifications with Parameterized Atomic Propositions. ATVA Orna Grumberg, Orna Kupferman, Sarai Sheinvald
2012	J	`jnl`	Once and for all. J. Comput. Syst. Sci. Orna Kupferman, Amir Pnueli, Moshe Y. Vardi
2012	B	`conf`	Recent Challenges and Ideas in Temporal Synthesis. SOFSEM Orna Kupferman
2012	J	`jnl`	Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. Udi Boker, Orna Kupferman
2011	B	`conf`	An Abstraction-Refinement Framework for Trigger Querying. SAS Guy Avni, Orna Kupferman
2011	B	`conf`	Co-Büching Them All. FoSSaCS Udi Boker, Orna Kupferman
2011	B	`conf`	Formal Analysis of Online Algorithms. ATVA Benjamin Aminof, Orna Kupferman, Robby Lampert
2011	B	`conf`	Max and Sum Semantics for Alternating Weighted Automata. ATVA Shaull Almagor, Orna Kupferman
2011	B	`conf`	Minimizing Deterministic Lattice Automata. FoSSaCS Shulamit Halamish, Orna Kupferman
2011	A*	`conf`	Rigorous Approximated Determinization of Weighted Automata. LICS Benjamin Aminof, Orna Kupferman, Robby Lampert
2011	—	`conf`	Synthesis with Clairvoyance. Haifa Verification Conference Orna Kupferman, Dorsa Sadigh, Sanjit A. Seshia
2011	A*	`conf`	Temporal Specifications with Accumulative Values. LICS Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
2011	A	`conf`	Temporal Synthesis for Bounded Systems and Environments. STACS Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis
2011	B	`conf`	Unifying Büchi Complementation Constructions. CSL Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke
2011	B	`conf`	What's Decidable about Weighted Automata? ATVA Shaull Almagor, Udi Boker, Orna Kupferman
2010	—	`conf`	Alternation Removal in Büchi Automata. ICALP (2) Udi Boker, Orna Kupferman, Adin Rosenberg
2010	—	`conf`	An Automata-Theoretic Approach to Infinite-State Systems. Essays in Memory of Amir Pnueli Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2010	—	`conf`	Coping with Selfish On-Going Behaviors. LPAR (Dakar) Orna Kupferman, Tami Tamir
2010	J	`jnl`	Erratum for "What causes a system to satisfy a specification?". ACM Trans. Comput. Log. Hana Chockler, Joseph Y. Halpern, Orna Kupferman
2010	B	`conf`	Improved Model Checking of Hierarchical Systems. VMCAI Benjamin Aminof, Orna Kupferman, Aniello Murano
2010	J	`jnl`	Latticed Simulation Relations and Games. Int. J. Found. Comput. Sci. Orna Kupferman, Yoad Lustig
2010	—	`ch.`	Multi-Valued Automata and Their Applications. Logics and Languages for Reliability and Security Orna Kupferman
2010	—	`conf`	Parityizing Rabin and Streett. FSTTCS Udi Boker, Orna Kupferman, Avital Steinitz
2010	B	`conf`	Promptness in ATVA Shaull Almagor, Yoram Hirshfeld, Orna Kupferman
2010	A	`conf`	Rational Synthesis. TACAS Dana Fisman, Orna Kupferman, Yoad Lustig
2010	J	`jnl`	Reasoning about online algorithms with weighted automata. ACM Trans. Algorithms Benjamin Aminof, Orna Kupferman, Robby Lampert
2010	—	`conf`	Synthesis of Trigger Properties. LPAR (Dakar) Orna Kupferman, Moshe Y. Vardi
2010	—	`conf`	The Blowup in Translating LTL to Deterministic Automata. MoChArt Orna Kupferman, Adin Rosenberg
2010	—	`conf`	The Quest for a Tight Translation of Büchi to co-Büchi Automata. Fields of Logic and Computation Udi Boker, Orna Kupferman
2010	C	`conf`	Variable Automata over Infinite Alphabets. LATA Orna Grumberg, Orna Kupferman, Sarai Sheinvald
2009	—	`conf`	09501 Abstracts Collection - Software Synthesis. Software Synthesis Rastislav Bodík, Orna Kupferman, Douglas R. Smith, Eran Yahav
2009	A*	`conf`	Co-ing Büchi Made Tight and Useful. LICS Udi Boker, Orna Kupferman
2009	J	`jnl`	From liveness to promptness. Formal Methods Syst. Des. Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2009	B	`conf`	Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. FoSSaCS Orna Kupferman, Nir Piterman
2009	J	`jnl`	Rational Synthesis CoRR Dana Fisman, Orna Kupferman, Yoad Lustig
2009	—	`conf`	Reasoning about Finite-State Switched Systems. Haifa Verification Conference Dana Fisman, Orna Kupferman
2009	A*	`conf`	Reasoning about online algorithms with weighted automata. SODA Benjamin Aminof, Orna Kupferman, Robby Lampert
2009	—	`ed.`	Software Synthesis, 06.12. - 11.12.2009 Software Synthesis Rastislav Bodík, Orna Kupferman, Douglas R. Smith, Eran Yahav
2008	—	`conf`	A Framework for Inherent Vacuity. Haifa Verification Conference Dana Fisman, Orna Kupferman, Sarai Sheinvald-Faragy, Moshe Y. Vardi
2008	B	`conf`	A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance. FMCAD Orna Kupferman, Wenchao Li, Sanjit A. Seshia
2008	B	`conf`	Multi-valued Logics, Automata, Simulations, and Games. VMCAI Orna Kupferman, Yoad Lustig
2008	A	`conf`	On Verifying Fault Tolerance of Distributed Protocols. TACAS Dana Fisman, Orna Kupferman, Yoad Lustig
2008	B	`conf`	On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. LPAR Benjamin Aminof, Orna Kupferman, Omer Lev
2008	C	`conf`	Vacuity in Testing. TAP Thomas Ball, Orna Kupferman
2008	J	`jnl`	What causes a system to satisfy a specification?. ACM Trans. Comput. Log. Hana Chockler, Joseph Y. Halpern, Orna Kupferman
2007	B	`conf`	Better Under-Approximation of Programs by Hiding Variables. VMCAI Thomas Ball, Orna Kupferman
2007	J	`jnl`	Concurrent reachability games. Theor. Comput. Sci. Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman
2007	J	`jnl`	Exponential Gaps in our Knowledge. Bull. EATCS Orna Kupferman
2007	A*	`conf`	From Liveness to Promptness. CAV Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2007	B	`conf`	Lattice Automata. VMCAI Orna Kupferman, Yoad Lustig
2007	B	`conf`	Latticed Simulation Relations and Games. ATVA Orna Kupferman, Yoad Lustig
2007	A*	`conf`	Leaping Loops in the Presence of Abstraction. CAV Thomas Ball, Orna Kupferman, Mooly Sagiv
2007	B	`conf`	Tightening the Exchange Rates Between Automata. CSL Orna Kupferman
2007	B	`conf`	What Triggers a Behavior? FMCAD Orna Kupferman, Yoad Lustig
2006	A*	`conf`	An Abstraction-Refinement Framework for Multi-Agent Systems. LICS Thomas Ball, Orna Kupferman
2006	A*	`conf`	Avoiding Determinization. LICS Orna Kupferman
2006	J	`jnl`	Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
2006	J	`jnl`	Coverage metrics for formal verification. Int. J. Softw. Tools Technol. Transf. Hana Chockler, Orna Kupferman, Moshe Y. Vardi
2006	J	`jnl`	Coverage metrics for temporal logic model checking Formal Methods Syst. Des. Hana Chockler, Orna Kupferman, Moshe Y. Vardi
2006	B	`conf`	Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words. CONCUR Orna Kupferman, Sarai Sheinvald-Faragy
2006	A*	`conf`	Memoryful Branching-Time Logic. LICS Orna Kupferman, Moshe Y. Vardi
2006	B	`conf`	On Locally Checkable Properties. LPAR Orna Kupferman, Yoad Lustig, Moshe Y. Vardi
2006	B	`conf`	On the Construction of Fine Automata for Safety Properties. ATVA Orna Kupferman, Robby Lampert
2006	B	`conf`	On the Succinctness of Nondeterminism. ATVA Benjamin Aminof, Orna Kupferman
2006	J	`jnl`	On the universal and existential fragments of the Theor. Comput. Sci. Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
2006	J	`jnl`	Relating word and tree automata. Ann. Pure Appl. Log. Orna Kupferman, Shmuel Safra, Moshe Y. Vardi
2006	A*	`conf`	Safraless Compositional Synthesis. CAV Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2006	B	`conf`	Sanity Checks in Formal Verification. CONCUR Orna Kupferman
2006	J	`jnl`	Typeness for omega-regular Automata. Int. J. Found. Comput. Sci. Orna Kupferman, Gila Morgenstern, Aniello Murano
2005	A*	`conf`	Abstraction for Falsification. CAV Thomas Ball, Orna Kupferman, Greta Yorsh
2005	A	`conf`	Complementation Constructions for Nondeterministic Automata on Infinite Words. TACAS Orna Kupferman, Moshe Y. Vardi
2005	J	`jnl`	From complementation to certification. Theor. Comput. Sci. Orna Kupferman, Moshe Y. Vardi
2005	J	`jnl`	From linear time to branching time. ACM Trans. Comput. Log. Orna Kupferman, Moshe Y. Vardi
2005	—	`conf`	Regular Vacuity. CHARME Doron Bustan, Alon Flaisher, Orna Grumberg, Orna Kupferman, Moshe Y. Vardi
2005	A*	`conf`	Safraless Decision Procedures. FOCS Orna Kupferman, Moshe Y. Vardi
2005	—	`conf`	Verifying Quantitative Properties Using Bound Functions. CHARME Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
2004	A	`conf`	A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy. STACS Doron Bustan, Orna Kupferman, Moshe Y. Vardi
2004	B	`conf`	Büchi Complementation Made Tighter. ATVA Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
2004	A	`conf`	From Complementation to Certification. TACAS Orna Kupferman, Moshe Y. Vardi
2004	B	`conf`	Reasoning About Systems with Transition Fairness. LPAR Benjamin Aminof, Thomas Ball, Orna Kupferman
2004	B	`conf`	Typeness for omega-Regular Automata. ATVA Orna Kupferman, Gila Morgenstern, Aniello Murano
2004	J	`jnl`	w-Regular languages are testable with a constant number of queries. Theor. Comput. Sci. Hana Chockler, Orna Kupferman
2003	—	`conf`	Coverage Metrics for Formal Verification. CHARME Hana Chockler, Orna Kupferman, Moshe Y. Vardi
2003	—	`conf`	Fair Equivalence Relations. Verification: Theory and Practice Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2003	—	`conf`	Formal Analysis of Scientific-Computation Methods. ADHS Gadiel Auerbach, Orna Kupferman
2003	J	`jnl`	From Pre-Historic to Post-Modern Symbolic Model Checking. Formal Methods Syst. Des. Thomas A. Henzinger, Orna Kupferman, Shaz Qadeer
2003	—	`conf`	On Complementing Nondeterministic Büchi Automata. CHARME Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi
2003	A	`conf`	On the Universal and Existential Fragments of the µ-Calculus. TACAS Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
2003	A	`conf`	Resets vs. Aborts in Linear Temporal Logic. TACAS Roy Armoni, Doron Bustan, Orna Kupferman, Moshe Y. Vardi
2003	J	`jnl`	Response to "Comments on 'On Object Systems and Behavior Inheritance'". IEEE Trans. Software Eng. Orna Kupferman, David Harel
2003	J	`jnl`	Vacuity detection in temporal model checking. Int. J. Softw. Tools Technol. Transf. Orna Kupferman, Moshe Y. Vardi
2003	J	`jnl`	What Causes a System to Satisfy a Specification? CoRR Hana Chockler, Joseph Y. Halpern, Orna Kupferman
2003	A*	`conf`	Π ICALP Orna Kupferman, Moshe Y. Vardi
2002	J	`jnl`	Alternating-time temporal logic. J. ACM Rajeev Alur, Thomas A. Henzinger, Orna Kupferman
2002	B	`conf`	An Improved Algorithm for the Membership Problem for Extended Regular Expressions. MFCS Orna Kupferman, Sharon Zuhovitzky
2002	—	`conf`	Coverage of Implementations by Simulating Specifications. IFIP TCS Hana Chockler, Orna Kupferman
2002	J	`jnl`	Fair Simulation. Inf. Comput. Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani
2002	A*	`conf`	Model Checking Linear Properties of Prefix-Recognizable Systems. CAV Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2002	J	`jnl`	On Object Systems and Behavioral Inheritance. IEEE Trans. Software Eng. David Harel, Orna Kupferman
2002	J	`jnl`	On the Complexity of Verifying Concurrent Transition Systems. Inf. Comput. David Harel, Orna Kupferman, Moshe Y. Vardi
2002	B	`conf`	Pushdown Specifications. LPAR Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2002	A*	`conf`	Synthesis of Uninitialized Systems. ICALP Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y. C. Mang
2002	A	`conf`	The Complexity of the Graded µ-Calculus. CADE Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi
2002	B	`conf`	Trading Probability for Fairness. CSL Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger
2002	—	`conf`	omega-Regular Languages Are Testable with a Constant Number of Queries. RANDOM Hana Chockler, Orna Kupferman
2001	A*	`conf`	A Practical Approach to Coverage in Model Checking. CAV Hana Chockler, Orna Kupferman, Robert P. Kurshan, Moshe Y. Vardi
2001	A	`conf`	Coverage Metrics for Temporal Logic Model Checking. TACAS Hana Chockler, Orna Kupferman, Moshe Y. Vardi
2001	B	`conf`	Extended Temporal Logic Revisited. CONCUR Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2001	J	`jnl`	Model Checking of Safety Properties. Formal Methods Syst. Des. Orna Kupferman, Moshe Y. Vardi
2001	J	`jnl`	Module Checking. Inf. Comput. Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
2001	B	`conf`	On Bounded Specifications. LPAR Orna Kupferman, Moshe Y. Vardi
2001	B	`conf`	On the Complexity of Parity Word Automata. FoSSaCS Valerie King, Orna Kupferman, Moshe Y. Vardi
2001	A*	`conf`	Synthesizing Distributed Systems. LICS Orna Kupferman, Moshe Y. Vardi
2001	J	`jnl`	Weak alternating automata are not that weak. ACM Trans. Comput. Log. Orna Kupferman, Moshe Y. Vardi
2000	A*	`conf`	An Automata-Theoretic Approach to Reasoning about Infinite-State Systems. CAV Orna Kupferman, Moshe Y. Vardi
2000	J	`jnl`	An automata-theoretic approach to branching-time model checking. J. ACM Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
2000	J	`jnl`	An automata-theortetic approach to modular model checking. ACM Trans. Program. Lang. Syst. Orna Kupferman, Moshe Y. Vardi
2000	—	`conf`	Branching-Depth Hierarchies. EXPRESS Shoham Shamir, Orna Kupferman, Eli Shamir
2000	—	`conf`	Fair Equivalence Relations. FSTTCS Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2000	—	`conf`	On the Behavioral Inheritance of State-Based Objects. TOOLS (34) David Harel, Orna Kupferman
2000	B	`conf`	Open Systems in Reactive Environments: Control and Synthesis. CONCUR Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi
2000	B	`conf`	µ-Calculus Synthesis. MFCS Orna Kupferman, Moshe Y. Vardi
1999	J	`jnl`	Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. J. Log. Comput. Orna Kupferman
1999	J	`jnl`	Church's problem revisited. Bull. Symb. Log. Orna Kupferman, Moshe Y. Vardi
1999	A*	`conf`	Model Checking of Safety Properties. CAV Orna Kupferman, Moshe Y. Vardi
1999	B	`conf`	Robust Satisfaction. CONCUR Orna Kupferman, Moshe Y. Vardi
1999	A	`conf`	The Weakness of Self-Complementation. STACS Orna Kupferman, Moshe Y. Vardi
1999	—	`conf`	Vacuity Detection in Temporal Model Checking. CHARME Orna Kupferman, Moshe Y. Vardi
1998	B	`conf`	Alternating Refinement Relations. CONCUR Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi
1998	A*	`conf`	Concurrent Reachability Games. FOCS Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman
1998	A*	`conf`	Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. LICS Orna Kupferman, Moshe Y. Vardi
1998	A*	`conf`	From CAV Thomas A. Henzinger, Orna Kupferman, Shaz Qadeer
1998	—	`conf`	Relating linear and branching model checking. PROCOMET Orna Kupferman, Moshe Y. Vardi
1998	J	`jnl`	Verification of Fair Transition Systems. Chic. J. Theor. Comput. Sci. Orna Kupferman, Moshe Y. Vardi
1998	A*	`conf`	Weak Alternating Automata and Tree Automata Emptiness. STOC Orna Kupferman, Moshe Y. Vardi
1997	—	`conf`	Alternating-Time Temporal Logic. COMPOS Rajeev Alur, Thomas A. Henzinger, Orna Kupferman
1997	A*	`conf`	Alternating-time Temporal Logic. FOCS Rajeev Alur, Thomas A. Henzinger, Orna Kupferman
1997	B	`conf`	Existence of Reduction Hierarchies. CSL Orna Kupferman, Robert P. Kurshan, Mihalis Yannakakis
1997	B	`conf`	Fair Simulation. CONCUR Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani
1997	—	`conf`	From Quantity to Quality. HART Thomas A. Henzinger, Orna Kupferman
1997	—	`conf`	Modular Model Checking. COMPOS Orna Kupferman, Moshe Y. Vardi
1997	A*	`conf`	Module Checking Revisited. CAV Orna Kupferman, Moshe Y. Vardi
1997	B	`conf`	On the Complexity of Verifying Concurrent Transition Systems. CONCUR David Harel, Orna Kupferman, Moshe Y. Vardi
1997	—	`conf`	Weak Alternating Automata Are Not That Weak. ISTCS Orna Kupferman, Moshe Y. Vardi
1996	B	`conf`	A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. CONCUR Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi
1996	J	`jnl`	Branching-Time Temporal Logic and Tree Automata. Inf. Comput. Orna Kupferman, Orna Grumberg
1996	J	`jnl`	Buy One, Get One Free!!! J. Log. Comput. Orna Kupferman, Orna Grumberg
1996	A*	`conf`	Module Checking. CAV Orna Kupferman, Moshe Y. Vardi
1996	—	`conf`	Not checking for closure under stuttering. The Spin Verification System Gerard J. Holzmann, Orna Kupferman
1996	A*	`conf`	Relating Word and Tree Automata. LICS Orna Kupferman, Shmuel Safra, Moshe Y. Vardi
1996	A*	`conf`	Verification of Fair Transisiton Systems. CAV Orna Kupferman, Moshe Y. Vardi
1995	A*	`conf`	Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. CAV Orna Kupferman
1995	—	`—`	Model checking for Branching-Time temporal logics. Orna Kupferman
1995	B	`conf`	On the Complexity of Branching Modular Model Checking (Extended Abstract). CONCUR Orna Kupferman, Moshe Y. Vardi
1995	A*	`conf`	Once and For All LICS Orna Kupferman, Amir Pnueli