Travelled to:1 × Belgium
1 × Denmark
1 × Finland
1 × Hungary
1 × Ireland
1 × Singapore
1 × Slovenia
1 × Spain
2 × Canada
2 × Italy
2 × Portugal
22 × USA
3 × United Kingdom
4 × Germany
4 × Israel
Collaborated with:∅ H.Kugler S.Maoz A.Pnueli I.Segall Y.Koren T.Hirst A.K.Chandra E.Gery V.R.Pratt R.Sherman A.Kleinbort A.Marron G.Weiss O.Kupferman E.Singerman N.Globerman D.Kozen Y.A.Feldman E.Palachi R.Marelly R.Rosner M.Y.Vardi A.R.Meyer J.Stavi S.Szekely D.Barkan Y.Atir J.Coplien J.Y.Gil B.Meyer J.P.Schmidt N.Eitan M.Gordon Y.Lu Y.Bontemps H.Lachover A.Naamad M.Politi A.Shtull-Trauring
Talks about:program (15) base (12) logic (10) scenario (9) system (7) complet (5) object (5) comput (5) be (5) behavior (4)
Person: David Harel
DBLP: Harel:David
Facilitated 3 volumes:
EdEd
EdContributed to:
2012
2012
2011
2011
2010
2010
2010
2008
20082007
2007
2006
20062005
2004
2003
2002
2002
20022001
200020022000
200019971997
19971997
199619961994
1994
199319931991
1990199019881987198419821982
1982198219791979197819781977Wrote 50 papers:
- ICALP-v2-2012-Harel #experience #summary
- Standing on the Shoulders of a Giant — One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture) (DH), pp. 16–22.
- ITiCSE-2012-Harel #experience
- Standing on the shoulders of a giant: one person’s experience of turing’s impact (DH), p. 3.
- FM-2011-Harel #behaviour #programming
- Some Thoughts on Behavioral Programming (DH), p. 2.
- ICPC-2011-EitanGHMW #comprehension #on the #source code #visualisation
- On Visualization and Comprehension of Scenario-Based Programs (NE, MG, DH, AM, GW), pp. 189–192.
- ASE-2010-HarelMSB #named #programming #towards
- PlayGo: towards a comprehensive tool for scenario based programming (DH, SM, SS, DB), pp. 359–360.
- ECOOP-2010-HarelMW #behaviour #coordination #java #programming
- Programming Coordinated Behavior in Java (DH, AM, GW), pp. 250–274.
- LICS-2010-Harel
- Amir Pnueli: A Gentle Giant, Lord of the Phi’s and the Psi’s (DH), p. 57.
- FASE-2008-AtirHKM #composition #programming
- Object Composition in Scenario-Based Programming (YA, DH, AK, SM), pp. 301–316.
- SOFTVIS-2008-HarelS #visualisation
- Visualizing inter-dependencies between scenarios (DH, IS), pp. 145–153.
- FASE-2007-HarelKM #compilation #diagrams #multi #named #sequence chart #uml
- S2A: A Compiler for Multi-modal UML Sequence Diagrams (DH, AK, SM), pp. 121–124.
- TACAS-2007-HarelS #flexibility #source code
- Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs, (DH, IS), pp. 485–499.
- CAV-2006-Harel #aspect-oriented #game studies #source code #verification
- Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs (DH), pp. 3–4.
- FSE-2006-MaozH #aspectj #compilation #multi
- From multi-modal scenarios to code: compiling LSCs into aspectJ (SM, DH), pp. 219–230.
- TACAS-2005-KuglerHPLB #logic #specification
- Temporal Logic for Scenario-Based Specifications (HK, DH, AP, YL, YB), pp. 445–460.
- VMCAI-2004-Harel #challenge #modelling #multi #towards
- A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal (DH), pp. 323–324.
- KDD-2003-KorenH #clustering #visualisation
- A two-way visualization method for clustered data (YK, DH), pp. 589–594.
- ICGT-2002-Harel #behaviour #requirements #why
- Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?) (DH), pp. 6–7.
- IFM-2002-GeryHP #development #lifecycle #modelling #named
- Rhapsody: A Complete Life-Cycle Model-Based Development System (EG, DH, EP), pp. 1–10.
- OOPSLA-2002-MarellyHK #execution #multi #sequence chart
- Multiple instances and symbolic variables in executable sequence charts (RM, DH, HK), pp. 83–100.
- KDD-2001-HarelK #clustering #random #using
- Clustering spatial data using random walks (DH, YK), pp. 281–286.
- CIAA-2000-HarelK #object-oriented #specification
- Synthesizing State-Based Object Systems from LSC Specifications (DH, HK), pp. 1–33.
- CIAA-J-2000-HarelK02 #object-oriented #specification
- Synthesizing State-Based Object Systems from LSC Specifications (DH, HK), pp. 5–51.
- FASE-2000-Harel
- From Play-In Scenarios to Code: An Achievable Dream (DH), pp. 22–34.
- TOOLS-USA-2000-HarelK #behaviour #inheritance #on the
- On the Behavioral Inheritance of State-Based Objects (DH, OK), pp. 83–94.
- CAV-1997-Harel #years after
- Some Thoughts on Statecharts, 13 Years Later (DH), pp. 226–231.
- ICALP-1997-HarelS #logic #process
- Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version) (DH, ES), pp. 408–418.
- RE-1997-Harel
- Will I Be Pretty, Will I Be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (DH), p. 184–?.
- TOOLS-USA-1997-CoplienGHM
- Keynotes (JC, JYG, DH, BM), p. 2.
- ICSE-1996-HarelG #execution #modelling
- Executable Object Modeling with Statecharts (DH, EG), pp. 246–257.
- LICS-1996-HirstH #complexity #recursion
- More About Recursive Structures: Descriptive Complexity and Zero-One Laws (TH, DH), pp. 334–347.
- ICALP-1994-GlobermanH #automaton #complexity #logic #multi
- Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.
- PODS-1994-Harel
- Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (DH), pp. 1–3.
- ESEC-1993-Harel
- Computers are not Omnipotent (DH), p. 10.
- PODS-1993-HirstH #database #recursion
- Completeness Results for Recursive Data Bases (TH, DH), pp. 244–252.
- STOC-1991-Harel #graph #infinity
- Hamiltonian Paths in Infinite Graphs (DH), pp. 220–229.
- CLP-1990-Harel90 #how #question #source code
- How Hard Is It to Reason about Propositional Programs? (DH), pp. 772–773.
- LICS-1990-HarelRV #bound #concurrent #on the #power of #reasoning #source code
- On the Power of Bounded Concurrency~III: Reasoning About Programs (DH, RR, MYV), pp. 478–488.
- ICSE-1988-HarelLNPPSS #development
- STATEMATE; A Working Environment for the Development of Complex Reactive Systems (DH, HL, AN, AP, MP, RS, AST), pp. 396–406.
- LICS-1987-HarelPSS #on the #semantics
- On the Formal Semantics of Statecharts (DH, AP, JPS, RS), pp. 54–64.
- STOC-1984-Harel #infinity
- A General Result on Infinite Trees and Its Applications (DH), pp. 418–427.
- ICALP-1982-HarelK #induction #programming language #set
- A Programming Language for the Inductive Sets, and Applications (DH, DK), pp. 313–329.
- PODS-1982-ChandraH #fixpoint #horn clause #query
- Horn Clauses and the Fixpoint Query Hierarchy (AKC, DH), pp. 158–163.
- POPL-1982-ShermanPH #logic #process
- Is the Interesting Part of Process Logic Uninteresting — A Translation from PL to PDL (RS, AP, DH), pp. 347–360.
- STOC-1982-FeldmanH #logic #probability
- A Probabilistic Dynamic Logic (YAF, DH), pp. 181–195.
- POPL-1979-Harel #logic #recursion #source code
- Recursion in Logics of Programs (DH), pp. 81–92.
- STOC-1979-ChandraH #database #query #relational
- Computable Queries for Relational Data Bases (AKC, DH), pp. 309–318.
- ICALP-1978-Harel #logic #source code
- Arithmetical Completeness in Logics of Programs (DH), pp. 268–288.
- POPL-1978-HarelP #logic #nondeterminism #source code
- Nondeterminism in Logics of Programs (DH, VRP), pp. 203–213.
- STOC-1977-HarelMP #logic #source code
- Computability and Completeness in Logics of Programs (DH, ARM, VRP), pp. 261–268.
- STOC-1977-HarelPS #axiom #deduction #proving #recursion #source code
- A Complete Axiomatic System for Proving Deductions about Recursive Programs (DH, AP, JS), pp. 249–260.