The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Harel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ashok K. Chandra, David Harel
    Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
  2. Ashok K. Chandra, David Harel
    Structure and Complexity of Relational Queries. [Citation Graph (73, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:1, pp:99-128 [Journal]
  3. Ashok K. Chandra, David Harel
    Horn Clauses Queries and Generalizations. [Citation Graph (65, 0)][DBLP]
    J. Log. Program., 1985, v:2, n:1, pp:1-15 [Journal]
  4. Ashok K. Chandra, David Harel
    Horn Clauses and the Fixpoint Query Hierarchy. [Citation Graph (23, 7)][DBLP]
    PODS, 1982, pp:158-163 [Conf]
  5. David Harel
    On Visual Formalisms. [Citation Graph (19, 0)][DBLP]
    Commun. ACM, 1988, v:31, n:5, pp:514-530 [Journal]
  6. David Harel
    Statecharts: A Visual Formulation for Complex Systems. [Citation Graph (15, 0)][DBLP]
    Sci. Comput. Program., 1987, v:8, n:3, pp:231-274 [Journal]
  7. Ashok K. Chandra, David Harel
    Structure and Complexity of Relational Queries [Citation Graph (9, 0)][DBLP]
    FOCS, 1980, pp:333-347 [Conf]
  8. Tirza Hirst, David Harel
    Completeness Results for Recursive Data Bases. [Citation Graph (5, 4)][DBLP]
    PODS, 1993, pp:244-252 [Conf]
  9. Ashok K. Chandra, David Harel
    Computable Queries for Relational Data Bases (Preliminary Report) [Citation Graph (5, 0)][DBLP]
    STOC, 1979, pp:309-318 [Conf]
  10. David Harel, Amnon Naamad
    The STATEMATE Semantics of Statecharts. [Citation Graph (3, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 1996, v:5, n:4, pp:293-333 [Journal]
  11. David Harel, Hagi Lachover, Amnon Naamad, Amir Pnueli, Michal Politi, Rivi Sherman, Aharon Shtull-Trauring, Mark B. Trakhtenbrot
    STATEMATE: A Working Environment for the Development of Complex Reactive Systems. [Citation Graph (3, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:4, pp:403-414 [Journal]
  12. David Harel, Hagi Lachover, Amnon Naamad, Amir Pnueli, Michal Politi, Rivi Sherman, Aharon Shtull-Trauring
    STATEMATE; A Working Environment for the Development of Complex Reactive Systems. [Citation Graph (2, 0)][DBLP]
    ICSE, 1988, pp:396-406 [Conf]
  13. David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman
    On the Formal Semantics of Statecharts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    LICS, 1987, pp:54-64 [Conf]
  14. David Harel
    Biting the Silver Bullet - Toward a Brighter Future for System Development. [Citation Graph (2, 0)][DBLP]
    IEEE Computer, 1992, v:25, n:1, pp:8-20 [Journal]
  15. David Harel, Eran Gery
    Executable Object Modeling with Statecharts. [Citation Graph (2, 0)][DBLP]
    IEEE Computer, 1997, v:30, n:7, pp:31-42 [Journal]
  16. Doron Drusinsky, David Harel
    On the Power of Bounded Concurrency I: Finite Automata. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1994, v:41, n:3, pp:517-539 [Journal]
  17. Noa Globerman, David Harel
    Complexity Results for Multi-Pebble Automata and their Logics. [Citation Graph (1, 0)][DBLP]
    ICALP, 1994, pp:73-82 [Conf]
  18. David Harel
    Arithmetical Completeness in Logics of Programs. [Citation Graph (1, 0)][DBLP]
    ICALP, 1978, pp:268-288 [Conf]
  19. David Harel
    A Thesis for Bounded Concurrency. [Citation Graph (1, 0)][DBLP]
    MFCS, 1989, pp:35-48 [Conf]
  20. David Harel
    Towards a Theory of Recursive Structures. [Citation Graph (1, 0)][DBLP]
    MFCS, 1998, pp:36-53 [Conf]
  21. David Harel
    Hamiltonian Paths in Infinite Graphs [Citation Graph (1, 0)][DBLP]
    STOC, 1991, pp:220-229 [Conf]
  22. David Harel, Dexter Kozen
    A Programming Language for the Inductive Sets, and Applications [Citation Graph (1, 0)][DBLP]
    Information and Control, 1984, v:63, n:1/2, pp:118-139 [Journal]
  23. David Harel, Dexter Kozen, Rohit Parikh
    Process Logic: Expressiveness, Decidability, Completeness. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:2, pp:144-170 [Journal]
  24. Noa Globerman, David Harel
    Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:169, n:2, pp:161-184 [Journal]
  25. Dan Barak, David Harel, Rami Marelly
    InterPlay: Horizontal Scale-up and Transition to Design in Scenario-Based Programming. [Citation Graph (0, 0)][DBLP]
    Lectures on Concurrency and Petri Nets, 2003, pp:66-86 [Conf]
  26. David Harel
    Some Thoughts on Statecharts, 13 Years Later (Abstract). [Citation Graph (0, 0)][DBLP]
    ASIAN, 1996, pp:361- [Conf]
  27. Pierre Combes, David Harel, Hillel Kugler
    Modeling and Verification of a Telecommunication Application Using Live Sequence Charts and the Play-Engine Tool. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:414-428 [Conf]
  28. David Harel, Yehuda Koren
    A Fast Multi-Scale Method for Drawing Large Graphs. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 2000, pp:282-285 [Conf]
  29. David Harel, Meir Sardas
    Randomized Graph Drawing with Heavy-Duty Preprocessing. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 1994, pp:19-33 [Conf]
  30. David Harel, Gregory Yashchin
    An Algorithm for Blob Hierarchy Layout. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 2000, pp:29-40 [Conf]
  31. David Harel, Hillel Kugler, Amir Pnueli
    Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements. [Citation Graph (0, 0)][DBLP]
    Formal Methods in Software and Systems Modeling, 2005, pp:309-324 [Conf]
  32. Tirza Hirst, David Harel
    On the Power of Bounded Concurrency II: The Pushdown Automata Level. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:1-17 [Conf]
  33. David Harel
    Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:3-4 [Conf]
  34. David Harel
    Some Thoughts on Statecharts, 13 Years Later. [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:226-231 [Conf]
  35. Jasmin Fisher, David Harel, E. Jane Albert Hubbard, Nir Piterman, Michael J. Stern, Naamah Swerdlin
    Combining State-Based and Scenario-Based Approaches in Modeling Biological Systems. [Citation Graph (0, 0)][DBLP]
    CMSB, 2004, pp:236-241 [Conf]
  36. Na'aman Kam, David Harel, Hillel Kugler, Rami Marelly, Amir Pnueli, E. Jane Albert Hubbard, Michael J. Stern
    Formal Modeling of C. elegans Development: A Scenario-Based Approach. [Citation Graph (0, 0)][DBLP]
    CMSB, 2003, pp:4-20 [Conf]
  37. Tirza Hirst, David Harel
    Taking it to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:292-304 [Conf]
  38. Doron Drusinsky, David Harel
    On the Power of Cooperative Concurrency. [Citation Graph (0, 0)][DBLP]
    Concurrency, 1988, pp:74-103 [Conf]
  39. David Harel
    Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:264-268 [Conf]
  40. 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]
  41. David Harel, Hillel Kugler, Gera Weiss
    Some Methodological Observations Resulting from Experience Using LSCs and the Play-In/Play-Out Approach. [Citation Graph (0, 0)][DBLP]
    Scenarios: Models, Transformations and Tools, 2003, pp:26-42 [Conf]
  42. David Harel, Hillel Kugler
    The Rhapsody Semantics of Statecharts (or, On the Executable Core of the UML) - Preliminary Version. [Citation Graph (0, 0)][DBLP]
    SoftSpez Final Report, 2004, pp:325-354 [Conf]
  43. David Harel
    From Play-In Scenarios To Code: An Achievable Dream. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2000, pp:9- [Conf]
  44. Bruce Powel Douglass, David Harel, Mark B. Trakhtenbrot
    Statecharts in Use: Structured Analysis and Object-Orientation. [Citation Graph (0, 0)][DBLP]
    European Educational Forum: School on Embedded Systems, 1996, pp:368-394 [Conf]
  45. David Harel
    Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?). [Citation Graph (0, 0)][DBLP]
    EMSOFT, 2002, pp:30-31 [Conf]
  46. David Harel
    On the Visualization and Aesthetics of Large Graphs: Short Abstract. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2003, pp:120- [Conf]
  47. David Harel
    Computers are not Omnipotent (Abstract). [Citation Graph (0, 0)][DBLP]
    ESEC, 1993, pp:10- [Conf]
  48. David Harel
    From Play-In Scenarios to Code: An Achievable Dream. [Citation Graph (0, 0)][DBLP]
    FASE, 2000, pp:22-34 [Conf]
  49. David Harel
    Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:177-194 [Conf]
  50. David Harel, Rivi Sherman
    Propositional Dynamic Logic of Flowcharts. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:195-206 [Conf]
  51. David Harel, Hillel Kugler, Rami Marelly, Amir Pnueli
    Smart Play-out of Behavioral Requirements. [Citation Graph (0, 0)][DBLP]
    FMCAD, 2002, pp:378-398 [Conf]
  52. David Harel, Sol Efroni, Irun R. Cohen
    Reactive Animation. [Citation Graph (0, 0)][DBLP]
    FMCO, 2002, pp:136-153 [Conf]
  53. Werner Damm, David Harel
    LSCs: Breathing Life into Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    FMOODS, 1999, pp:- [Conf]
  54. David Harel, Dexter Kozen, Rohit Parikh
    Process Logic: Expressiveness, Decidability, Completeness [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:129-142 [Conf]
  55. David Harel, Amir Pnueli, Jonathan Stavi
    Propositional Dynamic Logic of Context-Free Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:310-321 [Conf]
  56. David Harel, Danny Raz
    Deciding Properties of Nonregular Programs (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:652-661 [Conf]
  57. David Harel, Yehuda Koren
    On Clustering Using Random Walks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:18-41 [Conf]
  58. Liran Carmel, David Harel, Yehuda Koren
    Drawing Directed Graphs Using One-Dimensional Optimization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:193-206 [Conf]
  59. David Harel, Yehuda Koren
    A Fast Multi-scale Method for Drawing Large Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:183-196 [Conf]
  60. David Harel, Yehuda Koren
    Graph Drawing by High-Dimensional Embedding. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:207-219 [Conf]
  61. Yehuda Koren, David Harel
    Axis-by-Axis Stress Minimization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:450-459 [Conf]
  62. David Harel
    Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?). [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:6-7 [Conf]
  63. David Harel
    A Grand Challenge: Full Reactive Modeling of a Multi-cellular Animal. [Citation Graph (0, 0)][DBLP]
    HSCC, 2003, pp:2- [Conf]
  64. David Harel, Dexter Kozen
    A Programming Language for the Inductive Sets, and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:313-329 [Conf]
  65. David Harel, Eli Singerman
    Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:408-418 [Conf]
  66. David Harel
    How Hard Is It to Reason about Propositional Programs? [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:772-773 [Conf]
  67. David Harel, Eran Gery
    Executable Object Modeling with Statecharts. [Citation Graph (0, 0)][DBLP]
    ICSE, 1996, pp:246-257 [Conf]
  68. Eran Gery, David Harel, Eldad Palachi
    Rhapsody: A Complete Life-Cycle Model-Based Development System. [Citation Graph (0, 0)][DBLP]
    IFM, 2002, pp:1-10 [Conf]
  69. Yehuda Koren, Liran Carmel, David Harel
    ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs. [Citation Graph (0, 0)][DBLP]
    INFOVIS, 2002, pp:137-144 [Conf]
  70. David Harel, Eli Singerman
    More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:140-149 [Conf]
  71. David Harel, Yehuda Koren
    Clustering spatial data using random walks. [Citation Graph (0, 0)][DBLP]
    KDD, 2001, pp:281-286 [Conf]
  72. Yehuda Koren, David Harel
    A two-way visualization method for clustered data. [Citation Graph (0, 0)][DBLP]
    KDD, 2003, pp:589-594 [Conf]
  73. David Harel
    Towards a Theory of Recursive Structures (extended abstract). [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:141-144 [Conf]
  74. David Harel, Roni Rosner, Moshe Y. Vardi
    On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:478-488 [Conf]
  75. Tirza Hirst, David Harel
    More About Recursive Structures: Descriptive Complexity and Zero-One Laws. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:334-347 [Conf]
  76. David Harel, Amir Pnueli, Jonathan Stavi
    Further Results on Propositional Dynamic Logic of Nonregular Programs. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:124-136 [Conf]
  77. David Harel, Rami Marelly
    Playing with Time: On the Specification and Execution of Time-Enriched LSCs. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2002, pp:193-202 [Conf]
  78. David Harel
    Towards a Theory of Recursive Structures. [Citation Graph (0, 0)][DBLP]
    MCU (1), 1998, pp:93-114 [Conf]
  79. David Harel
    on And/Or Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:246-260 [Conf]
  80. David Harel
    On the Aesthetics of Diagrams (Summary of Talk). [Citation Graph (0, 0)][DBLP]
    MPC, 1998, pp:1-5 [Conf]
  81. David Harel
    On the Aesthetics of Diagrams. [Citation Graph (0, 0)][DBLP]
    NGITS, 1997, pp:0-0 [Conf]
  82. David Harel
    On the Behavior of Complex Object-Oriented Systems. [Citation Graph (0, 0)][DBLP]
    OMER, 2001, pp:11-15 [Conf]
  83. David Harel, Hillel Kugler, Rami Marelly, Amir Pnueli
    Smart play-out. [Citation Graph (0, 0)][DBLP]
    OOPSLA Companion, 2003, pp:68-69 [Conf]
  84. Rami Marelly, David Harel, Hillel Kugler
    Multiple instances and symbolic variables in executable sequence charts. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2002, pp:83-100 [Conf]
  85. David Harel
    Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary). [Citation Graph (0, 13)][DBLP]
    PODS, 1994, pp:1-3 [Conf]
  86. David Harel
    Recursion in Logics of Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1979, pp:81-92 [Conf]
  87. David Harel, Vaughan R. Pratt
    Nondeterminism in Logics of Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1978, pp:203-213 [Conf]
  88. Rivi Sherman, Amir Pnueli, David Harel
    Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDL. [Citation Graph (0, 0)][DBLP]
    POPL, 1982, pp:347-360 [Conf]
  89. David Harel, Hillel Kugler, Amir Pnueli
    Smart Play-Out Extended: Time and Forbidden Elements. [Citation Graph (0, 0)][DBLP]
    QSIC, 2004, pp:2-10 [Conf]
  90. David Harel
    Will I Be Pretty, Will I Be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. [Citation Graph (0, 0)][DBLP]
    RE, 1997, pp:184-0 [Conf]
  91. David Harel, Shahar Maoz
    Assert and negate revisited: modal semantics for UML sequence diagrams. [Citation Graph (0, 0)][DBLP]
    SCESM, 2006, pp:13-20 [Conf]
  92. Shahar Maoz, David Harel
    From multi-modal scenarios to code: compiling LSCs into aspectJ. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 2006, pp:219-230 [Conf]
  93. David Harel
    Statecharts: Past, Present and Future (abstract). [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:285- [Conf]
  94. David Harel
    Towards a Theory of Recursive Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:633-645 [Conf]
  95. Yishai A. Feldman, David Harel
    A Probabilistic Dynamic Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:181-195 [Conf]
  96. David Harel
    A General Result on Infinite Trees and Its Applications (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:418-427 [Conf]
  97. David Harel, Albert R. Meyer, Vaughan R. Pratt
    Computability and Completeness in Logics of Programs (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:261-268 [Conf]
  98. David Harel, Amir Pnueli, Jonathan Stavi
    A Complete Axiomatic System for Proving Deductions about Recursive Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:249-260 [Conf]
  99. Hillel Kugler, David Harel, Amir Pnueli, Yuan Lu, Yves Bontemps
    Temporal Logic for Scenario-Based Specifications. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:445-460 [Conf]
  100. Na'aman Kam, Irun R. Cohen, David Harel
    The Immune System as a Reactive System: Modeling T Cell Activation With Statecharts. [Citation Graph (0, 0)][DBLP]
    HCC, 2001, pp:15-22 [Conf]
  101. David Harel
    On the Aesthetics of Diagrams. [Citation Graph (0, 0)][DBLP]
    VL, 1997, pp:128-130 [Conf]
  102. David Harel
    A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:323-324 [Conf]
  103. Ronny Hadany, David Harel
    A Multi-Scale Algorithm for Drawing Graphs Nicely. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:262-277 [Conf]
  104. Yehuda Koren, David Harel
    A Multi-scale Algorithm for the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:296-309 [Conf]
  105. David Harel, Hillel Kugler
    Synthesizing State-Based Object Systems from LSC Specifications. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:1-33 [Conf]
  106. Herbert M. Sauro, David Harel, Marta Z. Kwiatkowska, Clifford A. Shaffer, Adelinde M. Uhrmacher, Michael Hucka, Pedro Mendes, Lena Strömbäck, John J. Tyson
    Challenges for modeling and simulation methods in systems biology. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2006, pp:1720-1730 [Conf]
  107. David Harel
    Comprehensive and realistic modeling of biological systems. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2006, pp:1625-1627 [Conf]
  108. Ashok K. Chandra, David Harel
    Structure and Complexity of Relational Queries. [Citation Graph (0, 0)][DBLP]
    XP1 Workshop on Database Theory, 1980, pp:- [Conf]
  109. James Coplien, Joseph Gil, David Harel, Bertrand Meyer
    Keynotes. [Citation Graph (0, 0)][DBLP]
    TOOLS (23), 1997, pp:2- [Conf]
  110. David Harel, Orna Kupferman
    On the Behavioral Inheritance of State-Based Objects. [Citation Graph (0, 0)][DBLP]
    TOOLS (34), 2000, pp:83-94 [Conf]
  111. David Harel, Meir Sardas
    An Algorithm for Straight-Line Drawing of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:2, pp:119-135 [Journal]
  112. David Harel, Eli Singerman
    Computation Paths Logic: An Expressive, yet Elementary, Process Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:167-186 [Journal]
  113. Judith Gal-Ezer, David Harel
    What (Else) Should CS Educators Know? [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1998, v:41, n:9, pp:77-84 [Journal]
  114. David Harel
    On Folk Theorems. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1980, v:23, n:7, pp:379-389 [Journal]
  115. David Harel, Liran Carmel, Doron Lancet
    Towards an odor communication system. [Citation Graph (0, 0)][DBLP]
    Computational Biology and Chemistry, 2003, v:27, n:2, pp:121-133 [Journal]
  116. Yehuda Koren, David Harel
    One-dimensional layout optimization, with applications to graph drawing by axis separation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:2, pp:115-138 [Journal]
  117. Sol Efroni, David Harel, Irun R. Cohen
    Reactive Animation: Realistic Modeling of Complex Dynamic Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2005, v:38, n:1, pp:38-47 [Journal]
  118. Judith Gal-Ezer, Catriel Beeri, David Harel, Amiram Yehudai
    A High School Program in Computer Science. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1995, v:28, n:10, pp:73-80 [Journal]
  119. David Harel
    From Play-In Scenarios to Code: An Achievable Dream. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2001, v:34, n:1, pp:53-60 [Journal]
  120. David Harel, Bernhard Rumpe
    Meaningful Modeling: What's the Semantics of "Semantics"?. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2004, v:37, n:10, pp:64-72 [Journal]
  121. Ronny Hadany, David Harel
    A multi-scale algorithm for drawing graphs nicely. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:1, pp:3-21 [Journal]
  122. David Harel
    A Grand Challenge for Computing: Towards Full Reactive Modeling of A Multi-Cellular Animal. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:81, n:, pp:226-235 [Journal]
  123. Werner Damm, David Harel
    LSCs: Breathing Life into Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2001, v:19, n:1, pp:45-80 [Journal]
  124. 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]
  125. David Harel, David Peleg
    On Static Logics, Dynamic Logics, and Complexity Classes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:86-102 [Journal]
  126. David Harel, Danny Raz
    Deciding Emptiness for Stack Automata on Infinite Trees [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:113, n:2, pp:278-299 [Journal]
  127. David Harel, Rivi Sherman
    Looping vs. Repeating in Dynamic Logic [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:175-192 [Journal]
  128. David Harel, Rivi Sherman
    Propositional Dynamic Logic of Flowcharts [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:119-135 [Journal]
  129. David Harel, Eli Singerman
    More on Nonregular PDL: Finite Models and Fibonacci-Like Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:128, n:2, pp:109-118 [Journal]
  130. David Harel, Hillel Kugler
    Synthesizing State-Based Object Systems from LSC Specifications. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:5-51 [Journal]
  131. David Harel
    Two Results on Process Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:195-198 [Journal]
  132. David Harel, David Peleg
    More on Looping vs. Repeating in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:2, pp:87-90 [Journal]
  133. David Harel
    Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:1, pp:224-248 [Journal]
  134. Tirza Hirst, David Harel
    On the Power of Bounded Concurrency II: Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:3, pp:540-554 [Journal]
  135. Yishai A. Feldman, David Harel
    A Probabilistic Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:2, pp:193-215 [Journal]
  136. David Harel, Mike Paterson
    Undecidability of PDL with L={a^(2i)|i>=0}. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:3, pp:359-365 [Journal]
  137. David Harel, Amir Pnueli, Jonathan Stavi
    Propositional Dynamic Logic of Nonregular Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:2, pp:222-243 [Journal]
  138. Tirza Hirst, David Harel
    Completeness Results for Recursive Data Bases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:522-536 [Journal]
  139. Tirza Hirst, David Harel
    Taking It to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:180-193 [Journal]
  140. David Harel, Yehuda Koren
    A Fast Multi-Scale Method for Drawing Large Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:3, pp:179-202 [Journal]
  141. David Harel, Yehuda Koren
    Graph Drawing by High-Dimensional Embedding. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:195-214 [Journal]
  142. David Harel, Danny Raz
    Deciding Properties of Nonregular Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:857-874 [Journal]
  143. Rivi Sherman, Amir Pnueli, David Harel
    Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:825-839 [Journal]
  144. David Harel, Rami Marelly
    Specifying and executing behavioral requirements: the play-in/play-out approach. [Citation Graph (0, 0)][DBLP]
    Software and System Modeling, 2003, v:2, n:2, pp:82-107 [Journal]
  145. Doron Drusinsky, David Harel
    Using statecharts for hardware description and synthesis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1989, v:8, n:7, pp:798-807 [Journal]
  146. Yael Etzion-Petruschka, David Harel, Dale Myers
    On the Solvability of Domino Snake Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:243-269 [Journal]
  147. David Harel
    Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:61-81 [Journal]
  148. David Harel
    On the Total Correctness of Nondeterministic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:175-192 [Journal]
  149. David Harel, David Peleg
    Process Logic with Regular Formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:307-322 [Journal]
  150. Ron Davidson, David Harel
    Drawing Graphs Nicely Using Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1996, v:15, n:4, pp:301-331 [Journal]
  151. David Harel
    And/Or Programs: A New Approach to Structured Programming. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1980, v:2, n:1, pp:1-17 [Journal]
  152. David Harel, Chaim-Arie Kahana
    On Statecharts with Overlapping. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 1992, v:1, n:4, pp:399-421 [Journal]
  153. 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]
  154. 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]
  155. Dan Barak, David Harel, Rami Marelly
    InterPlay: Horizontal Scale-Up and Transition to Design in Scenario-Based Programming. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2006, v:32, n:7, pp:467-485 [Journal]
  156. Liran Carmel, David Harel, Yehuda Koren
    Combining Hierarchy and Energy Drawing Directed Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2004, v:10, n:1, pp:46-57 [Journal]
  157. David Harel, Gregory Yashchin
    An algorithm for blob hierarchy layout. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 2002, v:18, n:3, pp:164-185 [Journal]
  158. David Harel, Meir Sardas
    Randomized Graph Drawing with Heavy-Duty Preprocessing. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 1995, v:6, n:3, pp:233-253 [Journal]
  159. David Harel, Asaf Kleinbort, Shahar Maoz
    S2A: A Compiler for Multi-modal UML Sequence Diagrams. [Citation Graph (0, 0)][DBLP]
    FASE, 2007, pp:121-124 [Conf]
  160. David Harel
    Statecharts in the making: a personal account. [Citation Graph (0, 0)][DBLP]
    HOPL, 2007, pp:1-43 [Conf]
  161. David Harel, Itai Segall
    Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs, . [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:485-499 [Conf]

  162. Some Thoughts on Behavioral Programming. [Citation Graph (, )][DBLP]


  163. Some Results on the Expressive Power and Complexity of LSCs. [Citation Graph (, )][DBLP]


  164. Some Thoughts on the Semantics of Biocharts. [Citation Graph (, )][DBLP]


  165. On the Power of Play-Out for Scenario-Based Programs. [Citation Graph (, )][DBLP]


  166. Generating Executable Scenarios from Natural Language. [Citation Graph (, )][DBLP]


  167. 06351 Abstracts Collection -- Methods for Modelling Software Systems (MMOSS). [Citation Graph (, )][DBLP]


  168. 06351 Summary -- Methods for Modelling Software Systems (MMOSS). [Citation Graph (, )][DBLP]


  169. Programming Coordinated Behavior in Java. [Citation Graph (, )][DBLP]


  170. Object Composition in Scenario-Based Programming. [Citation Graph (, )][DBLP]


  171. PlayGo: towards a comprehensive tool for scenario based programming. [Citation Graph (, )][DBLP]


  172. Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's. [Citation Graph (, )][DBLP]


  173. Accelerating Smart Play-Out. [Citation Graph (, )][DBLP]


  174. Visualizing inter-dependencies between scenarios. [Citation Graph (, )][DBLP]


  175. Towards Trace Visualization and Exploration for Reactive Systems. [Citation Graph (, )][DBLP]


  176. Generic Reactive Animation: Realistic Modeling of Complex Natural Systems. [Citation Graph (, )][DBLP]


  177. Using LSCs for scenario authoring in tactical simulators. [Citation Graph (, )][DBLP]


  178. Crafting game-models using reactive system design. [Citation Graph (, )][DBLP]


  179. Statecharts in the making: a personal account. [Citation Graph (, )][DBLP]


  180. Can Programming Be Liberated, Period? [Citation Graph (, )][DBLP]


  181. Concurrency in Biological Modeling: Behavior, Execution and Visualization. [Citation Graph (, )][DBLP]


Search in 0.040secs, Finished in 0.049secs
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