The following pages link to Thomas A. Henzinger (Q355505):
Displayed 50 items.
- (Q2722062) (← links)
- (Q2754083) (← links)
- Expressiveness and Closure Properties for Quantitative Languages (Q2786127) (← links)
- Lipschitz Robustness of Timed I/O Systems (Q2796054) (← links)
- Abstraction-driven Concolic Testing (Q2796059) (← links)
- Segment Abstraction for Worst-Case Execution Time Analysis (Q2802432) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Succinct Representation of Concurrent Trace Sets (Q2819829) (← links)
- PSync: a partially synchronous language for fault-tolerant distributed algorithms (Q2828285) (← links)
- Aspect-Oriented Linearizability Proofs (Q2842111) (← links)
- From Model Checking to Model Measuring (Q2842114) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- (Q2908881) (← links)
- (Q2915675) (← links)
- Quantitative abstraction refinement (Q2931788) (← links)
- Quantitative relaxation of concurrent data structures (Q2931807) (← links)
- A Logic-Based Framework for Verifying Consensus Algorithms (Q2938065) (← links)
- Finitary winning in ω-regular games (Q2946587) (← links)
- Quantitative languages (Q2946611) (← links)
- Qualitative concurrent parity games (Q2946647) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- (Q2957513) (← links)
- (Q2958505) (← links)
- (Q2978533) (← links)
- Model measuring for hybrid systems (Q2986968) (← links)
- Scalable Static Hybridization Methods for Analysis of Nonlinear Systems (Q2988975) (← links)
- QUASY: Quantitative Synthesis Tool (Q3000655) (← links)
- The Complexity of Request-Response Games (Q3004582) (← links)
- FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS (Q3016219) (← links)
- ABC: Algebraic Bound Computation for Loops (Q3066094) (← links)
- Dynamic Reactive Modules (Q3090845) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Stochastic Games with Finitary Objectives (Q3182912) (← links)
- Alternating Weighted Automata (Q3183592) (← links)
- Probabilistic Weighted Automata (Q3184677) (← links)
- Proving non-termination (Q3189834) (← links)
- Counterexample-Guided Refinement of Template Polyhedra (Q3303915) (← links)
- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults (Q3303928) (← links)
- Edit Distance for Pushdown Automata (Q3449470) (← links)
- Abstractions from proofs (Q3452263) (← links)
- Alternating-time temporal logic (Q3455546) (← links)
- Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions (Q3506862) (← links)
- Timed Alternating-Time Temporal Logic (Q3511218) (← links)
- Value Iteration (Q3512436) (← links)
- Controller Synthesis with Budget Constraints (Q3523099) (← links)
- Trading Infinite Memory for Uniform Randomness in Timed Games (Q3523100) (← links)
- Strategy Logic (Q3525629) (← links)
- EQUIVALENCE OF LABELED MARKOV CHAINS (Q3538849) (← links)
- Quantitative Languages (Q3540192) (← links)
- Permissiveness in Transactional Memories (Q3540238) (← links)