The following pages link to David Harel (Q209473):
Displaying 50 items.
- Multi-modal scenarios revisited: a net-based representation (Q418770) (← links)
- Synthesis from scenario-based specifications (Q439960) (← links)
- Amir Pnueli -- A gentle giant: Lord of the \(\varphi \)'s and the \(\psi \)'s (Q613140) (← links)
- Two results on process logic (Q755290) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- A probabilistic dynamic logic (Q792757) (← links)
- Estimating the size of the olfactory repertoire (Q886911) (← links)
- (Q1062046) (redirect page) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Statecharts: a visual formalism for complex systems (Q1098612) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- On the total correctness of nondeterministic programs (Q1143163) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- Hamiltonian paths in infinite graphs (Q1196345) (← links)
- First-order dynamic logic (Q1255942) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- Deciding emptiness for stack automata on infinite trees (Q1333263) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- Towards an odor communication system. (Q1414287) (← links)
- An algorithm for blob hierarchy layout (Q1606754) (← links)
- Taking it to the limit: On infinite variants of NP-complete problems (Q1816727) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- More on nonregular PDL: Finite models and Fibonacci-like programs (Q1923105) (← links)
- Completeness results for recursive data bases (Q1924386) (← links)
- More on looping vs. repeating in dynamic logic (Q2265813) (← links)
- GemCell: A generic platform for modeling multi-cellular biological systems (Q2474439) (← links)
- One-dimensional layout optimization, with applications to graph drawing by axis separation (Q2573337) (← links)
- (Q2756511) (← links)
- (Q2756613) (← links)
- Relaxing Synchronization Constraints in Behavioral Programs (Q2870140) (← links)
- Concurrency in Biological Modeling: Behavior, Execution and Visualization (Q2870303) (← links)
- Dexter Kozen: A Winning Combination of Brilliance, Depth, and Elegance (Q2897965) (← links)
- (Q2903775) (← links)
- SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS (Q3021937) (← links)
- (Q3114203) (← links)
- Deciding Properties of Nonregular Programs (Q3137712) (← links)
- Standing on the Shoulders of a Giant (Q3166994) (← links)
- (Q3313253) (← links)
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Q3313255) (← links)
- Graph Drawing by High-Dimensional Embedding (Q3378493) (← links)
- Algorithmik (Q3445585) (← links)
- (Q3445673) (← links)
- (Q3642961) (← links)
- (Q3703299) (← links)
- Horn clause queries and generalizations (Q3706528) (← links)
- On static logics, dynamic logics, and complexity classes (Q3718149) (← links)
- A programming language for the inductive sets, and applications (Q3719820) (← links)
