| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. David Harel David Harel: A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal. VMCAI 2004 : 323-324 Liran Carmel , David Harel, Yehuda Koren : Combining Hierarchy and Energy Drawing Directed Graphs. IEEE Transactions on Visualization and Computer Graphics 10 (1): 46-57 (2004) 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. CMSB 2003 : 4-20 David Harel: On the Visualization and Aesthetics of Large Graphs: Short Abstract. Ershov Memorial Conference 2003 : 120 Yehuda Koren , David Harel: Axis-by-Axis Stress Minimization. Graph Drawing 2003 : 450-459 David Harel: A Grand Challenge: Full Reactive Modeling of a Multi-cellular Animal. HSCC 2003 : 2 Yehuda Koren , David Harel: A two-way visualization method for clustered data. KDD 2003 : 589-594 David Harel, Hillel Kugler , Rami Marelly , Amir Pnueli : Smart play-out. OOPSLA Companion 2003 : 68-69 David Harel: A Grand Challenge for Computing: Towards Full Reactive Modeling of A Multi-Cellular Animal. Bulletin of the EATCS 81 : 226-235 (2003) Orna Kupferman , David Harel: Response to "Comments on 'On Object Systems and Behavior Inheritance'". IEEE Trans. Software Eng. 29 (6): 576 (2003) David Harel, Rami Marelly : Specifying and executing behavioral requirements: the play-in/play-out approach. Software and System Modeling 2 (2): 82-107 (2003) David Harel: Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?). EMSOFT 2002 : 30-31 David Harel, Hillel Kugler , Rami Marelly , Amir Pnueli : Smart Play-out of Behavioral Requirements. FMCAD 2002 : 378-398 David Harel, Sol Efroni , Irun R. Cohen : Reactive Animation. FMCO 2002 : 136-153 Liran Carmel , David Harel, Yehuda Koren : Drawing Directed Graphs Using One-Dimensional Optimization. Graph Drawing 2002 : 193-206 David Harel, Yehuda Koren : Graph Drawing by High-Dimensional Embedding. Graph Drawing 2002 : 207-219 David Harel: Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?). ICGT 2002 : 6-7 Eran Gery , David Harel, Eldad Palachi : Rhapsody: A Complete Life-Cycle Model-Based Development System. IFM 2002 : 1-10 Yehuda Koren , Liran Carmel , David Harel: ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs. INFOVIS 2002 : 137-144 David Harel, Rami Marelly : Playing with Time: On the Specification and Execution of Time-Enriched LSCs. MASCOTS 2002 : 193-202 Rami Marelly , David Harel, Hillel Kugler : Multiple instances and symbolic variables in executable sequence charts. OOPSLA 2002 : 83-100 Yehuda Koren , David Harel: A Multi-scale Algorithm for the Linear Arrangement Problem. WG 2002 : 296-309 David Harel, Orna Kupferman : On Object Systems and Behavioral Inheritance. IEEE Trans. Software Eng. 28 (9): 889-903 (2002) David Harel, Orna Kupferman , Moshe Y. Vardi : On the Complexity of Verifying Concurrent Transition Systems. Inf. Comput. 173 (2): 143-161 (2002) David Harel, Hillel Kugler : Synthesizing State-Based Object Systems from LSC Specifications. Int. J. Found. Comput. Sci. 13 (1): 5-51 (2002) David Harel, Yehuda Koren : A Fast Multi-Scale Method for Drawing Large Graphs. J. Graph Algorithms Appl. 6 (3): 179-202 (2002) David Harel, Gregory Yashchin : An algorithm for blob hierarchy layout. The Visual Computer 18 (3): 164-185 (2002) David Harel, Yehuda Koren : On Clustering Using Random Walks. FSTTCS 2001 : 18-41 Na'aman Kam , Irun R. Cohen , David Harel: The Immune System as a Reactive System: Modeling T Cell Activation With Statecharts. HCC 2001 : 15-22 David Harel, Yehuda Koren : Clustering spatial data using random walks. KDD 2001 : 281-286 David Harel: On the Behavior of Complex Object-Oriented Systems. OMER 2001 : 11-15 Ronny Hadany , David Harel: A multi-scale algorithm for drawing graphs nicely. Discrete Applied Mathematics 113 (1): 3-21 (2001) Werner Damm , David Harel: LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design 19 (1): 45-80 (2001) David Harel: From Play-In Scenarios to Code: An Achievable Dream. IEEE Computer 34 (1): 53-60 (2001) David Harel, Yehuda Koren : A Fast Multi-Scale Method for Drawing Large Graphs. Advanced Visual Interfaces 2000 : 282-285 David Harel, Gregory Yashchin : An Algorithm for Blob Hierarchy Layout. Advanced Visual Interfaces 2000 : 29-40 David Harel, Hillel Kugler : Synthesizing State-Based Object Systems from LSC Specifications. CIAA 2000 : 1-33 David Harel: From Play-In Scenarios To Code: An Achievable Dream. Description Logics 2000 : 9 David Harel: From Play-In Scenarios to Code: An Achievable Dream. FASE 2000 : 22-34 David Harel, Yehuda Koren : A Fast Multi-scale Method for Drawing Large Graphs. Graph Drawing 2000 : 183-196 Werner Damm , David Harel: LSCs: Breathing Life into Message Sequence Charts. FMOODS 1999 Ronny Hadany , David Harel: A Multi-Scale Algorithm for Drawing Graphs Nicely. WG 1999 : 262-277 David Harel, Eli Singerman : Computation Paths Logic: An Expressive, yet Elementary, Process Logic. Ann. Pure Appl. Logic 96 (1-3): 167-186 (1999) David Harel: Towards a Theory of Recursive Structures. MFCS 1998 : 36-53 David Harel: On the Aesthetics of Diagrams (Summary of Talk). MPC 1998 : 1-5 David Harel, Meir Sardas : An Algorithm for Straight-Line of Planar Graphs. Algorithmica 20 (2): 119-135 (1998) Judith Gal-Ezer , David Harel: What (Else) Should CS Educators Know? Commun. ACM 41 (9): 77-84 (1998) David Harel: Some Thoughts on Statecharts, 13 Years Later. CAV 1997 : 226-231 David Harel, Orna Kupferman , Moshe Y. Vardi : On the Complexity of Verifying Concurrent Transition Systems. CONCUR 1997 : 258-272 David Harel, Eli Singerman : Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version). ICALP 1997 : 408-418 David Harel: Towards a Theory of Recursive Structures (extended abstract). LFCS 1997 : 141-144 David Harel: On the Aesthetics of Diagrams. NGITS 1997 : 0- David Harel: Will I Be Pretty, Will I Be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. RE 1997 : 184- David Harel: On the Aesthetics of Diagrams. VL 1997 : 128-130 David Harel, Eran Gery : Executable Object Modeling with Statecharts. IEEE Computer 30 (7): 31-42 (1997) David Harel: Some Thoughts on Statecharts, 13 Years Later (Abstract). ASIAN 1996 : 361 Bruce Powel Douglass , David Harel, Mark B. Trakhtenbrot : Statecharts in Use: Structured Analysis and Object-Orientation. European Educational Forum: School on Embedded Systems 1996 : 368-394 David Harel, Eran Gery : Executable Object Modeling with Statecharts. ICSE 1996 : 246-257 Tirza Hirst , David Harel: More About Recursive Structures: Descriptive Complexity and Zero-One Laws. LICS 1996 : 334-347 David Harel: Statecharts: Past, Present and Future (abstract). SOFSEM 1996 : 285 Ron Davidson , David Harel: Drawing Graphs Nicely Using Simulated Annealing. ACM Trans. Graph. 15 (4): 301-331 (1996) David Harel, Amnon Naamad : The STATEMATE Semantics of Statecharts. ACM Trans. Softw. Eng. Methodol. 5 (4): 293-333 (1996) David Harel, Eli Singerman : More on Nonregular PDL: Finite Models and Fibonacci-Like Programs. Inf. Comput. 128 (2): 109-118 (1996) Tirza Hirst , David Harel: Completeness Results for Recursive Data Bases. J. Comput. Syst. Sci. 52 (3): 522-536 (1996) Tirza Hirst , David Harel: Taking It to the Limit: On Infinite Variants of NP-Complete Problems. J. Comput. Syst. Sci. 53 (2): 180-193 (1996) Noa Globerman , David Harel: Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. Theor. Comput. Sci. 169 (2): 161-184 (1996) David Harel: Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. CONCUR 1995 : 264-268 David Harel, Eli Singerman : More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs. ISTCS 1995 : 140-149 David Harel: Towards a theory of Recursive Structures. Computer Science Today 1995 : 374-391 Judith Gal-Ezer , Catriel Beeri , David Harel, Amiram Yehudai : A High School Program in Computer Science. IEEE Computer 28 (10): 73-80 (1995) David Harel, Meir Sardas : Randomized Graph Drawing with Heavy-Duty Preprocessing. J. Vis. Lang. Comput. 6 (3): 233-253 (1995) David Harel, Meir Sardas : Randomized Graph Drawing with Heavy-Duty Preprocessing. Advanced Visual Interfaces 1994 : 19-33 Noa Globerman , David Harel: Complexity Results for Multi-Pebble Automata and their Logics. ICALP 1994 : 73-82 David Harel: Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary). PODS 1994 : 1-3 David Harel: Towards a Theory of Recursive Structures. STACS 1994 : 633-645 David Harel, Danny Raz : Deciding Emptiness for Stack Automata on Infinite Trees Inf. Comput. 113 (2): 278-299 (1994) Doron Drusinsky , David Harel: On the Power of Bounded Concurrency I: Finite Automata. J. ACM 41 (3): 517-539 (1994) Tirza Hirst , David Harel: On the Power of Bounded Concurrency II: Pushdown Automata. J. ACM 41 (3): 540-554 (1994) Yael Etzion-Petruschka , David Harel, Dale Myers : On the Solvability of Domino Snake Problems. Theor. Comput. Sci. 131 (2): 243-269 (1994) David Harel: Computers are not Omnipotent (Abstract). ESEC 1993 : 10 Tirza Hirst , David Harel: Completeness Results for Recursive Data Bases. PODS 1993 : 244-252 Tirza Hirst , David Harel: Taking it to the Limit: On Infinite Variants of NP-Complete Problems. Structure in Complexity Theory Conference 1993 : 292-304 David Harel, Danny Raz : Deciding Properties of Nonregular Programs. SIAM J. Comput. 22 (4): 857-874 (1993) David Harel, Chaim-Arie Kahana : On Statecharts with Overlapping. ACM Trans. Softw. Eng. Methodol. 1 (4): 399-421 (1992) David Harel: Biting the Silver Bullet - Toward a Brighter Future for System Development. IEEE Computer 25 (1): 8-20 (1992) David Harel: Hamiltonian Paths in Infinite Graphs STOC 1991 : 220-229 Tirza Hirst , David Harel: On the Power of Bounded Concurrency II: The Pushdown Automata Level. CAAP 1990 : 1-17 David Harel, Danny Raz : Deciding Properties of Nonregular Programs (Preliminary Version) FOCS 1990 : 652-661 David Harel: How Hard Is It to Reason about Propositional Programs? ICLP 1990 : 772-773 David Harel, Roni Rosner , Moshe Y. Vardi : On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report) LICS 1990 : 478-488 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. IEEE Trans. Software Eng. 16 (4): 403-414 (1990) David Harel: A Thesis for Bounded Concurrency. MFCS 1989 : 35-48 Doron Drusinsky , David Harel: On the Power of Cooperative Concurrency. Concurrency 1988 : 74-103 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 David Harel: On Visual Formalisms. Commun. ACM 31 (5): 514-530 (1988) David Harel, Amir Pnueli , Jeanette P. Schmidt , R. Sherman : On the Formal Semantics of Statecharts (Extended Abstract) LICS 1987 : 54-64 David Harel: Statecharts: A Visual Formulation for Complex Systems. Sci. Comput. Program. 8 (3): 231-274 (1987) David Harel: Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. J. ACM 33 (1): 224-248 (1986) David Harel, David Peleg : More on Looping vs. Repeating in Dynamic Logic. Inf. Process. Lett. 20 (2): 87-90 (1985) David Harel, R. Sherman : Propositional Dynamic Logic of Flowcharts Information and Control 64 (1-3): 119-135 (1985) Ashok K. Chandra , David Harel: Horn Clauses Queries and Generalizations. J. Log. Program. 2 (1): 1-15 (1985) David Harel, David Peleg : Process Logic with Regular Formulas. Theor. Comput. Sci. 38 : 307-322 (1985) David Harel: A General Result on Infinite Trees and Its Applications (Preliminary Report) STOC 1984 : 418-427 David Harel, David Peleg : On Static Logics, Dynamic Logics, and Complexity Classes Information and Control 60 (1-3): 86-102 (1984) David Harel, Dexter Kozen : A Programming Language for the Inductive Sets, and Applications Information and Control 63 (1/2): 118-139 (1984) Yishai A. Feldman , David Harel: A Probabilistic Dynamic Logic. J. Comput. Syst. Sci. 28 (2): 193-215 (1984) David Harel, Mike Paterson : Undecidability of PDL with L={a^(2i)|i>=0}. J. Comput. Syst. Sci. 29 (3): 359-365 (1984) 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) David Harel: Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). FCT 1983 : 177-194 David Harel, R. Sherman : Propositional Dynamic Logic of Flowcharts. FCT 1983 : 195-206 David Harel, Amir Pnueli , Jonathan Stavi : Propositional Dynamic Logic of Nonregular Programs. J. Comput. Syst. Sci. 26 (2): 222-243 (1983) David Harel, Dexter Kozen : A Programming Language for the Inductive Sets, and Applications. ICALP 1982 : 313-329 Ashok K. Chandra , David Harel: Horn Clauses and the Fixpoint Query Hierarchy. PODS 1982 : 158-163 R. Sherman , Amir Pnueli , David Harel: Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDL. POPL 1982 : 347-360 Yishai A. Feldman , David Harel: A Probabilistic Dynamic Logic STOC 1982 : 181-195 David Harel, R. Sherman : Looping vs. Repeating in Dynamic Logic Information and Control 55 (1-3): 175-192 (1982) Ashok K. Chandra , David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25 (1): 99-128 (1982) David Harel, Dexter Kozen , Rohit Parikh : Process Logic: Expressiveness, Decidability, Completeness. J. Comput. Syst. Sci. 25 (2): 144-170 (1982) David Harel, Amir Pnueli , Jonathan Stavi : Propositional Dynamic Logic of Context-Free Programs FOCS 1981 : 310-321 David Harel, Amir Pnueli , Jonathan Stavi : Further Results on Propositional Dynamic Logic of Nonregular Programs. Logic of Programs 1981 : 124-136 David Harel: On the Total Correctness of Nondeterministic Programs. Theor. Comput. Sci. 13 : 175-192 (1981) David Harel, Dexter Kozen , Rohit Parikh : Process Logic: Expressiveness, Decidability, Completeness FOCS 1980 : 129-142 Ashok K. Chandra , David Harel: Structure and Complexity of Relational Queries FOCS 1980 : 333-347 David Harel: on And/Or Schemes. MFCS 1980 : 246-260 Ashok K. Chandra , David Harel: Structure and Complexity of Relational Queries. XP1 Workshop on Database Theory 1980 David Harel: And/Or Programs: A New Approach to Structured Programming. ACM Trans. Program. Lang. Syst. 2 (1): 1-17 (1980) David Harel: On Folk Theorems. Commun. ACM 23 (7): 379-389 (1980) Ashok K. Chandra , David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21 (2): 156-178 (1980) David Harel: Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. Theor. Comput. Sci. 12 : 61-81 (1980) David Harel: First-Order Dynamic Logic Springer 1979 David Harel: Recursion in Logics of Programs. POPL 1979 : 81-92 Ashok K. Chandra , David Harel: Computable Queries for Relational Data Bases (Preliminary Report) STOC 1979 : 309-318 David Harel: Two Results on Process Logic. Inf. Process. Lett. 8 (4): 195-198 (1979) David Harel: Arithmetical Completeness in Logics of Programs. ICALP 1978 : 268-288 David Harel, Vaughan R. Pratt : Nondeterminism in Logics of Programs. POPL 1978 : 203-213 David Harel, Amir Pnueli , Jonathan Stavi : A Complete Axiomatic System for Proving Deductions about Recursive Programs STOC 1977 : 249-260 David Harel, Albert R. Meyer , Vaughan R. Pratt : Computability and Completeness in Logics of Programs (Preliminary Report) STOC 1977 : 261-268 1 [ 68 ] 2 [ 119 ] [ 123 ] [ 136 ] 3 [ 6 ] [ 10 ] [ 13 ] [ 15 ] [ 21 ] [ 25 ] [ 37 ] 4 [ 109 ] [ 124 ] 5 [ 97 ] [ 105 ] 6 [ 77 ] 7 [ 81 ] 8 [ 45 ] [ 61 ] 9 [ 124 ] 10 [ 59 ] 11 [ 23 ] [ 32 ] 12 [ 68 ] [ 91 ] 13 [ 80 ] [ 83 ] [ 120 ] 14 [ 65 ] [ 72 ] 15 [ 96 ] [ 106 ] 16 [ 51 ] [ 56 ] [ 57 ] [ 60 ] [ 73 ] [ 74 ] [ 79 ] 17 [ 135 ] 18 [ 54 ] 19 [ 109 ] [ 135 ] 20 [ 98 ] [ 103 ] [ 108 ] [ 110 ] [ 112 ] [ 116 ] [ 119 ] [ 122 ] [ 123 ] [ 131 ] [ 133 ] [ 136 ] 21 [ 16 ] [ 20 ] [ 26 ] [ 33 ] 22 [ 101 ] [ 113 ] [ 117 ] [ 125 ] [ 130 ] [ 135 ] 23 [ 89 ] [ 114 ] [ 115 ] [ 128 ] 24 [ 44 ] [ 47 ] 25 [ 117 ] [ 118 ] [ 125 ] [ 127 ] [ 130 ] [ 135 ] 26 [ 1 ] 27 [ 59 ] 28 [ 44 ] [ 47 ] [ 76 ] 29 [ 120 ] 30 [ 16 ] [ 20 ] 31 [ 31 ] 32 [ 34 ] [ 36 ] [ 39 ] 33 [ 2 ] [ 18 ] [ 19 ] [ 24 ] [ 27 ] [ 30 ] [ 42 ] [ 44 ] [ 47 ] [ 125 ] [ 130 ] [ 135 ] 34 [ 44 ] [ 47 ] 35 [ 1 ] [ 3 ] 36 [ 50 ] [ 55 ] [ 62 ] 37 [ 48 ] 38 [ 66 ] [ 67 ] [ 92 ] 39 [ 42 ] 40 [ 22 ] [ 24 ] [ 28 ] [ 30 ] [ 38 ] [ 42 ] 41 [ 44 ] [ 47 ] 42 [ 44 ] 43 [ 47 ] 44 [ 70 ] [ 75 ] [ 88 ] [ 95 ] 45 [ 2 ] [ 18 ] [ 19 ] [ 27 ] 46 [ 135 ] 47 [ 47 ] [ 81 ] 48 [ 48 ] [ 89 ] [ 114 ] 49 [ 102 ] [ 111 ] 50 [ 68 ]  ©2004 Association for Computing Machinery |
