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