The following pages link to Rupak Majumdar (Q453531):
Displayed 50 items.
- Bounded underapproximations (Q453533) (← links)
- Verification of population protocols (Q523133) (← links)
- Dynamic Bayesian networks for formal verification of structured stochastic processes (Q523135) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- Stochastic limit-average games are in EXPTIME (Q933752) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Dynamic hierarchical reactive controller synthesis (Q1693821) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Quantitative solution of omega-regular games (Q1887716) (← links)
- Symbolic model checking for factored probabilistic models (Q1990523) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- On the relation between reactive synthesis and supervisory control of non-terminating processes (Q2177781) (← links)
- Code aware resource management (Q2248054) (← links)
- Safety verification of continuous-space pure jump Markov processes (Q2272916) (← links)
- Probabilistic \(\mathrm{CTL}^*\): the deductive way (Q2272920) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Backstepping controller synthesis and characterizations of incremental stability (Q2439154) (← links)
- Model checking discounted temporal properties (Q2575738) (← links)
- (Q2722062) (← links)
- Algorithms for Game Metrics (Q2786130) (← links)
- Analysis of Asynchronous Programs with Event-Based Synchronization (Q2802452) (← links)
- THE COMPLEXITY OF COVERAGE (Q2841992) (← links)
- Expand, Enlarge, and Check for Branching Vector Addition Systems (Q2842103) (← links)
- A Theory of Name Boundedness (Q2842106) (← links)
- DISCOUNTING AND AVERAGING IN GAMES ACROSS TIME SCALES (Q2909220) (← links)
- An SMT-Based Approach to Coverability Analysis (Q2920990) (← links)
- A Theory of Partitioned Global Address Spaces (Q2963905) (← links)
- Symbolic Control of Stochastic Systems via Approximately Bisimilar Finite Abstractions (Q2982915) (← links)
- Towards Robustness for Cyber-Physical Systems (Q2982916) (← links)
- Robust discrete synthesis against unspecified disturbances (Q2986731) (← links)
- A Perfect Model for Bounded Verification (Q2986805) (← links)
- Edit distance for timed automata (Q2986983) (← links)
- Dynamic scheduling for networked control systems (Q2988921) (← links)
- Computing the Skorokhod distance between polygonal traces (Q2988939) (← links)
- Computing Distances between Reach Flowpipes (Q2988992) (← links)
- Algorithms for Game Metrics (Q3165951) (← links)
- Minimum Attention Controller Synthesis for Omega-Regular Objectives (Q3172849) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Parameterized Verification of Asynchronous Shared-Memory Systems (Q3177767) (← links)
- Interprocedural analysis of asynchronous programs (Q3189813) (← links)
- Proving non-termination (Q3189834) (← links)
- Bounds on Mobility (Q3190129) (← links)
- Lazy Abstraction-Based Controller Synthesis (Q3297583) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- Abstractions from proofs (Q3452263) (← links)
- Controller Synthesis with Budget Constraints (Q3523099) (← links)
- Game Refinement Relations and Metrics (Q3535612) (← links)
- Structural Invariants (Q3613379) (← links)
- Verifying Reference Counting Implementations (Q3617768) (← links)
- Analyzing Real-Time Event-Driven Programs (Q3648830) (← links)