Moshe Y. Vardi

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Verifying equilibria in finite-horizon probabilistic concurrent game systems
Logical Methods in Computer Science
2026-05-29Paper
Logical algorithmics: from theory to practice (invited talk)2026-02-19Paper
Engineering an \(\mathsf{LTL_f}\) synthesis tool2026-02-10Paper
Logical algorithmics: from relational queries to Boolean reasoning (invited talk)2026-02-03Paper
Automata linear dynamic logic on finite traces
Logical Methods in Computer Science
2025-09-25Paper
Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata2025-06-26Paper
Modular model checking2025-03-19Paper
On the power of automata minimization in reactive synthesis2024-12-06Paper
Logical algorithmics: from theory to practice (invited talk)2024-10-08Paper
Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
Theoretical Computer Science
2024-06-26Paper
An automata-theoretic approach to linear temporal logic2024-06-21Paper
Finite-trace and generalized-reactivity specifications in temporal synthesis
Formal Methods in System Design
2024-03-11Paper
Safety and co-safety comparator automata for discounted-sum inclusion
Computer Aided Verification
2024-02-16Paper
Satisfiability checking for mission-time LTL
Computer Aided Verification
2024-02-16Paper
ZDD Boolean synthesis2024-01-23Paper
Towards a grand unification of Büchi complementation constructions
Lecture Notes in Computer Science
2023-08-10Paper
A space-efficient on-the-fly algorithm for real-time model checking
CONCUR '96: Concurrency Theory
2023-06-28Paper
From linear temporal logics to Büchi automata: the early and simple principle
Model Checking, Synthesis, and Learning
2023-05-26Paper
On the power of finite ambiguity in Büchi complementation
Information and Computation
2023-05-19Paper
On the complexity of verifying concurrent transition systems
CONCUR '97: Concurrency Theory
2023-05-17Paper
Functional synthesis via input-output separation
Formal Methods in System Design
2023-05-08Paper
Automata vs linear-programming discounted-sum inclusion
Computer Aided Verification
2023-05-05Paper
Congruence Relations for Büchi Automata2023-04-21Paper
Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints2023-01-24Paper
Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints
(available as arXiv preprint)
2023-01-01Paper
Satisfiability checking for mission-time \textsf{LTL} (MLTL)
Information and Computation
2022-12-08Paper
Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition2022-12-07Paper
Quantum-Inspired Perfect Matching under Vertex-Color Constraints2022-09-26Paper
A nonstandard approach to the logical omniscience problem
Artificial Intelligence
2022-09-21Paper
scientific article; zbMATH DE number 7577577 (Why is no real title available?)
(available as arXiv preprint)
2022-08-30Paper
scientific article; zbMATH DE number 7577577 (Why is no real title available?)2022-08-30Paper
Sequential relational decomposition
Logical Methods in Computer Science
2022-08-02Paper
Linear temporal logic -- from infinite to finite horizon2022-06-22Paper
Adapting behaviors via reactive synthesis
(available as arXiv preprint)
2022-03-25Paper
ProCount: weighted projected model counting with graded project-join trees2022-03-22Paper
On the Unreasonable Effectiveness of SAT Solvers2022-02-04Paper
scientific article; zbMATH DE number 7455737 (Why is no real title available?)
(available as arXiv preprint)
2022-01-11Paper
scientific article; zbMATH DE number 7455737 (Why is no real title available?)2022-01-11Paper
scientific article; zbMATH DE number 7455747 (Why is no real title available?)
(available as arXiv preprint)
2022-01-11Paper
scientific article; zbMATH DE number 7455747 (Why is no real title available?)2022-01-11Paper
On the power of unambiguity in Büchi complementation
(available as arXiv preprint)
2022-01-11Paper
On the power of unambiguity in Büchi complementation2022-01-11Paper
Quantum-Inspired Perfect Matching under Vertex-Color Constraints
(available as arXiv preprint)
2022-01-01Paper
Verification2021-11-12Paper
Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
Artificial Intelligence
2021-11-02Paper
SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
Artificial Intelligence
2021-08-16Paper
On satisficing in quantitative games
(available as arXiv preprint)
2021-08-04Paper
scientific article; zbMATH DE number 7378545 (Why is no real title available?)2021-08-04Paper
Profile trees for Büchi word automata, with application to determinization2021-06-09Paper
Synthesis from recursive-components libraries
(available as arXiv preprint)
2021-03-03Paper
Synthesis from recursive-components libraries2021-03-03Paper
Sequential relational decomposition
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
2021-01-20Paper
scientific article; zbMATH DE number 7297854 (Why is no real title available?)2021-01-19Paper
scientific article; zbMATH DE number 7297884 (Why is no real title available?)
(available as arXiv preprint)
2021-01-19Paper
scientific article; zbMATH DE number 7297884 (Why is no real title available?)2021-01-19Paper
Strategy logic with imperfect information
ACM Transactions on Computational Logic
2021-01-01Paper
Knowledge-based programs
Distributed Computing
2020-12-02Paper
Flow games2020-11-25Paper
On hashing-based approaches to approximate DNF-counting
(available as arXiv preprint)
2020-11-25Paper
Infinitary logic for computer science
Automata, Languages and Programming
2019-12-04Paper
Not all FPRASs are equal: demystifying FPRASs for DNF-counting
Constraints
2019-11-27Paper
SAT-based explicit LTL reasoning and its application to satisfiability checking
Formal Methods in System Design
2019-11-18Paper
First-order vs. second-order encodings for \textsc{ltl}\(_f\)-to-automata translation
(available as arXiv preprint)
2019-10-15Paper
Alternating automata: unifying truth and validity checking for temporal logics
Automated Deduction—CADE-14
2019-10-01Paper
In memoriam Paris C. Kanellakis
ACM Computing Surveys
2019-08-09Paper
Random models for evaluating efficient Büchi universality checking
Logic and Its Applications
2019-07-24Paper
BDD-based Boolean functional synthesis
Computer Aided Verification
2019-05-03Paper
Accelerating LTL satisfiability checking by SAT solvers
Journal Of Logic And Computation
2019-01-31Paper
Solving parity games: explicit vs symbolic2018-11-07Paper
Comparator automata in quantitative verification
(available as arXiv preprint)
2018-07-17Paper
Mode-Target Games: Reactive Synthesis for Control Applications
IEEE Transactions on Automatic Control
2018-06-27Paper
An explicit transition system construction approach to LTL satisfiability checking
Formal Aspects of Computing
2018-03-29Paper
Supervisory control and reactive synthesis: a comparative introduction
Discrete Event Dynamic Systems
2018-01-31Paper
Knowledge-based programs
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95
2017-09-29Paper
Regular queries on graph databases
Theory of Computing Systems
2017-09-20Paper
\(\mathrm{LTL}_{f}\) satisfiability checking
(available as arXiv preprint)
2017-07-18Paper
\(\mathrm{LTL}_{f}\) satisfiability checking2017-07-18Paper
From linear time to branching time
ACM Transactions on Computational Logic
2017-07-12Paper
Solving partial-information stochastic parity games
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
2017-07-03Paper
Regular Real Analysis
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
2017-07-03Paper
Regular queries on graph databases2017-06-13Paper
Iterative temporal motion planning for hybrid systems in partially unknown environments
Proceedings of the 16th international conference on Hybrid systems: computation and control
2017-05-16Paper
Reasoning about strategies: on the satisfiability problem
(available as arXiv preprint)
2017-05-08Paper
Relentful strategic reasoning in alternating-time temporal logic
Journal Of Logic And Computation
2017-01-31Paper
Solving parity games using an automata-based algorithm
Implementation and Application of Automata
2016-11-09Paper
Synthesis with rational environments
Annals of Mathematics and Artificial Intelligence
2016-09-16Paper
Semantic acyclicity on graph databases
SIAM Journal on Computing
2016-08-16Paper
On computing minimal independent support and its applications to sampling and counting
Constraints
2016-04-12Paper
Profile trees for Büchi word automata, with application to determinization
Information and Computation
2015-12-07Paper
The Complexity of Synthesis from Probabilistic Components
Automata, Languages, and Programming
2015-11-04Paper
Reasoning about strategies: on the model-checking problem
ACM Transactions on Computational Logic
2015-09-17Paper
Parametric real-time reasoning
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93
2015-05-07Paper
Monotone monadic SNP and constraint satisfaction
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93
2015-05-07Paper
From Löwenheim to PSL and SVA
Lecture Notes in Computer Science
2015-02-10Paper
State of Büchi complementation
Logical Methods in Computer Science
2015-01-15Paper
Proving that programs eventually do something good
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
2014-09-12Paper
Synthesis from probabilistic components
Logical Methods in Computer Science
2014-07-31Paper
The complexity of partial-observation stochastic parity games with finite-memory strategies
Lecture Notes in Computer Science
2014-04-16Paper
Temporal property verification as a program analysis task
Formal Methods in System Design
2014-03-28Paper
Optimized temporal monitors for SystemcC
Formal Methods in System Design
2014-03-28Paper
On simplification of schema mappings
Journal of Computer and System Sciences
2014-01-20Paper
SAT-based induction for temporal safety properties2013-09-20Paper
Verification of Open Systems
Interactive Computation
2013-06-18Paper
Pushdown module checking with imperfect information
Information and Computation
2013-06-06Paper
Unifying Büchi complementation constructions
Logical Methods in Computer Science
2013-04-09Paper
What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Lecture Notes in Computer Science
2012-09-25Paper
Unifying Büchi complementation constructions
(available as arXiv preprint)
2012-09-18Paper
Unifying Büchi complementation constructions2012-09-18Paper
← Previous 100   1   2   3   4   Next 100 →


Research outcomes over time


This page was built for person: Moshe Y. Vardi