The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Orna Kupferman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  103. Promptness in omega-Regular Automata. [Citation Graph (, )][DBLP]


  104. An Automata-Theoretic Approach to Infinite-State Systems. [Citation Graph (, )][DBLP]


  105. The Quest for a Tight Translation of Büchi to co-Büchi Automata. [Citation Graph (, )][DBLP]


  106. A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance. [Citation Graph (, )][DBLP]


  107. What Triggers a Behavior? [Citation Graph (, )][DBLP]


  108. Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. [Citation Graph (, )][DBLP]


  109. A Framework for Inherent Vacuity. [Citation Graph (, )][DBLP]


  110. Alternation Removal in Büchi Automata. [Citation Graph (, )][DBLP]


  111. Co-ing Büchi Made Tight and Useful. [Citation Graph (, )][DBLP]


  112. On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. [Citation Graph (, )][DBLP]


  113. Reasoning about online algorithms with weighted automata. [Citation Graph (, )][DBLP]


  114. On Verifying Fault Tolerance of Distributed Protocols. [Citation Graph (, )][DBLP]


  115. Rational Synthesis. [Citation Graph (, )][DBLP]


  116. Better Under-Approximation of Programs by Hiding Variables. [Citation Graph (, )][DBLP]


  117. Lattice Automata. [Citation Graph (, )][DBLP]


  118. Multi-valued Logics, Automata, Simulations, and Games. [Citation Graph (, )][DBLP]


  119. Improved Model Checking of Hierarchical Systems. [Citation Graph (, )][DBLP]


  120. Vacuity in Testing. [Citation Graph (, )][DBLP]


  121. Variable Automata over Infinite Alphabets. [Citation Graph (, )][DBLP]


  122. Rational Synthesis [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.046secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002