The following pages link to Mahesh Viswanathan (Q650913):
Displaying 50 items.
- Specifications for decidable hybrid games (Q650914) (← links)
- Deciding branching time properties for asynchronous programs (Q732003) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Spot-checkers (Q1577018) (← links)
- Java-MaC: A run-time assurance approach for Java programs (Q1878917) (← links)
- Modelchecking safety properties in randomized security protocols (Q2037999) (← links)
- \textsc{DryVR}: data-driven verification and compositional reasoning for automotive systems (Q2151266) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- Decidable synthesis of programs with uninterpreted functions (Q2226763) (← links)
- A decidable class of planar linear hybrid systems (Q2257303) (← links)
- Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\) (Q2272912) (← links)
- Hybridization based CEGAR for hybrid automata with affine dynamics (Q2272936) (← links)
- Statistical verification of PCTL using antithetic and stratified samples (Q2335899) (← links)
- Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- (Q2921787) (← links)
- Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems (Q2926638) (← links)
- Probabilistic Automata for Safety LTL Specifications (Q2938064) (← links)
- Deciding Concurrent Planar Monotonic Linear Hybrid Systems (Q2945600) (← links)
- A counterexample-guided abstraction-refinement framework for markov decision processes (Q2946618) (← links)
- A dynamic algorithm for approximate flow computations (Q2986721) (← links)
- Pre-orders for reasoning about stability (Q2986767) (← links)
- On the decidability of stability of hybrid systems (Q2986910) (← links)
- Statistical verification of dynamical systems using set oriented methods (Q2988933) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- On Convergence of Concurrent Systems under Regular Interactions (Q3184697) (← links)
- Revisiting MITL to Fix Decision Procedures (Q3296347) (← links)
- Optimal Translation of LTL to Limit Deterministic Automata (Q3303923) (← links)
- STORMED Hybrid Systems (Q3519497) (← links)
- A Decidable Class of Planar Linear Hybrid Systems (Q3523124) (← links)
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage (Q3525634) (← links)
- Propositional Tree Automata (Q3527283) (← links)
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions (Q3541023) (← links)
- STORMED Hybrid Games (Q3624600) (← links)
- Complexity Bounds for the Verification of Real-Time Software (Q3656878) (← links)
- (Q4267798) (← links)
- (Q4447254) (← links)
- (Q4535066) (← links)
- (Q4542544) (← links)
- Parsimonious, Simulation Based Verification of Linear Systems (Q4633548) (← links)
- An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams (Q4785634) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- (Q5079756) (← links)
- Controller Synthesis for Linear System With Reach-Avoid Specifications (Q5092060) (← links)
- Complexity of model checking MDPs against LTL specifications (Q5136327) (← links)
- The Complexity of Dynamic Data Race Prediction (Q5145675) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
- Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars (Q5194920) (← links)
- Robust Model Checking of Timed Automata under Clock Drifts (Q5275328) (← links)
- Stability Analysis of Switched Linear Systems Defined by Regular Languages (Q5280442) (← links)
