Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David Harel
2010 – today
- 2012
[j85]
[j84]Yaki Setty, Irun R. Cohen, David Harel: Executable Modeling of Morphogenesis: A Turing-Inspired Approach. Fundam. Inform. 118(4): 403-417 (2012)
[j83]Ahmed Bouajjani, David Harel, Lenore D. Zuck: Editorʼs foreword. J. Comput. Syst. Sci. 78(3): 822 (2012)
[j82]David Harel, Itai Segall: Synthesis from scenario-based specifications. J. Comput. Syst. Sci. 78(3): 970-980 (2012)
[j81]David Harel, Assaf Marron: The quest for runware: on compositional, executable and intuitive models. Software and System Modeling 11(4): 599-608 (2012)
[j80]David Harel, Amir Kantor: Multi-modal scenarios revisited: A net-based representation. Theor. Comput. Sci. 429: 118-127 (2012)
[c134]David Harel: Dexter Kozen: A Winning Combination of Brilliance, Depth, and Elegance. Logic and Program Semantics 2012: 326-327
[c133]David Harel, Assaf Marron, Amir Nissim, Gera Weiss: A software engineering framework for switched fuzzy systems. FUZZ-IEEE 2012: 1-9
[c132]
[c131]David Harel: Standing on the Shoulders of a Giant - One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture). ICALP (2) 2012: 16-22
[c130]David Harel, Guy Katz, Assaf Marron, Gera Weiss: Non-intrusive Repair of Reactive Programs. ICECCS 2012: 3-12
[c129]David Harel: Standing on the shoulders of a giant: one person's experience of turing's impact. ITiCSE 2012: 3
[c128]
[c127]Michal Gordon, David Harel: Evaluating a natural language interface for behavioral programming. VL/HCC 2012: 167-170- 2011
[j79]Jasmin Fisher, David Harel, Thomas A. Henzinger: Biology as reactivity. Commun. ACM 54(10): 72-82 (2011)
[j78]Shahar Maoz, David Harel: On tracing reactive systems. Software and System Modeling 10(4): 447-468 (2011)
[j77]Shahar Maoz, David Harel, Asaf Kleinbort: A Compiler for Multimodal Scenarios: Transforming LSCs into AspectJ. ACM Trans. Softw. Eng. Methodol. 20(4): 18 (2011)
[c126]
[c125]David Harel, Robby Lampert, Assaf Marron, Gera Weiss: Model-checking behavioral programs. EMSOFT 2011: 279-288
[c124]
[c123]
[c122]Nir Eitan, Michal Gordon, David Harel, Assaf Marron, Gera Weiss: On Visualization and Comprehension of Scenario-Based Programs. ICPC 2011: 189-192
[c121]David Harel, Assaf Marron, Guy Wiener, Gera Weiss: Behavioral programming, decentralized control, and multiple time scales. SPLASH Workshops 2011: 171-182- 2010
[j76]David Harel: Amir Pnueli - A Gentle Giant: Lord of the phi's and the psi's. Formal Asp. Comput. 22(6): 663-665 (2010)
[j75]Yaki Setty, Irun R. Cohen, David Harel: Modeling Biology using Generic Reactive Animation. Fundam. Inform. 103(1-4): 235-246 (2010)
[j74]Rafi Haddad, Abebe Medhanie, Yehudah Roth, David Harel, Noam Sobel: Predicting Odor Pleasantness with an Electronic Nose. PLoS Computational Biology 6(4) (2010)
[c120]
[c119]David Harel, Hillel Kugler: Some Thoughts on the Semantics of Biocharts. Essays in Memory of Amir Pnueli 2010: 185-194
[c118]David Harel, Amir Kantor, Shahar Maoz: On the Power of Play-Out for Scenario-Based Programs. Concurrency, Compositionality, and Correctness 2010: 207-220
[c117]David Harel, Assaf Marron, Gera Weiss: Programming Coordinated Behavior in Java. ECOOP 2010: 250-274
[c116]David Harel, Shahar Maoz, Smadar Szekely, Daniel Barkan: PlayGo: towards a comprehensive tool for scenario based programming. ASE 2010: 359-360
[c115]
[c114]David Harel, Hillel Kugler, Shahar Maoz, Itai Segall: Accelerating Smart Play-Out. SOFSEM 2010: 477-488
[c113]Michal Gordon, David Harel: Semantic Navigation Strategies for Scenario-Based Programming. VL/HCC 2010: 219-226
2000 – 2009
- 2009
[j73]
[j72]David Harel, Michal Gordon-Kiwkowitz: On Teaching Visual Formalisms. IEEE Software 26(3): 87-95 (2009)
[c112]Michal Gordon, David Harel: Generating Executable Scenarios from Natural Language. CICLing 2009: 456-467
[c111]
[c110]
[r1]- 2008
[j71]
[j70]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)
[j69]Rafi Haddad, Liran Carmel, Noam Sobel, David Harel: Predicting the Receptive Range of Olfactory Receptors. PLoS Computational Biology 4(2) (2008)
[j68]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)
[j67]David Harel, Shahar Maoz: Assert and negate revisited: Modal semantics for UML sequence diagrams. Software and System Modeling 7(2): 237-252 (2008)
[j66]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)
[j65]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)
[c109]David Harel, Shahar Maoz, Itai Segall: Some Results on the Expressive Power and Complexity of LSCs. Pillars of Computer Science 2008: 351-366
[c108]Yoram Atir, David Harel, Asaf Kleinbort, Shahar Maoz: Object Composition in Scenario-Based Programming. FASE 2008: 301-316
[c107]David Harel, Yaki Setty: Generic Reactive Animation: Realistic Modeling of Complex Natural Systems. FMSB 2008: 1-16
[c106]David Harel, Itai Segall, Hillel Kugler, Yaki Setty: Crafting game-models using reactive system design. Future Play 2008: 121-128
[c105]- 2007
[j64]Sol Efroni, David Harel, Irun R. Cohen: Emergent Dynamics of Thymocyte Development and Lineage Determination. PLoS Computational Biology 3(1) (2007)
[c104]David Harel, Asaf Kleinbort, Shahar Maoz: S2A: A Compiler for Multi-modal UML Sequence Diagrams. FASE 2007: 121-124
[c103]
[c102]Yoram Atir, David Harel: Using LSCs for scenario authoring in tactical simulators. SCSC 2007: 437-442
[c101]David Harel, Itai Segall: Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs, . TACAS 2007: 485-499
[c100]Shahar Maoz, Asaf Kleinbort, David Harel: Towards Trace Visualization and Exploration for Reactive Systems. VL/HCC 2007: 153-156
[e3]Ed Brinksma, David Harel, Angelika Mader, Perdita Stevens, Roel Wieringa (Eds.): Methods for Modelling Software Systems (MMOSS), 27.08. - 01.09.2006. Dagstuhl Seminar Proceedings 06351, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007- 2006
[b8]David Harel, Yishai A. Feldman: Algorithmik - die Kunst des Rechnens. Springer 2006, ISBN 978-3-540-24342-7, pp. I-XVIII, 1-608
[j63]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)
[c99]David Harel: Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs. CAV 2006: 3-4
[c98]Ed Brinksma, David Harel, Angelika Mader, Perdita Stevens, Roel Wieringa: 06351 Summary -- Methods for Modelling Software Systems (MMOSS). MMOSS 2006
[c97]Ed Brinksma, David Harel, Angelika Mader, Perdita Stevens, Roel Wieringa: 06351 Abstracts Collection -- Methods for Modelling Software Systems (MMOSS). MMOSS 2006
[c96]David Harel, Shahar Maoz: Assert and negate revisited: modal semantics for UML sequence diagrams. SCESM 2006: 13-20
[c95]Shahar Maoz, David Harel: From multi-modal scenarios to code: compiling LSCs into aspectJ. SIGSOFT FSE 2006: 219-230
[c94]David Harel: Comprehensive and realistic modeling of biological systems. Winter Simulation Conference 2006: 1625-1627
[c93]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
[e2]Oscar Nierstrasz, Jon Whittle, David Harel, Gianna Reggio (Eds.): Model Driven Engineering Languages and Systems, 9th International Conference, MoDELS 2006, Genova, Italy, October 1-6, 2006, Proceedings. Lecture Notes in Computer Science 4199, Springer 2006, ISBN 3-540-45772-0- 2005
[j62]Yehuda Koren, David Harel: One-dimensional layout optimization, with applications to graph drawing by axis separation. Comput. Geom. 32(2): 115-138 (2005)
[j61]Sol Efroni, David Harel, Irun R. Cohen: Reactive Animation: Realistic Modeling of Complex Dynamic Systems. IEEE Computer 38(1): 38-47 (2005)
[c92]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
[c91]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
[c90]Hillel Kugler, David Harel, Amir Pnueli, Yuan Lu, Yves Bontemps: Temporal Logic for Scenario-Based Specifications. TACAS 2005: 445-460- 2004
[b7]David Harel, Yishai A. Feldman: Algorithmics - the spirit of computing (3. ed.). Addison-Wesley 2004, ISBN 978-0-321-11784-7, pp. I-XVIII, 1-513
[j60]David Harel, Bernhard Rumpe: Meaningful Modeling: What's the Semantics of "Semantics"?. IEEE Computer 37(10): 64-72 (2004)
[j59]David Harel, Yehuda Koren: Graph Drawing by High-Dimensional Embedding. J. Graph Algorithms Appl. 8(2): 195-214 (2004)
[j58]Liran Carmel, David Harel, Yehuda Koren: Combining Hierarchy and Energy Drawing Directed Graphs. IEEE Trans. Vis. Comput. Graph. 10(1): 46-57 (2004)
[c89]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
[c88]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
[c87]David Harel, Hillel Kugler, Amir Pnueli: Smart Play-Out Extended: Time and Forbidden Elements. QSIC 2004: 2-10
[c86]David Harel: A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal. VMCAI 2004: 323-324- 2003
[b6]David Harel: Computers Ltd - what they really can't do. Oxford University Press 2003, ISBN 978-0-19-860442-6, pp. I-XVII, 1-222
[b5]David Harel: Come, let's play - scenario-based programming using LSCs and the play-engine. Springer 2003, ISBN 978-3-540-00787-6, pp. I-XVIII, 1-382
[j57]David Harel, Liran Carmel, Doron Lancet: Towards an odor communication system. Computational Biology and Chemistry 27(2): 121-133 (2003)
[j56]David Harel: A Grand Challenge for Computing: Towards Full Reactive Modeling of A Multi-Cellular Animal. Bulletin of the EATCS 81: 226-235 (2003)
[j55]David Harel, Rami Marelly: Specifying and executing behavioral requirements: the play-in/play-out approach. Software and System Modeling 2(2): 82-107 (2003)
[j54]Orna Kupferman, David Harel: Response to "Comments on 'On Object Systems and Behavior Inheritance'". IEEE Trans. Software Eng. 29(6): 576 (2003)
[c85]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
[c84]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
[c83]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
[c82]David Harel: On the Visualization and Aesthetics of Large Graphs: Short Abstract. Ershov Memorial Conference 2003: 120
[c81]
[c80]
[c79]
[c78]- 2002
[b4]David Harel: Das Affenpuzzle - und weitere bad news aus der Computerwelt. Springer 2002, ISBN 978-3-540-42307-2, pp. I-XVII, 1-207
[j53]David Harel, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Verifying Concurrent Transition Systems. Inf. Comput. 173(2): 143-161 (2002)
[j52]David Harel, Hillel Kugler: Synthesizing State-Based Object Systems from LSC Specifications. Int. J. Found. Comput. Sci. 13(1): 5-51 (2002)
[j51]David Harel, Yehuda Koren: A Fast Multi-Scale Method for Drawing Large Graphs. J. Graph Algorithms Appl. 6(3): 179-202 (2002)
[j50]David Harel, Orna Kupferman: On Object Systems and Behavioral Inheritance. IEEE Trans. Software Eng. 28(9): 889-903 (2002)
[j49]David Harel, Gregory Yashchin: An algorithm for blob hierarchy layout. The Visual Computer 18(3): 164-185 (2002)
[c77]David Harel: Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?). EMSOFT 2002: 30-31
[c76]David Harel, Hillel Kugler, Rami Marelly, Amir Pnueli: Smart Play-out of Behavioral Requirements. FMCAD 2002: 378-398
[c75]
[c74]Liran Carmel, David Harel, Yehuda Koren: Drawing Directed Graphs Using One-Dimensional Optimization. Graph Drawing 2002: 193-206
[c73]
[c72]David Harel: Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?). ICGT 2002: 6-7
[c71]Eran Gery, David Harel, Eldad Palachi: Rhapsody: A Complete Life-Cycle Model-Based Development System. IFM 2002: 1-10
[c70]Yehuda Koren, Liran Carmel, David Harel: ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs. INFOVIS 2002: 137-144
[c69]David Harel, Rami Marelly: Playing with Time: On the Specification and Execution of Time-Enriched LSCs. MASCOTS 2002: 193-202
[c68]Rami Marelly, David Harel, Hillel Kugler: Multiple instances and symbolic variables in executable sequence charts. OOPSLA 2002: 83-100
[c67]Yehuda Koren, David Harel: A Multi-scale Algorithm for the Linear Arrangement Problem. WG 2002: 296-309- 2001
[j48]
[j47]Ronny Hadany, David Harel: A multi-scale algorithm for drawing graphs nicely. Discrete Applied Mathematics 113(1): 3-21 (2001)
[j46]Werner Damm, David Harel: LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design 19(1): 45-80 (2001)
[j45]
[c66]
[c65]
[c64]
[c63]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- 2000
[c62]David Harel, Gregory Yashchin: An Algorithm for Blob Hierarchy Layout. Advanced Visual Interfaces 2000: 29-40
[c61]David Harel, Yehuda Koren: A Fast Multi-Scale Method for Drawing Large Graphs. Advanced Visual Interfaces 2000: 282-285
[c60]
[c59]
[c58]David Harel, Yehuda Koren: A Fast Multi-scale Method for Drawing Large Graphs. Graph Drawing 2000: 183-196
[c57]David Harel, Orna Kupferman: On the Behavioral Inheritance of State-Based Objects. TOOLS (34) 2000: 83-94
[c56]David Harel, Hillel Kugler: Synthesizing State-Based Object Systems from LSC Specifications. CIAA 2000: 1-33
1990 – 1999
- 1999
[j44]David Harel, Eli Singerman: Computation Paths Logic: An Expressive, yet Elementary, Process Logic. Ann. Pure Appl. Logic 96(1-3): 167-186 (1999)
[c55]
[c54]- 1998
[j43]David Harel, Meir Sardas: An Algorithm for Straight-Line Drawing of Planar Graphs. Algorithmica 20(2): 119-135 (1998)
[j42]
[c53]
[c52]
[c51]- 1997
[j41]David Harel, Eran Gery: Executable Object Modeling with Statecharts. IEEE Computer 30(7): 31-42 (1997)
[c50]
[c49]David Harel, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Verifying Concurrent Transition Systems. CONCUR 1997: 258-272
[c48]David Harel, Eli Singerman: Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version). ICALP 1997: 408-418
[c47]
[c46]
[c45]David Harel: Will I Be Pretty, Will I Be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. RE 1997: 184-
[c44]
[c43]- 1996
[j40]David Harel, Eli Singerman: More on Nonregular PDL: Finite Models and Fibonacci-Like Programs. Inf. Comput. 128(2): 109-118 (1996)
[j39]Tirza Hirst, David Harel: Completeness Results for Recursive Data Bases. J. Comput. Syst. Sci. 52(3): 522-536 (1996)
[j38]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)
[j37]Noa Globerman, David Harel: Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. Theor. Comput. Sci. 169(2): 161-184 (1996)
[j36]Ron Davidson, David Harel: Drawing Graphs Nicely Using Simulated Annealing. ACM Trans. Graph. 15(4): 301-331 (1996)
[j35]David Harel, Amnon Naamad: The STATEMATE Semantics of Statecharts. ACM Trans. Softw. Eng. Methodol. 5(4): 293-333 (1996)
[c42]
[c41]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
[c40]
[c39]Tirza Hirst, David Harel: More About Recursive Structures: Descriptive Complexity and Zero-One Laws. LICS 1996: 334-347
[c38]- 1995
[j34]Judith Gal-Ezer, Catriel Beeri, David Harel, Amiram Yehudai: A High School Program in Computer Science. IEEE Computer 28(10): 73-80 (1995)
[j33]David Harel: Will I be pretty, will I be rich?: some thoughts on theory vs. practice in systems engineering. SIGACT News 26(2): 21-25 (1995)
[j32]David Harel, Meir Sardas: Randomized Graph Drawing with Heavy-Duty Preprocessing. J. Vis. Lang. Comput. 6(3): 233-253 (1995)
[c37]David Harel: Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. CONCUR 1995: 264-268
[c36]David Harel, Eli Singerman: More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs. ISTCS 1995: 140-149
[p1]- 1994
[j31]David Harel, Danny Raz: Deciding Emptiness for Stack Automata on Infinite Trees. Inf. Comput. 113(2): 278-299 (1994)
[j30]Doron Drusinsky, David Harel: On the Power of Bounded Concurrency I: Finite Automata. J. ACM 41(3): 517-539 (1994)
[j29]Tirza Hirst, David Harel: On the Power of Bounded Concurrency II: Pushdown Automata. J. ACM 41(3): 540-554 (1994)
[j28]Yael Etzion-Petruschka, David Harel, Dale Myers: On the Solvability of Domino Snake Problems. Theor. Comput. Sci. 131(2): 243-269 (1994)
[c35]David Harel, Meir Sardas: Randomized Graph Drawing with Heavy-Duty Preprocessing. Advanced Visual Interfaces 1994: 19-33
[c34]Noa Globerman, David Harel: Complexity Results for Multi-Pebble Automata and their Logics. ICALP 1994: 73-82
[c33]David Harel: Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary). PODS 1994: 1-3
[c32]- 1993
[j27]David Harel, Danny Raz: Deciding Properties of Nonregular Programs. SIAM J. Comput. 22(4): 857-874 (1993)
[c31]Tirza Hirst, David Harel: Taking it to the Limit: On Infinite Variants of NP-Complete Problems. Structure in Complexity Theory Conference 1993: 292-304
[c30]
[c29]- 1992
[j26]David Harel: Biting the Silver Bullet - Toward a Brighter Future for System Development. IEEE Computer 25(1): 8-20 (1992)
[j25]David Harel, Chaim-Arie Kahana: On Statecharts with Overlapping. ACM Trans. Softw. Eng. Methodol. 1(4): 399-421 (1992)- 1991
[c28]- 1990
[j24]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)
[c27]Tirza Hirst, David Harel: On the Power of Bounded Concurrency II: The Pushdown Automata Level. CAAP 1990: 1-17
[c26]
[c25]
[c24]David Harel, Roni Rosner, Moshe Y. Vardi: On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report). LICS 1990: 478-488
1980 – 1989
- 1989
[b3]David Harel: The science of computing - exploring the nature and power of algorithms. Addison-Wesley 1989, ISBN 978-0-201-51723-1, pp. I-XV, 1-348
[j23]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)
[c23]- 1988
[j22]
[c22]
[c21]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- 1987
[b2]David Harel: Algorithmics - the spirit of computing (2. ed.). Addison-Wesley 1987, ISBN 978-0-201-19240-7, pp. I-XV, 1-476
[j21]David Harel: Statecharts: A Visual Formalism for Complex Systems. Sci. Comput. Program. 8(3): 231-274 (1987)
[c20]David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman: On the Formal Semantics of Statecharts (Extended Abstract). LICS 1987: 54-64- 1986
[j20]David Harel: Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. J. ACM 33(1): 224-248 (1986)- 1985
[j19]David Harel, Rivi Sherman: Propositional Dynamic Logic of Flowcharts. Information and Control 64(1-3): 119-135 (1985)
[j18]David Harel, David Peleg: More on Looping vs. Repeating in Dynamic Logic. Inf. Process. Lett. 20(2): 87-90 (1985)
[j17]Ashok K. Chandra, David Harel: Horn Clauses Queries and Generalizations. J. Log. Program. 2(1): 1-15 (1985)
[j16]David Harel, David Peleg: Process Logic with Regular Formulas. Theor. Comput. Sci. 38: 307-322 (1985)- 1984
[j15]David Harel, David Peleg: On Static Logics, Dynamic Logics, and Complexity Classes. Information and Control 60(1-3): 86-102 (1984)
[j14]David Harel, Dexter Kozen: A Programming Language for the Inductive Sets, and Applications. Information and Control 63(1/2): 118-139 (1984)
[j13]Yishai A. Feldman, David Harel: A Probabilistic Dynamic Logic. J. Comput. Syst. Sci. 28(2): 193-215 (1984)
[j12]David Harel, Mike Paterson: Undecidability of PDL with L={a^(2i)|i>=0}. J. Comput. Syst. Sci. 29(3): 359-365 (1984)
[j11]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)
[c19]David Harel: A General Result on Infinite Trees and Its Applications (Preliminary Report). STOC 1984: 418-427- 1983
[j10]David Harel, Amir Pnueli, Jonathan Stavi: Propositional Dynamic Logic of Nonregular Programs. J. Comput. Syst. Sci. 26(2): 222-243 (1983)
[c18]David Harel: Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). FCT 1983: 177-194
[c17]
[e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas (Eds.): Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983- 1982
[j9]David Harel, Rivi Sherman: Looping vs. Repeating in Dynamic Logic. Information and Control 55(1-3): 175-192 (1982)
[j8]Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128 (1982)
[j7]David Harel, Dexter Kozen, Rohit Parikh: Process Logic: Expressiveness, Decidability, Completeness. J. Comput. Syst. Sci. 25(2): 144-170 (1982)
[c16]David Harel, Dexter Kozen: A Programming Language for the Inductive Sets, and Applications. ICALP 1982: 313-329
[c15]
[c14]Rivi Sherman, Amir Pnueli, David Harel: Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDL. POPL 1982: 347-360
[c13]- 1981
[j6]David Harel: On the Total Correctness of Nondeterministic Programs. Theor. Comput. Sci. 13: 175-192 (1981)
[c12]David Harel, Amir Pnueli, Jonathan Stavi: Propositional Dynamic Logic of Context-Free Programs. FOCS 1981: 310-321
[c11]David Harel, Amir Pnueli, Jonathan Stavi: Further Results on Propositional Dynamic Logic of Nonregular Programs. Logic of Programs 1981: 124-136- 1980
[j5]
[j4]Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178 (1980)
[j3]David Harel: Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. Theor. Comput. Sci. 12: 61-81 (1980)
[j2]David Harel: And/Or Programs: A New Approach to Structured Programming. ACM Trans. Program. Lang. Syst. 2(1): 1-17 (1980)
[c10]David Harel, Dexter Kozen, Rohit Parikh: Process Logic: Expressiveness, Decidability, Completeness. FOCS 1980: 129-142
[c9]
[c8]
[c7]Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. XP1 Workshop on Database Theory 1980
1970 – 1979
- 1979
[b1]David Harel: First-Order Dynamic Logic. Lecture Notes in Computer Science 68, Springer 1979, ISBN 3-540-09237-4
[j1]
[c6]
[c5]Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases (Preliminary Report). STOC 1979: 309-318- 1978
[c4]
[c3]- 1977
[c2]David Harel, Amir Pnueli, Jonathan Stavi: A Complete Axiomatic System for Proving Deductions about Recursive Programs. STOC 1977: 249-260
[c1]David Harel, Albert R. Meyer, Vaughan R. Pratt: Computability and Completeness in Logics of Programs (Preliminary Report). STOC 1977: 261-268
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team



