2019 - Fellow of the American Mathematical Society For contributions to the development and use of mathematical logic in computer science.
2017 - ACM Presidential Award A true visionary whose outstanding leadership over the last decade has cemented the reputation of ACM's flagship publication--Communications of the ACM--as the premier chronicler of computing technologies by opening its pages to leading voices from multiple disciplines, extending its reach with new digital and mobile platforms, and making it a monthly must-read for a global audience.
2015 - SIAM Fellow For contributions to the development of logic as a unifying foundational framework and a tool for modeling computational systems.
2015 - Member of the National Academy of Sciences
2015 - European Association for Theoretical Computer Science (EATCS) Fellow For fundamental and lasting contributions to the development of logic in computer science and exceptional services to the community of theoretical computer science
2010 - Fellow of the American Academy of Arts and Sciences
2009 - IEEE Fellow For contributions to the development of logic as a unifying framework for modeling computational systems
2009 - Outstanding Contribution to ACM Award For outstanding leadership in restructuring the Communications of the ACM to be the flagship publication of both the Association and the discipline and in organizing an influential, systematic analysis of outsourcing.
2008 - ACM Presidential Award A true visionary whose outstanding leadership over the last decade has cemented the reputation of ACM's flagship publication--Communications of the ACM--as the premier chronicler of computing technologies by opening its pages to leading voices from multiple disciplines, extending its reach with new digital and mobile platforms, and making it a monthly must-read for a global audience.
2007 - Member of Academia Europaea
2005 - Fellow of John Simon Guggenheim Memorial Foundation
2005 - ACM Paris Kanellakis Theory and Practice Award Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper
2004 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to the development of automated-reasoning techniques and to the development of logic as a unifying foundational framework and a tool for modeling computational systems.
2003 - Member of the European Academy of Sciences
2002 - Member of the National Academy of Engineering For contributions to the formal verification of hardware and software correctness.
2002 - Fellow of the American Association for the Advancement of Science (AAAS)
2000 - ACM Fellow For contributions to the development of logic as a unifying foundational framework and a tool for modeling computational systems.
Moshe Y. Vardi focuses on Theoretical computer science, Discrete mathematics, Model checking, Temporal logic and Linear temporal logic. He studies Automaton, a branch of Theoretical computer science. Moshe Y. Vardi has included themes like Datalog, Constraint satisfaction, Quantum finite automata and Combinatorics in his Discrete mathematics study.
His Model checking study integrates concerns from other disciplines, such as Formal verification and Counterexample. He interconnects Tree automaton and Logical conjunction in the investigation of issues within Temporal logic. Moshe Y. Vardi studied Linear temporal logic and Satisfiability that intersect with Reduction.
Moshe Y. Vardi spends much of his time researching Theoretical computer science, Discrete mathematics, Algorithm, Model checking and Automaton. His study ties his expertise on Programming language together with the subject of Theoretical computer science. His Discrete mathematics research is multidisciplinary, relying on both Bounded function and Combinatorics.
He is studying Time complexity, which is a component of Algorithm. His Automaton research focuses on Büchi automaton in particular. His studies examine the connections between Linear temporal logic and genetics, as well as such issues in Temporal logic, with regards to Computation.
Theoretical computer science, Algorithm, Linear temporal logic, Automaton and Satisfiability are his primary areas of study. His research investigates the connection with Theoretical computer science and areas like Fragment which intersect with concerns in Reduction. As part of the same scientific family, Moshe Y. Vardi usually focuses on Algorithm, concentrating on Hash function and intersecting with Polynomial.
Many of his studies on Linear temporal logic apply to Set as well. Moshe Y. Vardi regularly ties together related areas like Formal verification in his Automaton studies. His studies in Satisfiability integrate themes in fields like Construct, Transition system and Boolean satisfiability problem.
Moshe Y. Vardi mainly investigates Theoretical computer science, Satisfiability, Algorithm, Internal medicine and Linear temporal logic. His is doing research in True quantified Boolean formula and Model checking, both of which are found in Theoretical computer science. The study incorporates disciplines such as Programming language, Construct, Bounded function and Boolean satisfiability problem in addition to Satisfiability.
His Algorithm research incorporates themes from Hash function and Model counting. His Internal medicine research is multidisciplinary, incorporating elements of Diabetes mellitus, Endocrinology and Immunology. His Linear temporal logic research integrates issues from Abstraction, Fragment, Automaton, Robotics and Mathematical optimization.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Reasoning About Knowledge
Ronald Fagin;Joseph Y. Halpern;Moshe Y. Vardi;Yoram Moses.
An Automata-Theoretic Approach to Automatic Program Verification
Moshe Y Vardi;Pierre Wolper.
The complexity of relational query languages (Extended Abstract)
Moshe Y. Vardi.
symposium on the theory of computing (1982)
Simple on-the-fly automatic verification of linear temporal logic
Rob Gerth;Doron Peled;Moshe Y. Vardi;Pierre Wolper.
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV (1995)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Tomás Feder;Moshe Y. Vardi.
SIAM Journal on Computing (1999)
Reasoning about Infinite Computations
M.Y. Vardi;P. Wolper.
Information & Computation (1994)
Automatic verification of probabilistic concurrent finite state programs
Moshe Y. Vardi.
foundations of computer science (1985)
An automata-theoretic approach to linear temporal logic
Moshe Y. Vardi.
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata (1996)
Memory Efficient Algorithms for the Verification of Temporal Properties
Costas Courcoubetis;Moshe Y. Vardi;Pierre Wolper;Mihalis Yannakakis.
computer aided verification (1990)
Automata-Theoretic techniques for modal logics of programs
Moshe Y Vardi;Pierre Wolper.
Journal of Computer and System Sciences (1986)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: