The following pages link to Orna Kupferman (Q216121):
Displaying 50 items.
- Sensing as a Complexity Measure (Q5205034) (← links)
- A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
- Playing with the Maximum-Flow Problem (Q5222943) (← links)
- LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems (Q5222965) (← links)
- Alternating Reachability Games with Behavioral and Revenue Objectives (Q5222974) (← links)
- Congestion games with multisets of resources and applications in synthesis (Q5275380) (← links)
- The sensing cost of monitoring and synthesis (Q5275381) (← links)
- From linear time to branching time (Q5277722) (← links)
- What causes a system to satisfy a specification? (Q5277809) (← links)
- High-Quality Synthesis Against Stochastic Environments (Q5278414) (← links)
- Verification: Theory and Practice (Q5305663) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308436) (← links)
- STACS 2004 (Q5309728) (← links)
- Formalizing and Reasoning about Quality (Q5327419) (← links)
- Nondeterminism in the Presence of a Diverse or Unknown Future (Q5327425) (← links)
- On relative and probabilistic finite counterability (Q5351957) (← links)
- (Q5357713) (← links)
- An automata-theoretic approach to branching-time model checking (Q5385339) (← links)
- On Locally Checkable Properties (Q5387900) (← links)
- Automated Technology for Verification and Analysis (Q5394176) (← links)
- Automated Technology for Verification and Analysis (Q5394199) (← links)
- Network-Formation Games with Regular Objectives (Q5410668) (← links)
- Latticed-LTL Synthesis in the Presence of Noisy Inputs (Q5410675) (← links)
- From Liveness to Promptness (Q5429333) (← links)
- Leaping Loops in the Presence of Abstraction (Q5429340) (← links)
- (Q5447366) (← links)
- Lattice Automata (Q5452607) (← links)
- Better Under-Approximation of Programs by Hiding Variables (Q5452617) (← links)
- On Verifying Fault Tolerance of Distributed Protocols (Q5458335) (← links)
- Vacuity in Testing (Q5458808) (← links)
- BÜCHI COMPLEMENTATION MADE TIGHTER (Q5484906) (← links)
- TYPENESS FOR ω-REGULAR AUTOMATA (Q5484907) (← links)
- Correct Hardware Design and Verification Methods (Q5493215) (← links)
- Correct Hardware Design and Verification Methods (Q5493227) (← links)
- Discounting in LTL (Q5498739) (← links)
- On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata (Q5505553) (← links)
- (Q5692280) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703760) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705922) (← links)
- Computer Aided Verification (Q5716599) (← links)
- On High-Quality Synthesis (Q5740173) (← links)
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words (Q5756590) (← links)
- Sanity Checks in Formal Verification (Q5756614) (← links)
- Safraless Compositional Synthesis (Q5756733) (← links)
- (Q5874196) (← links)
- (Q5875386) (← links)
- Minimizing Deterministic Lattice Automata (Q5892175) (← links)
- Minimizing Deterministic Lattice Automata (Q5892494) (← links)
- Correct Hardware Design and Verification Methods (Q5897059) (← links)
- Correct Hardware Design and Verification Methods (Q5897060) (← links)
