| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. David Harel 109 Eran Gery , David Harel, Eldad Palachi : Rhapsody: A Complete Life-Cycle Model-Based Development System. IFM 2002 : 1-10 108 David Harel, Orna Kupferman , Moshe Y. Vardi : On the Complexity of Verifying Concurrent Transition Systems. Information and Computation 173 (2): 143-161 (2002) 107 David Harel, Hillel Kugler : Synthesizing State-Based Object Systems from LSC Specifications. International Journal of Foundations of Computer Science 13 (1): 5-51 (2002) 106 David Harel, Gregory Yashchin : An algorithm for blob hierarchy layout. The Visual Computer 18 (3): 164-185 (2002) 105 David Harel, Yehuda Koren : On Clustering Using Random Walks. FSTTCS 2001 : 18-41 104 David Harel, Yehuda Koren : Clustering spatial data using random walks. KDD 2001 : 281-286 103 Ronny Hadany , David Harel: A multi-scale algorithm for drawing graphs nicely. Discrete Applied Mathematics 113 (1): 3-21 (2001) 102 Werner Damm , David Harel: LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design 19 (1): 45-80 (2001) 101 David Harel: From Play-In Scenarios to Code: An Achievable Dream. IEEE Computer 34 (1): 53-60 (2001) 100 David Harel, Yehuda Koren : A Fast Multi-Scale Method for Drawing Large Graphs. Advanced Visual Interfaces 2000 : 282-285 99 David Harel, Gregory Yashchin : An Algorithm for Blob Hierarchy Layout. Advanced Visual Interfaces 2000 : 29-40 98 David Harel, Hillel Kugler : Synthesizing State-Based Object Systems from LSC Specifications. CIAA 2000 : 1-33 97 David Harel: From Play-In Scenarios To Code: An Achievable Dream. Description Logics 2000 : 9 96 David Harel: From Play-In Scenarios to Code: An Achievable Dream. FASE 2000 : 22-34 95 David Harel, Yehuda Koren : A Fast Multi-scale Method for Drawing Large Graphs. Graph Drawing 2000 : 183-196 94 Ronny Hadany , David Harel: A Multi-Scale Algorithm for Drawing Graphs Nicely. WG 1999 : 262-277 93 David Harel, Eli Singerman : Computation Paths Logic: An Expressive, yet Elementary, Process Logic. Annals of Pure and Applied Logic 96 (1-3): 167-186 (1999) 92 David Harel: Towards a Theory of Recursive Structures. MFCS 1998 : 36-53 91 David Harel: On the Aesthetics of Diagrams (Summary of Talk). MPC 1998 : 1-5 90 David Harel, Meir Sardas : An Algorithm for Straight-Line of Planar Graphs. Algorithmica 20 (2): 119-135 (1998) 89 Judith Gal-Ezer , David Harel: What (Else) Should CS Educators Know? CACM 41 (9): 77-84 (1998) 88 David Harel: Some Thoughts on Statecharts, 13 Years Later. CAV 1997 : 226-231 87 David Harel, Orna Kupferman , Moshe Y. Vardi : On the Complexity of Verifying Concurrent Transition Systems. CONCUR 1997 : 258-272 86 David Harel, Eli Singerman : Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version). ICALP 1997 : 408-418 85 David Harel: Towards a Theory of Recursive Structures (extended abstract). LFCS 1997 : 141-144 84 David Harel: On the Aesthetics of Diagrams. NGITS 1997 : 0- 83 David Harel: On the Aesthetics of Diagrams. VL 1997 : 128-130 82 David Harel, Eran Gery : Executable Object Modeling with Statecharts. IEEE Computer 30 (7): 31-42 (1997) 81 David Harel: Some Thoughts on Statecharts, 13 Years Later (Abstract). ASIAN 1996 : 361 80 Bruce Powell Douglass , David Harel, Mark B. Trakhtenbrot : Statecharts in Use: Structured Analysis and Object-Orientation. European Educational Forum: School on Embedded Systems 1996 : 368-394 79 David Harel, Eran Gery : Executable Object Modeling with Statecharts. ICSE 1996 : 246-257 78 Tirza Hirst , David Harel: More About Recursive Structures: Descriptive Complexity and Zero-One Laws. LICS 1996 : 334-347 77 David Harel: Statecharts: Past, Present and Future (abstract). SOFSEM 1996 : 285 76 Ron Davidson , David Harel: Drawing Graphs Nicely Using Simulated Annealing. ACM Transactions on Graphics 15 (4): 301-331 (1996) 75 David Harel, Eli Singerman : More on Nonregular PDL: Finite Models and Fibonacci-Like Programs. Information and Computation 128 (2): 109-118 (1996) 74 Tirza Hirst , David Harel: Completeness Results for Recursive Data Bases. JCSS 52 (3): 522-536 (1996) 73 Tirza Hirst , David Harel: Taking It to the Limit: On Infinite Variants of NP-Complete Problems. JCSS 53 (2): 180-193 (1996) 72 Noa Globerman , David Harel: Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. TCS 169 (2): 161-184 (1996) 71 David Harel, Amnon Naamad : The STATEMATE Semantics of Statecharts. TOSEM 5 (4): 293-333 (1996) 70 David Harel: Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. CONCUR 1995 : 264-268 69 David Harel: Towards a theory of Recursive Structures. Computer Science Today 1995 : 374-391 68 David Harel, Eli Singerman : More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs. ISTCS 1995 : 140-149 67 Judith Gal-Ezer , Catriel Beeri , David Harel, Amiram Yehudai : A High School Program in Computer Science. IEEE Computer 28 (10): 73-80 (1995) 66 David Harel, Meir Sardas : Randomized Graph Drawing with Heavy-Duty Preprocessing. Journal of Visual Languages and Computing 6 (3): 233-253 (1995) 65 David Harel, Meir Sardas : Randomized Graph Drawing with Heavy-Duty Preprocessing. Advanced Visual Interfaces 1994 : 19-33 64 Noa Globerman , David Harel: Complexity Results for Multi-Pebble Automata and their Logics. ICALP 1994 : 73-82 63 David Harel: Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary). PODS 1994 : 1-3 62 David Harel: Towards a Theory of Recursive Structures. STACS 1994 : 633-645 61 David Harel, Danny Raz : Deciding Emptiness for Stack Automata on Infinite Trees. Information and Computation 113 (2): 278-299 (1994) 60 Doron Drusinsky , David Harel: On the Power of Bounded Concurrency I: Finite Automata. JACM 41 (3): 517-539 (1994) 59 Tirza Hirst , David Harel: On the Power of Bounded Concurrency II: Pushdown Automata. JACM 41 (3): 540-554 (1994) 58 Yael Etzion-Petruschka , David Harel, Dale Myers : On the Solvability of Domino Snake Problems. TCS 131 (2): 243-269 (1994) 57 David Harel: Computers are not Omnipotent (Abstract). ESEC 1993 : 10 56 Tirza Hirst , David Harel: Completeness Results for Recursive Data Bases. PODS 1993 : 244-252 55 Tirza Hirst , David Harel: Taking it to the Limit: On Infinite Variants of NP-Complete Problems. Structure in Complexity Theory Conference 1993 : 292-304 54 David Harel, Danny Raz : Deciding Properties of Nonregular Programs. SIAM J. Comput. 22 (4): 857-874 (1993) 53 David Harel: Biting the Silver Bullet - Toward a Brighter Future for System Development. IEEE Computer 25 (1): 8-20 (1992) 52 David Harel, Chaim-Arie Kahana : On Statecharts with Overlapping. TOSEM 1 (4): 399-421 (1992) 51 David Harel: Hamiltonian Paths in Infinite Graphs. STOC 1991 : 220-229 50 Tirza Hirst , David Harel: On the Power of Bounded Concurrency II: The Pushdown Automata Level. CAAP 1990 : 1-17 49 David Harel, Danny Raz : Deciding Properties of Nonregular Programs (Preliminary Version). FOCS 1990 : 652-661 48 David Harel: How Hard Is It to Reason about Propositional Programs? ICLP 1990 : 772-773 47 David Harel, Roni Rosner , Moshe Y. Vardi : On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report). LICS 1990 : 478-488 46 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. TSE 16 (4): 403-414 (1990) 45 David Harel: A Thesis for Bounded Concurrency. MFCS 1989 : 35-48 44 Doron Drusinsky , David Harel: On the Power of Cooperative Concurrency. Concurrency 1988 : 74-103 43 David Harel, Hagi Lachover , Amnon Naamad , Amir Pnueli , Michal Politi , Rivi Sherman , Aharon Shtul-Trauring : STATEMATE; A Working Environment for the Development of Complex Reactive Systems. ICSE 1988 : 396-406 42 David Harel: On Visual Formalisms. CACM 31 (5): 514-530 (1988) 41 David Harel, Amir Pnueli , Jeanette P. Schmidt , R. Sherman : On the Formal Semantics of Statecharts (Extended Abstract). LICS 1987 : 54-64 40 David Harel: Statecharts: A Visual Formulation for Complex Systems. Science of Computer Programming 8 (3): 231-274 (1987) 39 David Harel: Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. JACM 33 (1): 224-248 (1986) 38 David Harel, David Peleg : More on Looping vs. Repeating in Dynamic Logic. Information Processing Letters 20 (2): 87-90 (1985) 37 David Harel, R. Sherman : Propositional Dynamic Logic of Flowcharts. Information and Control 64 (1-3): 119-135 (1985) 36 Ashok K. Chandra , David Harel: Horn Clauses Queries and Generalizations. JLP 2 (1): 1-15 (1985) 35 David Harel, David Peleg : Process Logic with Regular Formulas. TCS 38 : 307-322 (1985) 34 David Harel: A General Result on Infinite Trees and Its Applications (Preliminary Report). STOC 1984 : 418-427 33 David Harel, David Peleg : On Static Logics, Dynamic Logics, and Complexity Classes. Information and Control 60 (1-3): 86-102 (1984) 32 David Harel, Dexter Kozen : A Programming Language for the Inductive Sets, and Applications. Information and Control 63 (1/2): 118-139 (1984) 31 Yishai A. Feldman , David Harel: A Probabilistic Dynamic Logic. JCSS 28 (2): 193-215 (1984) 30 David Harel, Mike Paterson : Undecidability of PDL with L={a^(2i)|i>=0}. JCSS 29 (3): 359-365 (1984) 29 R. Sherman , Amir Pnueli , David Harel: Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL. SIAM J. Comput. 13 (4): 825-839 (1984) 28 David Harel: Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). FCT 1983 : 177-194 27 David Harel, R. Sherman : Propositional Dynamic Logic of Flowcharts. FCT 1983 : 195-206 26 David Harel, Amir Pnueli , Jonathan Stavi : Propositional Dynamic Logic of Nonregular Programs. JCSS 26 (2): 222-243 (1983) 25 David Harel, Dexter Kozen : A Programming Language for the Inductive Sets, and Applications. ICALP 1982 : 313-329 24 Ashok K. Chandra , David Harel: Horn Clauses and the Fixpoint Query Hierarchy. PODS 1982 : 158-163 23 R. Sherman , Amir Pnueli , David Harel: Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDL. POPL 1982 : 347-360 22 Yishai A. Feldman , David Harel: A Probabilistic Dynamic Logic. STOC 1982 : 181-195 21 David Harel, R. Sherman : Looping vs. Repeating in Dynamic Logic. Information and Control 55 (1-3): 175-192 (1982) 20 Ashok K. Chandra , David Harel: Structure and Complexity of Relational Queries. JCSS 25 (1): 99-128 (1982) 19 David Harel, Dexter Kozen , Rohit Parikh : Process Logic: Expressiveness, Decidability, Completeness. JCSS 25 (2): 144-170 (1982) 18 David Harel, Amir Pnueli , Jonathan Stavi : Propositional Dynamic Logic of Context-Free Programs. FOCS 1981 : 310-321 17 David Harel: On the Total Correctness of Nondeterministic Programs. TCS 13 : 175-192 (1981) 16 David Harel, Dexter Kozen , Rohit Parikh : Process Logic: Expressiveness, Decidability, Completeness. FOCS 1980 : 129-142 15 Ashok K. Chandra , David Harel: Structure and Complexity of Relational Queries. FOCS 1980 : 333-347 14 David Harel: on And/Or Schemes. MFCS 1980 : 246-260 13 Ashok K. Chandra , David Harel: Structure and Complexity of Relational Queries. XP1 Workshop on Database Theory 1980 12 David Harel: On Folk Theorems. CACM 23 (7): 379-389 (1980) 11 Ashok K. Chandra , David Harel: Computable Queries for Relational Data Bases. JCSS 21 (2): 156-178 (1980) 10 David Harel: Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. TCS 12 : 61-81 (1980) 9 David Harel: And/Or Programs: A New Approach to Structured Programming. TOPLAS 2 (1): 1-17 (1980) 8 David Harel: First-Order Dynamic Logic. Springer 1979 7 David Harel: Recursion in Logics of Programs. POPL 1979 : 81-92 6 Ashok K. Chandra , David Harel: Computable Queries for Relational Data Bases (Preliminary Report). STOC 1979 : 309-318 5 David Harel: Two Results on Process Logic. Information Processing Letters 8 (4): 195-198 (1979) 4 David Harel: Arithmetical Completeness in Logics of Programs. ICALP 1978 : 268-288 3 David Harel, Vaughan R. Pratt : Nondeterminism in Logics of Programs. POPL 1978 : 203-213 2 David Harel, Amir Pnueli , Jonathan Stavi : A Complete Axiomatic System for Proving Deductions about Recursive Programs. STOC 1977 : 249-260 1 David Harel, Albert R. Meyer , Vaughan R. Pratt : Computability and Completeness in Logics of Programs (Preliminary Report). STOC 1977 : 261-268  DiSC'02 © 2003 Association for Computing Machinery |
