dblp.uni-trier.dewww.uni-trier.de

Orna Kupferman Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Luca de Alfaro [23] [99]
2Rajeev Alur [12] [17] [24] [49]
3Benjamin Aminof [74] [97] [111] [116]
4Roy Armoni [66]
5Thomas Ball [74] [83] [91] [100] [104] [109]
6Doron Bustan [66] [73] [82]
7Arindam Chakrabarti [81]
8Krishnendu Chatterjee [81]
9Hana Chockler [43] [48] [53] [56] [64] [70] [71] [85] [88] [107]
10Dana Fisman [110] [112] [115]
11Alon Flaisher [82]
12Ehud Friedgut [75] [87]
13Orna Grumberg [4] [5] [82]
14Sankar Gurumurthy [69]
15Joseph Y. Halpern [64] [107]
16David Harel [15] [35] [50] [52] [62]
17Thomas A. Henzinger [7] [11] [12] [14] [17] [23] [24] [25] [49] [51] [57] [58] [63] [67] [81] [84] [99]
18Marcin Jurdzinski [58]
19Valerie King [46]
20Sriram C. Krishnan [57]
21Robert P. Kurshan [13] [48]
22Robby Lampert [98] [116]
23Omer Lev [111]
24Wenchao Li [113]
25Yoad Lustig [90] [101] [102] [106] [108] [110] [115]
26P. Madhusudan (Parthasarathy Madhusudan) [38]
27Rupak Majumdar [67] [81] [84]
28Freddy Y. C. Mang [57]
29Gila Morgenstern [76] [86]
30Aniello Murano [76] [86]
31Nir Piterman [37] [47] [55] [59] [65] [96] [105] [114] [117]
32Amir Pnueli [1]
33Shaz Qadeer [25] [63]
34Sriram K. Rajamani [14] [51]
35Shmuel Safra [6] [89]
36Shmuel Sagiv (Mooly Sagiv) [104]
37Ulrike Sattler [60]
38Sanjit A. Seshia [113]
39Eli Shamir [33]
40Shoham Shamir [33]
41Sarai Sheinvald-Faragy [94] [112]
42Fabio Somenzi [69]
43P. S. Thiagarajan [38]
44Moshe Y. Vardi [2] [6] [7] [8] [9] [10] [15] [16] [18] [19] [20] [21] [22] [24] [27] [28] [29] [30] [31] [32] [34] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [50] [55] [59] [60] [61] [65] [66] [68] [69] [70] [72] [73] [75] [77] [78] [79] [80] [82] [85] [87] [88] [89] [90] [92] [96] [105] [112] [114]
45Pierre Wolper [32] [40]
46Mihalis Yannakakis [13]
47Greta Yorsh [83]
48Sharon Zuhovitzky [54]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)