BibSLEIGH — Orna

Travelled to:

1 × Austria
1 × Belgium
1 × Cyprus
1 × Hungary
1 × Israel
1 × Latvia
1 × Norway
1 × Poland
1 × Russia
1 × Switzerland
1 × The Netherlands
12 × USA
2 × Canada
3 × Denmark
3 × Spain
4 × Germany
4 × United Kingdom
5 × France
6 × Italy

Collaborated with:

M.Y.Vardi U.Boker S.Almagor T.Ball G.Avni ∅ Y.Lustig T.A.Henzinger N.Piterman T.Tamir B.Aminof D.Fisman H.Chockler R.P.Kurshan G.Vardi S.Halamish D.Harel A.Pnueli G.Bielous R.Lampert A.Rosenberg O.Grumberg S.Sheinvald A.Murano M.Sagiv G.Yorsh R.Majumdar U.Sattler M.Jurdzinski V.King S.Qadeer M.Yannakakis S.Safra D.Kuperberg M.Skrzypczak S.Fogarty T.Wilke K.Chatterjee R.Armoni D.Bustan S.C.Krishnan F.Y.C.Mang J.O.Ringert Y.Velner

Talks about:

automata (14) check (8) system (7) synthesi (6) model (6) tempor (5) logic (5) abstract (4) büchi (4) game (4)

Person: Orna Kupferman

DBLP: Kupferman:Orna

Contributed to:

2015

2014

2013

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

2016

2017

2020

Wrote 64 papers:

CSL-2015-KupfermanV #finite #on the #probability: On Relative and Probabilistic Finite Counterability (OK, GV), pp. 175–192.
FoSSaCS-2014-AlmagorK #synthesis: Latticed-LTL Synthesis in the Presence of Noisy Inputs (SA, OK), pp. 226–241.
FoSSaCS-2014-AvniKT #game studies: Network-Formation Games with Regular Objectives (GA, OK, TT), pp. 119–133.
IJCAR-2014-AvniKT #game studies #reachability #specification: From Reachability to Temporal Specifications in Cost-Sharing Games (GA, OK, TT), pp. 1–15.
TACAS-2014-AlmagorBK #ltl: Discounting in LTL (SA, UB, OK), pp. 424–439.
TACAS-2014-Kupferman #safety: Variations on Safety (OK), pp. 1–14.
CAV-2013-AlmagorAK #automation #generative #quality #specification: Automatic Generation of Quality Specifications (SA, GA, OK), pp. 479–494.
FoSSaCS-2013-AvniK: Parameterized Weighted Containment (GA, OK), pp. 369–384.
ICALP-v2-2013-AlmagorBK #formal method #quality #reasoning: Formalizing and Reasoning about Quality (SA, UB, OK), pp. 15–27.
ICALP-v2-2013-BokerKKS #nondeterminism: Nondeterminism in the Presence of a Diverse or Unknown Future (UB, DK, OK, MS), pp. 89–100.
CSL-2011-FogartyKVW #automaton: Unifying Büchi Complementation Constructions (SF, OK, MYV, TW), pp. 248–263.
FoSSaCS-2011-BokerK #automaton: Co-Büching Them All (UB, OK), pp. 184–198.
FoSSaCS-2011-HalamishK #automaton: Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.
LICS-2011-AminofKL #approximate #automaton: Rigorous Approximated Determinization of Weighted Automata (BA, OK, RL), pp. 345–354.
LICS-2011-BokerCHK #cumulative #specification: Temporal Specifications with Accumulative Values (UB, KC, TAH, OK), pp. 43–52.
SAS-2011-AvniK #abstraction #framework #query: An Abstraction-Refinement Framework for Trigger Querying (GA, OK), pp. 263–279.
ICALP-v2-2010-BokerKR #automaton: Alternation Removal in Büchi Automata (UB, OK, AR), pp. 76–87.
LATA-2010-GrumbergKS #automaton #infinity: Variable Automata over Infinite Alphabets (OG, OK, SS), pp. 561–572.
TACAS-2010-FismanKL #synthesis: Rational Synthesis (DF, OK, YL), pp. 190–204.
VMCAI-2010-AminofKM #model checking: Improved Model Checking of Hierarchical Systems (BA, OK, AM), pp. 61–77.
FoSSaCS-2009-KupfermanP #automaton #bound: Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.
LICS-2009-BokerK #automaton: Co-ing Büchi Made Tight and Useful (UB, OK), pp. 245–254.
TACAS-2008-FismanKL #distributed #fault tolerance #on the #protocol #verification: On Verifying Fault Tolerance of Distributed Protocols (DF, OK, YL), pp. 315–331.
TAP-2008-BallK #testing: Vacuity in Testing (TB, OK), pp. 4–17.
VMCAI-2008-KupfermanL #automaton #game studies #logic #multi #simulation: Multi-valued Logics, Automata, Simulations, and Games (OK, YL), p. 5.
CAV-2007-BallKS #abstraction: Leaping Loops in the Presence of Abstraction (TB, OK, MS), pp. 491–503.
CAV-2007-KupfermanPV #liveness: From Liveness to Promptness (OK, NP, MYV), pp. 406–419.
CSL-2007-Kupferman #automaton: Tightening the Exchange Rates Between Automata (OK), pp. 7–22.
VMCAI-2007-BallK #approximate #source code: Better Under-Approximation of Programs by Hiding Variables (TB, OK), pp. 314–328.
VMCAI-2007-KupfermanL #automaton: Lattice Automata (OK, YL), pp. 199–213.
CAV-2006-KupfermanPV #composition #synthesis: Safraless Compositional Synthesis (OK, NP, MYV), pp. 31–44.
LICS-2006-BallK #abstraction #framework #multi: An Abstraction-Refinement Framework for Multi-Agent Systems (TB, OK), pp. 379–388.
LICS-2006-Kupferman: Avoiding Determinization (OK), pp. 243–254.
LICS-2006-KupfermanV #logic: Memoryful Branching-Time Logic (OK, MYV), pp. 265–274.
CAV-2005-BallKY #abstraction: Abstraction for Falsification (TB, OK, GY), pp. 67–81.
TACAS-2005-KupfermanV #automaton #infinity #nondeterminism #word: Complementation Constructions for Nondeterministic Automata on Infinite Words (OK, MYV), pp. 206–221.
TACAS-2004-KupfermanV #certification: From Complementation to Certification (OK, MYV), pp. 591–606.
ICALP-2003-KupfermanV: Π₂ ∩ Σ₂ ≡ AFMC (OK, MYV), pp. 697–713.
TACAS-2003-ArmoniBKV #linear #logic: Resets vs. Aborts in Linear Temporal Logic (RA, DB, OK, MYV), pp. 65–80.
TACAS-2003-HenzingerKM #calculus #on the #μ-calculus: On the Universal and Existential Fragments of the μ-Calculus (TAH, OK, RM), pp. 49–64.
CADE-2002-KupfermanSV #calculus #complexity: The Complexity of the Graded µ-Calculus (OK, US, MYV), pp. 423–437.
CAV-2002-KupfermanPV #linear #model checking: Model Checking Linear Properties of Prefix-Recognizable Systems (OK, NP, MYV), pp. 371–385.
CSL-2002-JurdzinskiKH #probability: Trading Probability for Fairness (MJ, OK, TAH), pp. 292–305.
ICALP-2002-HenzingerKKM #synthesis: Synthesis of Uninitialized Systems (TAH, SCK, OK, FYCM), pp. 644–656.
CAV-2001-ChocklerKKV #approach #model checking: A Practical Approach to Coverage in Model Checking (HC, OK, RPK, MYV), pp. 66–78.
FoSSaCS-2001-KingKV #automaton #complexity #on the #word: On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
LICS-2001-KupfermanV #distributed: Synthesizing Distributed Systems (OK, MYV), pp. 389–398.
TACAS-2001-ChocklerKV #logic #metric #model checking: Coverage Metrics for Temporal Logic Model Checking (HC, OK, MYV), pp. 528–542.
CAV-2000-KupfermanV #approach #infinity #reasoning: An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (OK, MYV), pp. 36–52.
TOOLS-USA-2000-HarelK #behaviour #inheritance #on the: On the Behavioral Inheritance of State-Based Objects (DH, OK), pp. 83–94.
CAV-1999-KupfermanV #model checking #safety: Model Checking of Safety Properties (OK, MYV), pp. 172–183.
CAV-1998-HenzingerKQ #model checking: From Pre-historic to Post-modern Symbolic Model Checking (TAH, OK, SQ), pp. 195–206.
LICS-1998-KupfermanV #linear: Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time (OK, MYV), pp. 81–92.
STOC-1998-KupfermanV #automaton: Weak Alternating Automata and Tree Automata Emptiness (OK, MYV), pp. 224–233.
CAV-1997-KupfermanV #revisited: Module Checking Revisited (OK, MYV), pp. 36–47.
CSL-1997-KupfermanKY #reduction: Existence of Reduction Hierarchies (OK, RPK, MY), pp. 327–340.
CAV-1996-KupfermanV: Module Checking (OK, MYV), pp. 75–86.
CAV-1996-KupfermanV96a #verification: Verification of Fair Transisiton Systems (OK, MYV), pp. 372–382.
LICS-1996-KupfermanSV #automaton #word: Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.
CAV-1995-Kupferman #branch #logic #quantifier: Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions (OK), pp. 325–338.
LICS-1995-KupfermanP: Once and For All (OK, AP), pp. 25–35.
CSL-2016-AlmagorK #probability #synthesis: High-Quality Synthesis Against Stochastic Environments (SA, OK), p. 17.
CAV-2017-AlmagorKRV #synthesis: Quantitative Assume Guarantee Synthesis (SA, OK, JOR, YV), pp. 353–374.
CSL-2020-BielousK #game studies #network: Coverage and Vacuity in Network Formation Games (GB, OK), p. 18.