The following pages link to Moshe Y. Vardi (Q208771):
Displaying 50 items.
- On satisficing in quantitative games (Q2044188) (← links)
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking (Q2046017) (← links)
- Satisfiability checking for mission-time \textsf{LTL} (MLTL) (Q2105410) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Verification (Q2244833) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- First-order vs. second-order encodings for \textsc{ltl}\(_f\)-to-automata translation (Q2327515) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- GSTE is partitioned model checking (Q2385196) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- Temporal property verification as a program analysis task (Q2441713) (← links)
- Optimized temporal monitors for SystemcC (Q2441724) (← links)
- Aggregating disparate estimates of chance (Q2466865) (← links)
- First-order logic with two variables and unary temporal logic (Q2506493) (← links)
- From complementation to certification (Q2575735) (← links)
- Relating word and tree automata (Q2576943) (← links)
- On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
- (Q2741533) (← links)
- (Q2754072) (← links)
- (Q2754101) (← links)
- (Q2769435) (← links)
- (Q2769612) (← links)
- (Q2771059) (← links)
- (Q2771062) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- (Q2849589) (← links)
- B\"uchi Complementation and Size-Change Termination (Q2881080) (← links)
- Synthesizing Probabilistic Composers (Q2892787) (← links)
- (Q2908844) (← links)
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic (Q2914371) (← links)
- Unifying Büchi Complementation Constructions. (Q2915686) (← links)
- Synthesis from Probabilistic Components. (Q2915699) (← links)
- State of B\"uchi Complementation (Q2938766) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Relentful strategic reasoning in alternating-time temporal logic (Q2957961) (← links)
- (Q2980973) (← links)
- Iterative temporal motion planning for hybrid systems in partially unknown environments (Q2986941) (← links)
- On Bounded Specifications (Q2996151) (← links)
- The Complexity of Integer Bound Propagation (Q2996913) (← links)
- Synthesis of Trigger Properties (Q3066106) (← links)
- Relentful Strategic Reasoning in Alternating-Time Temporal Logic (Q3066109) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- (Q3086936) (← links)
- Dynamic Reactive Modules (Q3090845) (← links)
- (Q3113724) (← links)
- Undecidable boundedness problems for datalog programs (Q3128622) (← links)
- Undecidable optimization problems for database logic programs (Q3140022) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
