Person:209473: Difference between revisions

From MaRDI portal
Person:209473
Created automatically from import230922100944
 
m AuthorDisambiguator moved page David Harel to David Harel: Duplicate
 
(No difference)

Latest revision as of 08:28, 9 December 2023

Available identifiers

zbMath Open harel.davidDBLPh/DavidHarelWikidataQ2920599 ScholiaQ2920599MaRDI QIDQ209473

List of research outcomes





PublicationDate of PublicationType
On the complexity of verifying concurrent transition systems2023-05-17Paper
Computational Music Therapy2019-10-17Paper
Complexity results for multi-pebble automata and their logics2019-04-29Paper
Computation paths logic: An expressive, yet elementary, process logic2018-07-04Paper
On the Succinctness of Idioms for Concurrent Programming2017-09-12Paper
Estimating the size of the olfactory repertoire2015-10-27Paper
Modal Scenarios as Automata2015-02-10Paper
Relaxing Synchronization Constraints in Behavioral Programs2014-01-17Paper
Concurrency in Biological Modeling: Behavior, Execution and Visualization2014-01-17Paper
Standing on the Shoulders of a Giant2012-11-01Paper
Synthesis from scenario-based specifications2012-08-17Paper
https://portal.mardi4nfdi.de/entity/Q29037752012-08-01Paper
Dexter Kozen: A Winning Combination of Brilliance, Depth, and Elegance2012-07-16Paper
Multi-modal scenarios revisited: a net-based representation2012-05-30Paper
https://portal.mardi4nfdi.de/entity/Q31142032012-02-01Paper
Amir Pnueli -- A gentle giant: Lord of the \(\varphi \)'s and the \(\psi \)'s2010-12-17Paper
On the Power of Play-Out for Scenario-Based Programs2010-03-09Paper
https://portal.mardi4nfdi.de/entity/Q36429612009-11-10Paper
Graph Drawing2009-08-11Paper
https://portal.mardi4nfdi.de/entity/Q51907802009-07-27Paper
Some Results on the Expressive Power and Complexity of LSCs2008-03-25Paper
GemCell: A generic platform for modeling multi-cellular biological systems2008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54400362008-01-30Paper
Algorithmik2007-06-12Paper
https://portal.mardi4nfdi.de/entity/Q34456732007-06-12Paper
Automated Technology for Verification and Analysis2006-10-10Paper
Graph Drawing by High-Dimensional Embedding2006-04-03Paper
Lectures on Concurrency and Petri Nets2005-12-23Paper
Computational Methods in Systems Biology2005-12-23Paper
Formal Methods in Software and Systems Modeling2005-12-02Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
One-dimensional layout optimization, with applications to graph drawing by axis separation2005-11-07Paper
SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS2005-06-22Paper
https://portal.mardi4nfdi.de/entity/Q46687472005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q47375482004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44723062004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44742042004-08-04Paper
Drawing Huge Graphs by Algebraic Multigrid Optimization2004-03-17Paper
https://portal.mardi4nfdi.de/entity/Q44395552003-12-14Paper
https://portal.mardi4nfdi.de/entity/Q44387602003-12-10Paper
Towards an odor communication system.2003-11-20Paper
https://portal.mardi4nfdi.de/entity/Q44279182003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44222762003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44222772003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44179702003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44145062003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44132012003-07-17Paper
A Fast Multi-Scale Method for Drawing Large Graphs2003-06-23Paper
https://portal.mardi4nfdi.de/entity/Q47894452003-01-29Paper
On the complexity of verifying concurrent transition systems2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45409542002-07-28Paper
An algorithm for blob hierarchy layout2002-07-25Paper
LSCs: Breathing life into message sequence charts2002-05-21Paper
A multi-scale algorithm for drawing graphs nicely2002-03-18Paper
https://portal.mardi4nfdi.de/entity/Q27566132001-11-18Paper
https://portal.mardi4nfdi.de/entity/Q27565112001-11-13Paper
https://portal.mardi4nfdi.de/entity/Q42180932001-10-23Paper
https://portal.mardi4nfdi.de/entity/Q45257812001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49426332000-03-16Paper
Computation paths logic: An expressive, yet elementary, process logic1999-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43439901997-07-08Paper
Taking it to the limit: On infinite variants of NP-complete problems1997-03-13Paper
Complexity results for two-way and multi-pebble automata and their logics1997-02-27Paper
More on nonregular PDL: Finite models and Fibonacci-like programs1997-02-03Paper
Completeness results for recursive data bases1996-11-26Paper
On the solvability of domino snake problems1995-03-15Paper
On the power of bounded concurrency I1994-10-13Paper
On the power of bounded concurrency II1994-10-13Paper
Deciding emptiness for stack automata on infinite trees1994-09-13Paper
Deciding Properties of Nonregular Programs1993-10-10Paper
https://portal.mardi4nfdi.de/entity/Q46924701993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40276161993-02-21Paper
Hamiltonian paths in infinite graphs1992-12-09Paper
https://portal.mardi4nfdi.de/entity/Q40033571992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q39751341992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q38148131988-01-01Paper
Statecharts: a visual formalism for complex systems1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37329491986-01-01Paper
Process logic with regular formulas1985-01-01Paper
More on looping vs. repeating in dynamic logic1985-01-01Paper
Recurring Dominoes: Making the Highly Undecidable Highly Understandable1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37032991985-01-01Paper
Horn clause queries and generalizations1985-01-01Paper
A probabilistic dynamic logic1984-01-01Paper
On static logics, dynamic logics, and complexity classes1984-01-01Paper
A programming language for the inductive sets, and applications1984-01-01Paper
Propositional dynamic logic of nonregular programs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33132531983-01-01Paper
Process logic: Expressiveness, decidability, completeness1982-01-01Paper
Structure and complexity of relational queries1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39531591982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39684521982-01-01Paper
On the total correctness of nondeterministic programs1981-01-01Paper
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic1980-01-01Paper
Computable queries for relational data bases1980-01-01Paper
On folk theorems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38933091980-01-01Paper
And/Or Programs: A New Approach to Structured Programming1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39423661980-01-01Paper
Two results on process logic1979-01-01Paper
First-order dynamic logic1979-01-01Paper
Characterizing Second Order Logic with First Order Quantifiers1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41603821978-01-01Paper

Research outcomes over time

This page was built for person: David Harel