Moshe Y. Vardi
Moshe Y. Vardi

homepage
vardiatcs.rice.edu

  Affiliation history
Bibliometrics: publication history
Average citations per article23.47
Citation Count9,482
Publication count404
Publication years1981-2016
Available for download180
Average downloads per article5,840.01
Downloads (cumulative)1,051,201
Downloads (12 Months)109,948
Downloads (6 Weeks)13,071
ACM Fellow
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

KEYWORDS
See all author supplied keywords



BOOKMARK & SHARE


418 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 418
Result page: 1 2 3 4 5 6 7 8 9 10 >>

Sort by:

1 published by ACM
Ten years at the helm of communications of the ACM
May 2017 Communications of the ACM: Volume 60 Issue 6, June 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,784,   Downloads (12 Months): 4,784,   Downloads (Overall): 4,784

Full text available: HtmlHtml  PDFPDF

2 published by ACM
2017 ACM PODS Alberto O. Mendelzon Test-of-Time Award
Leonid Libkin, Moshe Vardi
May 2017 PODS '17: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 47,   Downloads (12 Months): 47,   Downloads (Overall): 47

Full text available: PDFPDF
Keywords: awards

3 published by ACM
Cyber insecurity and cyber libertarianism
April 2017 Communications of the ACM: Volume 60 Issue 5, May 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,503,   Downloads (12 Months): 3,536,   Downloads (Overall): 3,536

Full text available: HtmlHtml  PDFPDF

4 published by ACM
ACM's open-conference principle and political reality
February 2017 Communications of the ACM: Volume 60 Issue 3, March 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 362,   Downloads (12 Months): 3,268,   Downloads (Overall): 3,268

Full text available: HtmlHtml  PDFPDF

5
Random Models for Evaluating Efficient Büchi Universality Checking
Corey Fisher, Seth Fogarty, Moshe Vardi
January 2017 ICLA 2017: Proceedings of the 7th Indian Conference on Logic and Its Applications - Volume 10119
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Automata-theoretic formal verification approaches the problem of guaranteeing that a program conforms to its specification by reducing conformance to language containment. We can prove conformance by representing both programs and specifications as automata and proving that the specification contains the program. This connection to the theory of automata on infinite ...

6 published by ACM
Technology for the most effective use of mankind
December 2016 Communications of the ACM: Volume 60 Issue 1, January 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 96,   Downloads (12 Months): 3,647,   Downloads (Overall): 3,647

Full text available: HtmlHtml  PDFPDF

7 published by ACM
Globalization, computing, and their political impact
October 2016 Communications of the ACM: Volume 59 Issue 11, November 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 49,   Downloads (12 Months): 4,005,   Downloads (Overall): 4,005

Full text available: HtmlHtml  PDFPDF

8 published by ACM
Academic rankings considered harmful!
August 2016 Communications of the ACM: Volume 59 Issue 9, September 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,282,   Downloads (12 Months): 24,056,   Downloads (Overall): 24,056

Full text available: HtmlHtml  PDFPDF

9
LTLf and LDLf synthesis under partial observability
July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

In this paper, we study synthesis under partial observability for logical specifications over finite traces expressed in LTL f /LDL f . This form of synthesis can be seen as a generalization of planning under partial observability in nondeterministic domains, which is known to be 2EXPTIME-complete. We start by showing ...

10 published by ACM
The ritual of academic-unit review
June 2016 Communications of the ACM: Volume 59 Issue 7, July 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 41,   Downloads (12 Months): 4,085,   Downloads (Overall): 4,085

Full text available: HtmlHtml  PDFPDF

11 published by ACM
A Theory of Regular Queries
June 2016 PODS '16: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 205,   Downloads (Overall): 205

Full text available: PDFPDF
A major theme in relational database theory is navigating the tradeoff between expressiveness and tractability for query languages, where the query-containment problem is considered a benchmark of tractability. The query class UCQ, consisting off unions of conjunctive queries , is a fragment of first-order logic that has a decidable query ...
Keywords: query containment datalog graph databases, query language

12
2014 CAV award announcement
June 2016 Formal Methods in System Design: Volume 48 Issue 3, June 2016
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

The 2014 computer-aided verification (CAV) award was presented on July 19, 2014, at the 26th annual CAV conference in Vienna to Patrice Godefroid, Doron Peled, Antti Valmari, and Pierre Wolper for the development of partial-order-reduction algorithms for efficient state-space exploration of concurrent systems.
Keywords: Concurrency, CAV Award, Computer-aided verification, Model checking, Partial order reduction

13 published by ACM
The moral imperative of artificial intelligence
April 2016 Communications of the ACM: Volume 59 Issue 5, May 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 187,   Downloads (12 Months): 3,242,   Downloads (Overall): 10,117

Full text available: HtmlHtml  PDFPDF

14
Regular open APIs
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
April 2016 KR'16: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Open APIs are software intermediaries that make it possible for application programs to interact with data and processes, which can both be viewed as forms of services. In many scenarios, when one wants to obtain or publish a new service, one would like to check whether the new functionality can ...

15 published by ACM
Are we headed toward another global tech bust?
March 2016 Communications of the ACM: Volume 59 Issue 4, April 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 61,   Downloads (12 Months): 1,111,   Downloads (Overall): 5,377

Full text available: HtmlHtml  PDFPDF

16 published by ACM
The moral hazard of complexity-theoretic assumptions
January 2016 Communications of the ACM: Volume 59 Issue 2, February 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 1,391,   Downloads (Overall): 10,419

Full text available: HtmlHtml  PDFPDF

17
On computing minimal independent support and its applications to sampling and counting
Alexander Ivrii, Sharad Malik, Kuldeep S. Meel, Moshe Y. Vardi
January 2016 Constraints: Volume 21 Issue 1, January 2016
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 5

Constrained sampling and counting are two fundamental problems arising in domains ranging from artificial intelligence and security, to hardware and software testing. Recent approaches to approximate solutions for these problems rely on employing SAT solvers and universal hash functions that are typically encoded as XOR constraints of length n/2 for ...
Keywords: Independent support, Model counting, SAT sampling

18 published by ACM
Humans, machines, and the future of work
December 2015 Ada Lovelace Symposium '15: Ada Lovelace Symposium 2015- Celebrating 200 Years of a Computer Visionary
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 45,   Downloads (Overall): 57

Full text available: Mp4Mp4
Moshe Vardi, Rice University explores the question "If machines are capable of doing almost any work humans can do, what will humans do?".

19
Profile trees for Büchi word automata, with application to determinization
December 2015 Information and Computation: Volume 245 Issue C, December 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

The determinization of Büchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Schewe, and others. Despite the proliferation of solutions, they are all essentially ad-hoc constructions, with little theory ...
Keywords: ω-automata, Büchi profiles, Omega-automata, Automata theory, Büchi determinization

20 published by ACM
On lethal autonomous weapons
November 2015 Communications of the ACM: Volume 58 Issue 12, December 2015
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 32,   Downloads (12 Months): 1,188,   Downloads (Overall): 5,602

Full text available: HtmlHtml  PDFPDF



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2017 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us