David Harel

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On the complexity of verifying concurrent transition systems
CONCUR '97: Concurrency Theory
2023-05-17Paper
Computational Music Therapy
Mathematics and Computation in Music
2019-10-17Paper
Complexity results for multi-pebble automata and their logics
Automata, Languages and Programming
2019-04-29Paper
Computation paths logic: an expressive, yet elementary, process logic
Automata, Languages and Programming
2018-07-04Paper
On the succinctness of idioms for concurrent programming2017-09-12Paper
Estimating the size of the olfactory repertoire
Bulletin of Mathematical Biology
2015-10-27Paper
Modal scenarios as automata
Lecture Notes in Computer Science
2015-02-10Paper
Relaxing synchronization constraints in behavioral programs
Logic for Programming, Artificial Intelligence, and Reasoning
2014-01-17Paper
Concurrency in biological modeling: behavior, execution and visualization
Electronic Notes in Theoretical Computer Science
2014-01-17Paper
Standing on the shoulders of a giant. One person's experience of Turing's impact (Summary of the Alan M. Turing lecture)
Automata, Languages, and Programming
2012-11-01Paper
Synthesis from scenario-based specifications
Journal of Computer and System Sciences
2012-08-17Paper
Executable modeling of morphogenesis: A Turing-inspired approach
Fundamenta Informaticae
2012-08-01Paper
Dexter Kozen: A Winning Combination of Brilliance, Depth, and Elegance
Logic and Program Semantics
2012-07-16Paper
Multi-modal scenarios revisited: a net-based representation
Theoretical Computer Science
2012-05-30Paper
Algorithmics. The spirit of computing2012-02-01Paper
Amir Pnueli -- A gentle giant: Lord of the \(\varphi \)'s and the \(\psi \)'s
Formal Aspects of Computing
2010-12-17Paper
On the power of play-out for scenario-based programs
Concurrency, Compositionality, and Correctness
2010-03-09Paper
scientific article; zbMATH DE number 5628596 (Why is no real title available?)2009-11-10Paper
Graph Drawing
Lecture Notes in Computer Science
2009-08-11Paper
How hard is smart play-out? On the complexity of verification-driven execution2009-07-27Paper
Some Results on the Expressive Power and Complexity of LSCs
Pillars of Computer Science
2008-03-25Paper
GemCell: A generic platform for modeling multi-cellular biological systems
Theoretical Computer Science
2008-03-06Paper
Algorithmics. The spirit of computing. Preface for the Italian edition by Carlo Ghezzi.2008-01-30Paper
Algorithmik2007-06-12Paper
Algorithmics. The spirit of computing2007-06-12Paper
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science
2006-10-10Paper
Graph Drawing by High-Dimensional Embedding
Journal of Graph Algorithms and Applications
2006-04-03Paper
InterPlay: Horizontal scale-up and transition to design in scenario-based programming
Lecture Notes in Computer Science
2005-12-23Paper
Combining state-based and scenario-based approaches in modeling biological systems
Lecture Notes in Computer Science
2005-12-23Paper
Synthesis revisited: Generating statechart models from scenario-based requirements
Lecture Notes in Computer Science
2005-12-02Paper
Temporal logic for scenario-based specifications
Lecture Notes in Computer Science
2005-11-10Paper
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry
2005-11-07Paper
SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS
International Journal of Foundations of Computer Science
2005-06-22Paper
scientific article; zbMATH DE number 2156289 (Why is no real title available?)2005-04-15Paper
Rhapsody: A complete life-cycle model-based development system
Lecture Notes in Computer Science
2004-08-11Paper
A fast multi-scale method for drawing large graphs
Lecture Notes in Computer Science
2004-08-04Paper
On clustering using random walks
Lecture Notes in Computer Science
2004-08-04Paper
Drawing Huge Graphs by Algebraic Multigrid Optimization
Multiscale Modeling & Simulation
2004-03-17Paper
Can behavioral requirements be executed? (And why would we want to do so?)
Lecture Notes in Computer Science
2003-12-14Paper
Can behavioral requirements be executed? (And why would we want to do so?)
Lecture Notes in Computer Science
2003-12-10Paper
Towards an odor communication system.
Computational Biology and Chemistry
2003-11-20Paper
Smart play-out of behavioral requirements
Lecture Notes in Computer Science
2003-09-14Paper
Drawing directed graphs using one-dimensional optimization
Lecture Notes in Computer Science
2003-09-03Paper
Graph drawing by high-dimensional embedding
Lecture Notes in Computer Science
2003-09-03Paper
A grand challenge: Full reactive modeling of a multi-cellular animal
Lecture Notes in Computer Science
2003-07-30Paper
A multi-scale algorithm for the linear arrangement problem2003-07-25Paper
Formal modeling of C. elegans development: A scenario-based approach
Lecture Notes in Computer Science
2003-07-17Paper
A Fast Multi-Scale Method for Drawing Large Graphs
Journal of Graph Algorithms and Applications
2003-06-23Paper
scientific article; zbMATH DE number 1852915 (Why is no real title available?)2003-01-29Paper
On the complexity of verifying concurrent transition systems
Information and Computation
2003-01-14Paper
An algorithm for straight-line drawing of planar graphs
Algorithmica
2002-09-02Paper
Synthesizing state-based object systems from LSC specifications
Lecture Notes in Computer Science
2002-07-28Paper
An algorithm for blob hierarchy layout
The Visual Computer
2002-07-25Paper
LSCs: Breathing life into message sequence charts
Formal Methods in System Design
2002-05-21Paper
A multi-scale algorithm for drawing graphs nicely
Discrete Applied Mathematics
2002-03-18Paper
Computers Ltd. What they really can't do2001-11-18Paper
Computers Ltd. What they really can't do2001-11-13Paper
Towards a theory of recursive structures2001-10-23Paper
scientific article; zbMATH DE number 1556014 (Why is no real title available?)2001-01-24Paper
Towards a theory of recursive structures2000-03-16Paper
Computation paths logic: An expressive, yet elementary, process logic
Annals of Pure and Applied Logic
1999-07-20Paper
scientific article; zbMATH DE number 1032009 (Why is no real title available?)1997-07-08Paper
Taking it to the limit: On infinite variants of NP-complete problems
Journal of Computer and System Sciences
1997-03-13Paper
Complexity results for two-way and multi-pebble automata and their logics
Theoretical Computer Science
1997-02-27Paper
More on nonregular PDL: Finite models and Fibonacci-like programs
Information and Computation
1997-02-03Paper
Completeness results for recursive data bases
Journal of Computer and System Sciences
1996-11-26Paper
On the solvability of domino snake problems
Theoretical Computer Science
1995-03-15Paper
On the power of bounded concurrency I
Journal of the ACM
1994-10-13Paper
On the power of bounded concurrency II
Journal of the ACM
1994-10-13Paper
Deciding emptiness for stack automata on infinite trees
Information and Computation
1994-09-13Paper
Deciding Properties of Nonregular Programs
SIAM Journal on Computing
1993-10-10Paper
scientific article; zbMATH DE number 194513 (Why is no real title available?)1993-06-05Paper
On the power of bounded concurrency. II: The pushdown automata level
Lecture Notes in Computer Science
1993-02-21Paper
Hamiltonian paths in infinite graphs
Israel Journal of Mathematics
1992-12-09Paper
scientific article; zbMATH DE number 53101 (Why is no real title available?)1992-09-18Paper
scientific article; zbMATH DE number 17792 (Why is no real title available?)
Lecture Notes in Computer Science
1992-06-26Paper
scientific article; zbMATH DE number 4085029 (Why is no real title available?)1988-01-01Paper
Statecharts: a visual formalism for complex systems
Science of Computer Programming
1987-01-01Paper
scientific article; zbMATH DE number 3965428 (Why is no real title available?)1986-01-01Paper
Process logic with regular formulas
Theoretical Computer Science
1985-01-01Paper
More on looping vs. repeating in dynamic logic
Information Processing Letters
1985-01-01Paper
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
Topics in the Theory of Computation, Selected Papers of the International Conference on ‘Foundations of Computation Theory’, FCT '83
1985-01-01Paper
Propositional dynamic logic of flowcharts
Information and Control
1985-01-01Paper
scientific article; zbMATH DE number 3930354 (Why is no real title available?)1985-01-01Paper
Horn clause queries and generalizations
The Journal of Logic Programming
1985-01-01Paper
Is the Interesting Part of Process Logic uninteresting?: A Translation from PL to PDL
SIAM Journal on Computing
1984-01-01Paper
On static logics, dynamic logics, and complexity classes
Information and Control
1984-01-01Paper
A programming language for the inductive sets, and applications
Information and Control
1984-01-01Paper
A probabilistic dynamic logic
Journal of Computer and System Sciences
1984-01-01Paper
Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
Journal of Computer and System Sciences
1984-01-01Paper
scientific article; zbMATH DE number 3843130 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3848600 (Why is no real title available?)1983-01-01Paper
Propositional dynamic logic of nonregular programs
Journal of Computer and System Sciences
1983-01-01Paper
Process logic: Expressiveness, decidability, completeness
Journal of Computer and System Sciences
1982-01-01Paper
Structure and complexity of relational queries
Journal of Computer and System Sciences
1982-01-01Paper
Looping vs. repeating in dynamic logic
Information and Control
1982-01-01Paper
scientific article; zbMATH DE number 3772937 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3791600 (Why is no real title available?)
DAIMI Report Series
1982-01-01Paper
On the total correctness of nondeterministic programs
Theoretical Computer Science
1981-01-01Paper
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
Theoretical Computer Science
1980-01-01Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: David Harel