The following pages link to Rajeev Alur (Q294639):
Displaying 50 items.
- (Q202461) (redirect page) (← links)
- Undecidability of partial order logics (Q294640) (← links)
- Optimal paths in weighted timed automata (Q596026) (← links)
- The algorithmic analysis of hybrid systems (Q673868) (← links)
- Model-checking in dense real-time (Q689092) (← links)
- Real-time logics: Complexity and expressiveness (Q689093) (← links)
- Verisig 2.0: verification of neural network controllers using Taylor model preconditioning (Q832173) (← links)
- Dispatch sequences for embedded control models (Q858316) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- Event-clock automata: a determinizable class of timed automata (Q1274452) (← links)
- A theory of timed automata (Q1322162) (← links)
- Compositional and symbolic synthesis of reactive controllers for multi-agent systems (Q1641032) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- Deciding global partial-order properties (Q1774565) (← links)
- Model-checking of correctness conditions for concurrent objects (Q1854357) (← links)
- Real-time system = discrete system + clock variables (Q1856191) (← links)
- Polyhedral flows in hybrid automata (Q1878924) (← links)
- Timing verification by successive approximation (Q1891141) (← links)
- Contention-free complexity of shared memory algorithms (Q1917094) (← links)
- Colored nested words (Q2149962) (← links)
- Streamable regular transductions (Q2286735) (← links)
- Compositional modeling and refinement for hierarchical hybrid systems (Q2368695) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- Counterexample-guided predicate abstraction of hybrid systems (Q2368954) (← links)
- (Q2754091) (← links)
- Colored Nested Words (Q2798716) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Time-adaptive algorithms for synchronization (Q2817676) (← links)
- DReX (Q2819796) (← links)
- (Q2845509) (← links)
- Expressiveness of Streaming String Transducers (Q2908833) (← links)
- Algorithmic analysis of array-accessing programs (Q2946676) (← links)
- Optimal scheduling for constant-rate multi-mode systems (Q2986754) (← links)
- Regular Transformations of Infinite Strings (Q2986782) (← links)
- Safe schedulability of bounded-rate multi-mode systems (Q2986930) (← links)
- Compositional Synthesis with Parametric Reactive Controllers (Q2988986) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- Streaming Tree Transducers (Q3166998) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Scaling Enumerative Program Synthesis via Divide and Conquer (Q3303902) (← links)
- Adding nesting structure to words (Q3452213) (← links)
- Alternating-time temporal logic (Q3455546) (← links)
- Marrying Words and Trees (Q3499762) (← links)
- Model Checking: From Tools to Theory (Q3512435) (← links)
- Ranking Automata and Games for Prioritized Requirements (Q3512497) (← links)
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition (Q3522908) (← links)
- Parametric temporal logic for “model measuring” (Q3549124) (← links)
- Verification and Integration of Real-Time Control Software (Q3564014) (← links)
- Visibly pushdown languages (Q3580970) (← links)
- Preserving Secrecy Under Refinement (Q3591420) (← links)
