2009 |
364 | EE | Yoad Lustig,
Moshe Y. Vardi:
Synthesis from Component Libraries.
FOSSACS 2009: 395-409 |
363 | EE | Moshe Y. Vardi:
From Philosophical to Industrial Logics.
ICLA 2009: 89-115 |
362 | EE | Seth Fogarty,
Moshe Y. Vardi:
Büchi Complementation and Size-Change Termination.
TACAS 2009: 16-30 |
361 | EE | Erion Plaku,
Lydia E. Kavraki,
Moshe Y. Vardi:
Falsification of LTL Safety Properties in Hybrid Systems.
TACAS 2009: 368-382 |
360 | EE | Moshe Y. Vardi:
How are we doing?
Commun. ACM 52(1): 5 (2009) |
359 | EE | Moshe Y. Vardi:
"Yes, it can be done".
Commun. ACM 52(3): 5 (2009) |
358 | EE | Erion Plaku,
Lydia E. Kavraki,
Moshe Y. Vardi:
Hybrid systems: from verification to falsification by combining motion planning and discrete search.
Formal Methods in System Design 34(2): 157-182 (2009) |
357 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
From liveness to promptness.
Formal Methods in System Design 34(2): 83-103 (2009) |
2008 |
356 | | Rod Downey,
Bakhadyr Khoussainov,
Dietrich Kuske,
Markus Lohrey,
Moshe Y. Vardi:
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
355 | EE | Moshe Y. Vardi:
From Church and Prior to PSL.
25 Years of Model Checking 2008: 150-171 |
354 | EE | Phokion G. Kolaitis,
Moshe Y. Vardi:
A Logical Approach to Constraint Satisfaction.
Complexity of Constraints 2008: 125-155 |
353 | EE | Moshe Y. Vardi:
Automata-Theoretic Model Checking Revisited.
Haifa Verification Conference 2008: 2 |
352 | EE | Dana Fisman,
Orna Kupferman,
Sarai Sheinvald-Faragy,
Moshe Y. Vardi:
A Framework for Inherent Vacuity.
Haifa Verification Conference 2008: 7-22 |
351 | EE | Karin Greimel,
Roderick Bloem,
Barbara Jobstmann,
Moshe Y. Vardi:
Open Implication.
ICALP (2) 2008: 361-372 |
350 | EE | Erion Plaku,
Lydia E. Kavraki,
Moshe Y. Vardi:
Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning.
ICRA 2008: 3751-3756 |
349 | EE | Roni Wiener,
Gila Kamhi,
Moshe Y. Vardi:
Intelligate: Scalable Dynamic Invariant Learning for Power Reduction.
PATMOS 2008: 52-61 |
348 | EE | Moshe Y. Vardi:
From Monadic Logic to PSL.
Pillars of Computer Science 2008: 656-681 |
347 | EE | Moshe Y. Vardi:
From Verification to Synthesis.
VSTTE 2008: 2 |
346 | EE | Piero A. Bonatti,
Carsten Lutz,
Aniello Murano,
Moshe Y. Vardi:
The Complexity of Enriched Mu-Calculi
CoRR abs/0809.0360: (2008) |
345 | EE | Moshe Y. Vardi:
CACM: past, present, and future.
Commun. ACM 51(1): 44-48 (2008) |
344 | EE | Moshe Y. Vardi:
Let us---together---make CACM exciting.
Commun. ACM 51(10): 5 (2008) |
343 | EE | Moshe Y. Vardi:
"Where do you come from? and where are you going?".
Commun. ACM 51(7): 5 (2008) |
2007 |
342 | EE | Roy Armoni,
Limor Fix,
Ranan Fraer,
Tamir Heyman,
Moshe Y. Vardi,
Yakir Vizel,
Yael Zbar:
Deeper Bound in BMC by Combining Constant Propagation and Abstraction.
ASP-DAC 2007: 304-309 |
341 | EE | Sumit Nain,
Moshe Y. Vardi:
Branching vs. Linear Time: Semantical Perspective.
ATVA 2007: 19-34 |
340 | EE | Rod Downey,
Bakhadyr Khoussainov,
Dietrich Kuske,
Markus Lohrey,
Moshe Y. Vardi:
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.
Algorithmic-Logical Theory of Infinite Structures 2007 |
339 | EE | Rod Downey,
Bakhadyr Khoussainov,
Dietrich Kuske,
Markus Lohrey,
Moshe Y. Vardi:
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.
Algorithmic-Logical Theory of Infinite Structures 2007 |
338 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
From Liveness to Promptness.
CAV 2007: 406-419 |
337 | EE | Erion Plaku,
Lydia E. Kavraki,
Moshe Y. Vardi:
Hybrid Systems: From Verification to Falsification.
CAV 2007: 463-476 |
336 | EE | Moshe Y. Vardi:
Linear-Time Model Checking: Automata Theory in Practice.
CIAA 2007: 5-10 |
335 | EE | Benjamin Aminof,
Aniello Murano,
Moshe Y. Vardi:
Pushdown Module Checking with Imperfect Information.
CONCUR 2007: 460-475 |
334 | EE | Lucas Bordeaux,
Youssef Hamadi,
Moshe Y. Vardi:
An Analysis of Slow Convergence in Interval Propagation.
CP 2007: 790-797 |
333 | EE | Moshe Y. Vardi:
Formal Techniques for SystemC Verification; Position Paper.
DAC 2007: 188-192 |
332 | EE | Pietro Babighian,
Gila Kamhi,
Moshe Y. Vardi:
Interactive presentation: PowerQuest: trace driven data mining for power optimization.
DATE 2007: 1078-1083 |
331 | EE | Erion Plaku,
Lydia E. Kavraki,
Moshe Y. Vardi:
A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints.
ICRA 2007: 692-697 |
330 | EE | Byron Cook,
Alexey Gotsman,
Andreas Podelski,
Andrey Rybalchenko,
Moshe Y. Vardi:
Proving that programs eventually do something good.
POPL 2007: 265-276 |
329 | EE | Erion Plaku,
Lydia E. Kavraki,
Moshe Y. Vardi:
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning.
Robotics: Science and Systems 2007 |
328 | EE | Kristin Y. Rozier,
Moshe Y. Vardi:
LTL Satisfiability Checking.
SPIN 2007: 149-167 |
327 | EE | Moshe Y. Vardi:
The Büchi Complementation Saga.
STACS 2007: 12-22 |
326 | EE | Roberto Sebastiani,
Stefano Tonetta,
Moshe Y. Vardi:
Property-Driven Partitioning for Abstraction Refinement.
TACAS 2007: 389-404 |
325 | EE | Kousha Etessami,
Marta Z. Kwiatkowska,
Moshe Y. Vardi,
Mihalis Yannakakis:
Multi-objective Model Checking of Markov Decision Processes.
TACAS 2007: 50-65 |
324 | EE | Moshe Y. Vardi:
Automata-Theoretic Model Checking Revisited.
VMCAI 2007: 137-150 |
323 | EE | Roberto Sebastiani,
Eli Singerman,
Stefano Tonetta,
Moshe Y. Vardi:
GSTE is partitioned model checking.
Formal Methods in System Design 31(2): 177-196 (2007) |
322 | EE | Marco Pistore,
Moshe Y. Vardi:
The Planning Spectrum - One, Two, Three, Infinity.
J. Artif. Intell. Res. (JAIR) 30: 101-132 (2007) |
321 | EE | Cristopher Moore,
Gabriel Istrate,
Demetrios D. Demopoulos,
Moshe Y. Vardi:
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas.
Random Struct. Algorithms 31(2): 173-185 (2007) |
320 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
View-based query processing: On the relationship between rewriting, answering and losslessness.
Theor. Comput. Sci. 371(3): 169-182 (2007) |
2006 |
319 | | Henry A. Kautz,
Wolfgang Thomas,
Moshe Y. Vardi:
Synthesis and Planning, 12.-17. June 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
318 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Safraless Compositional Synthesis.
CAV 2006: 31-44 |
317 | EE | Roy Armoni,
Dmitry Korchemny,
Andreas Tiemeyer,
Moshe Y. Vardi,
Yael Zbar:
Deterministic Dynamic Monitors for Linear-Time Assertions.
FATES/RV 2006: 163-177 |
316 | EE | Piero A. Bonatti,
Carsten Lutz,
Aniello Murano,
Moshe Y. Vardi:
The Complexity of Enriched µ-Calculi.
ICALP (2) 2006: 540-551 |
315 | EE | Orna Kupferman,
Moshe Y. Vardi:
Memoryful Branching-Time Logic.
LICS 2006: 265-274 |
314 | EE | Guoqiang Pan,
Moshe Y. Vardi:
Fixed-Parameter Hierarchies inside PSPACE.
LICS 2006: 27-36 |
313 | EE | Orna Kupferman,
Yoad Lustig,
Moshe Y. Vardi:
On Locally Checkable Properties.
LPAR 2006: 302-316 |
312 | EE | Michal Armoni,
S. Rodger,
Moshe Y. Vardi,
R. Verma:
Automata theory: its relevance to computer science students and course contents.
SIGCSE 2006: 197-198 |
311 | EE | William Aspray,
A. Frank Mayadas,
Moshe Y. Vardi,
Stuart H. Zweben:
educational response to offshore outsourcing.
SIGCSE 2006: 330-331 |
310 | EE | Orna Kupferman,
Shmuel Safra,
Moshe Y. Vardi:
Relating word and tree automata.
Ann. Pure Appl. Logic 138(1-3): 126-146 (2006) |
309 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage metrics for temporal logic model checking*.
Formal Methods in System Design 28(3): 189-212 (2006) |
308 | EE | Ehud Friedgut,
Orna Kupferman,
Moshe Y. Vardi:
Büchi Complementation Made Tighter.
Int. J. Found. Comput. Sci. 17(4): 851-868 (2006) |
307 | | Guoqiang Pan,
Ulrike Sattler,
Moshe Y. Vardi:
BDD-based decision procedures for the modal logic K.
Journal of Applied Non-Classical Logics 16(1-2): 169-208 (2006) |
306 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage metrics for formal verification.
STTT 8(4-5): 373-386 (2006) |
2005 |
305 | EE | Cristopher Moore,
Gabriel Istrate,
Demetrios D. Demopoulos,
Moshe Y. Vardi:
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.
APPROX-RANDOM 2005: 414-425 |
304 | EE | Tamarah Arons,
Elad Elster,
Limor Fix,
Sela Mador-Haim,
Michael Mishaeli,
Jonathan Shalev,
Eli Singerman,
Andreas Tiemeyer,
Moshe Y. Vardi,
Lenore D. Zuck:
Formal Verification of Backward Compatibility of Microcode.
CAV 2005: 185-198 |
303 | EE | Roberto Sebastiani,
Stefano Tonetta,
Moshe Y. Vardi:
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking.
CAV 2005: 350-363 |
302 | EE | Doron Bustan,
Alon Flaisher,
Orna Grumberg,
Orna Kupferman,
Moshe Y. Vardi:
Regular Vacuity.
CHARME 2005: 191-206 |
301 | EE | Orna Kupferman,
Moshe Y. Vardi:
Safraless Decision Procedures.
FOCS 2005: 531-542 |
300 | | Roy Armoni,
Sergey Egorov,
Ranan Fraer,
Dmitry Korchemny,
Moshe Y. Vardi:
Efficient LTL compilation for SAT-based model checking.
ICCAD 2005: 877-884 |
299 | EE | Moshe Y. Vardi:
Model Checking for Database Theoreticians.
ICDT 2005: 1-16 |
298 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
View-Based Query Processing: On the Relationship Between Rewriting, Answering and Losslessness.
ICDT 2005: 321-336 |
297 | EE | Deian Tabakov,
Moshe Y. Vardi:
Experimental Evaluation of Classical Automata Constructions.
LPAR 2005: 396-411 |
296 | EE | Andrea Ferrara,
Guoqiang Pan,
Moshe Y. Vardi:
Treewidth in Verification: Local vs. Global.
LPAR 2005: 489-503 |
295 | EE | Henry A. Kautz,
Wolfgang Thomas,
Moshe Y. Vardi:
05241 Abstracts Collection - Synthesis and Planning.
Synthesis and Planning 2005 |
294 | EE | Henry A. Kautz,
Wolfgang Thomas,
Moshe Y. Vardi:
05241 Executive Summary - Synthesis and Planning.
Synthesis and Planning 2005 |
293 | EE | Orna Kupferman,
Moshe Y. Vardi:
Complementation Constructions for Nondeterministic Automata on Infinite Words.
TACAS 2005: 206-221 |
292 | EE | Orna Kupferman,
Moshe Y. Vardi:
From linear time to branching time.
ACM Trans. Comput. Log. 6(2): 273-294 (2005) |
291 | EE | Roy Armoni,
Limor Fix,
Ranan Fraer,
Scott Huddleston,
Nir Piterman,
Moshe Y. Vardi:
SAT-based Induction for Temporal Safety Properties.
Electr. Notes Theor. Comput. Sci. 119(2): 3-16 (2005) |
290 | EE | Guoqiang Pan,
Moshe Y. Vardi:
Symbolic Techniques in Satisfiability Solving.
J. Autom. Reasoning 35(1-3): 25-50 (2005) |
289 | EE | Serge Abiteboul,
Richard Hull,
Victor Vianu,
Sheila A. Greibach,
Michael A. Harrison,
Ellis Horowitz,
Daniel J. Rosenkrantz,
Jeffrey D. Ullman,
Moshe Y. Vardi:
In memory of Seymour Ginsburg 1928 - 2004.
SIGMOD Record 34(1): 5-12 (2005) |
288 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Moshe Y. Vardi:
Decidable containment of recursive queries.
Theor. Comput. Sci. 336(1): 33-56 (2005) |
287 | EE | Orna Kupferman,
Moshe Y. Vardi:
From complementation to certification.
Theor. Comput. Sci. 345(1): 83-100 (2005) |
2004 |
286 | EE | Ehud Friedgut,
Orna Kupferman,
Moshe Y. Vardi:
Büchi Complementation Made Tighter.
ATVA 2004: 64-78 |
285 | EE | Doron Bustan,
Sasha Rubin,
Moshe Y. Vardi:
Verifying omega-Regular Properties of Markov Chains.
CAV 2004: 189-201 |
284 | EE | Roberto Sebastiani,
Eli Singerman,
Stefano Tonetta,
Moshe Y. Vardi:
GSTE Is Partitioned Model Checking.
CAV 2004: 229-241 |
283 | EE | Nir Piterman,
Moshe Y. Vardi:
Global Model-Checking of Infinite-State Systems.
CAV 2004: 387-400 |
282 | EE | Guoqiang Pan,
Moshe Y. Vardi:
Symbolic Decision Procedures for QBF.
CP 2004: 453-467 |
281 | EE | Albert Atserias,
Phokion G. Kolaitis,
Moshe Y. Vardi:
Constraint Propagation as a Proof System.
CP 2004: 77-91 |
280 | EE | Benjamin J. McMahan,
Guoqiang Pan,
Patrick Porter,
Moshe Y. Vardi:
Projection Pushing Revisited.
EDBT 2004: 441-458 |
279 | EE | Guoqiang Pan,
Moshe Y. Vardi:
Search vs. Symbolic Techniques in Satisfiability Solving.
SAT 2004 |
278 | EE | Guoqiang Pan,
Moshe Y. Vardi:
Search vs. Symbolic Techniques in Satisfiability Solving.
SAT (Selected Papers 2004: 235-250 |
277 | EE | Doron Bustan,
Orna Kupferman,
Moshe Y. Vardi:
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy.
STACS 2004: 522-533 |
276 | EE | Orna Kupferman,
Moshe Y. Vardi:
From Complementation to Certification.
TACAS 2004: 591-606 |
275 | EE | Joseph Y. Halpern,
Ron van der Meyden,
Moshe Y. Vardi:
Complete Axiomatizations for Reasoning about Knowledge and Time.
SIAM J. Comput. 33(3): 674-703 (2004) |
2003 |
274 | | Moshe Y. Vardi,
Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings
Springer 2003 |
273 | EE | Guoqiang Pan,
Moshe Y. Vardi:
Optimizing a BDD-Based Modal Solver.
CADE 2003: 75-89 |
272 | EE | Roy Armoni,
Limor Fix,
Alon Flaisher,
Orna Grumberg,
Nir Piterman,
Andreas Tiemeyer,
Moshe Y. Vardi:
Enhanced Vacuity Detection in Linear Temporal Logic.
CAV 2003: 368-380 |
271 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage Metrics for Formal Verification.
CHARME 2003: 111-125 |
270 | EE | Sankar Gurumurthy,
Orna Kupferman,
Fabio Somenzi,
Moshe Y. Vardi:
On Complementing Nondeterministic Büchi Automata.
CHARME 2003: 96-110 |
269 | EE | Moshe Y. Vardi:
Logic and Automata: A Match Made in Heaven.
ICALP 2003: 64-65 |
268 | EE | Orna Kupferman,
Moshe Y. Vardi:
Pi2 cap Sigma2 equiv AFMC.
ICALP 2003: 697-713 |
267 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Moshe Y. Vardi:
Decidable Containment of Recursive Queries.
ICDT 2003: 327-342 |
266 | | Moshe Y. Vardi:
Automated Verification: Graphs, Logic, and Automata.
IJCAI 2003: 1603-1606 |
265 | EE | Marco Pistore,
Moshe Y. Vardi:
The Planning Spectrum - One, Two, Three, Infinity.
LICS 2003: 234-243 |
264 | EE | Tomás Feder,
Moshe Y. Vardi:
Homomorphism Closed vs. Existential Positive.
LICS 2003: 311-320 |
263 | EE | Nir Piterman,
Moshe Y. Vardi:
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems.
LICS 2003: 381- |
262 | | Serge Abiteboul,
Gabriel M. Kuper,
Alexander A. Shvartsman,
Moshe Y. Vardi:
In Memoriam: Paris C. Kanellakis.
PCK50 2003: 1-8 |
261 | | Moshe Y. Vardi:
A Call to Regularity.
PCK50 2003: 11 |
260 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
View-based query containment.
PODS 2003: 56-67 |
259 | | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Query Containment Using Views.
SEBD 2003: 467-474 |
258 | EE | Marcelo Glusman,
Gila Kamhi,
Sela Mador-Haim,
Ranan Fraer,
Moshe Y. Vardi:
Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation.
TACAS 2003: 176-191 |
257 | EE | Roy Armoni,
Doron Bustan,
Orna Kupferman,
Moshe Y. Vardi:
Resets vs. Aborts in Linear Temporal Logic.
TACAS 2003: 65-80 |
256 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Fair Equivalence Relations.
Verification: Theory and Practice 2003: 702-732 |
255 | EE | Cristian Coarfa,
Demetrios D. Demopoulos,
Alfonso San Miguel Aguirre,
Devika Subramanian,
Moshe Y. Vardi:
Random 3-SAT: The Plot Thickens.
Constraints 8(3): 243-261 (2003) |
254 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Reasoning on regular path queries.
SIGMOD Record 32(4): 83-92 (2003) |
253 | EE | Orna Kupferman,
Moshe Y. Vardi:
Vacuity detection in temporal model checking.
STTT 4(2): 224-233 (2003) |
252 | EE | Nir Piterman,
Moshe Y. Vardi:
From bidirectionality to alternation.
Theor. Comput. Sci. 295: 295-321 (2003) |
2002 |
251 | | Doron Peled,
Moshe Y. Vardi:
Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings
Springer 2002 |
250 | EE | Guoqiang Pan,
Ulrike Sattler,
Moshe Y. Vardi:
BDD-Based Decision Procedures for K.
CADE 2002: 16-30 |
249 | EE | Orna Kupferman,
Ulrike Sattler,
Moshe Y. Vardi:
The Complexity of the Graded µ-Calculus.
CADE 2002: 423-437 |
248 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Model Checking Linear Properties of Prefix-Recognizable Systems.
CAV 2002: 371-385 |
247 | EE | Víctor Dalmau,
Phokion G. Kolaitis,
Moshe Y. Vardi:
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics.
CP 2002: 310-326 |
246 | EE | Moshe Y. Vardi:
Alternation.
JELIA 2002: 565 |
245 | | Randy Batsell,
Lyle Brenner,
Daniel N. Osherson,
Spyros Tsavachidis,
Moshe Y. Vardi:
Eliminating Incoherence from Subjective Estimates of Chance.
KR 2002: 353-364 |
244 | | Diego Calvanese,
Giuseppe De Giacomo,
Moshe Y. Vardi:
Reasoning about Actions and Planning in LTL Action Theories.
KR 2002: 593-602 |
243 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Pushdown Specifications.
LPAR 2002: 262-277 |
242 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Lossless Regular Views.
PODS 2002: 247-258 |
241 | EE | Roy Armoni,
Limor Fix,
Alon Flaisher,
Rob Gerth,
Boris Ginsburg,
Tomer Kanza,
Avner Landver,
Sela Mador-Haim,
Eli Singerman,
Andreas Tiemeyer,
Moshe Y. Vardi,
Yael Zbar:
The ForSpec Temporal Logic: A New Temporal Property-Specification Language.
TACAS 2002: 296-211 |
240 | EE | Joseph Y. Halpern,
Ron van der Meyden,
Moshe Y. Vardi:
Complete Axiomatizations for Reasoning About Knowledge and Time
CoRR cs.LO/0208033: (2002) |
239 | EE | Ken Kennedy,
Moshe Y. Vardi:
A Rice University perspective on software engineering licensing.
Commun. ACM 45(11): 94-95 (2002) |
238 | EE | Moshe Y. Vardi:
Model Checking: A Complexity-Theoretic Perspective (invited talk).
Electr. Notes Theor. Comput. Sci. 68(4): (2002) |
237 | | Kathi Fisler,
Moshe Y. Vardi:
Bisimulation Minimization and Symbolic Model Checking.
Formal Methods in System Design 21(1): 39-78 (2002) |
236 | EE | David Harel,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Verifying Concurrent Transition Systems.
Inf. Comput. 173(2): 143-161 (2002) |
235 | EE | Kousha Etessami,
Moshe Y. Vardi,
Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic.
Inf. Comput. 179(2): 279-295 (2002) |
234 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Rewriting of Regular Expressions and Regular Path Queries.
J. Comput. Syst. Sci. 64(3): 443-465 (2002) |
233 | | Doron Peled,
Moshe Y. Vardi,
Mihalis Yannakakis:
Black Box Checking.
Journal of Automata, Languages and Combinatorics 7(2): 225-246 (2002) |
2001 |
232 | EE | Fady Copty,
Limor Fix,
Ranan Fraer,
Enrico Giunchiglia,
Gila Kamhi,
Armando Tacchella,
Moshe Y. Vardi:
Benefits of Bounded Model Checking at an Industrial Setting.
CAV 2001: 436-453 |
231 | EE | Hana Chockler,
Orna Kupferman,
Robert P. Kurshan,
Moshe Y. Vardi:
A Practical Approach to Coverage in Model Checking.
CAV 2001: 66-78 |
230 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Extended Temporal Logic Revisited.
CONCUR 2001: 519-535 |
229 | EE | Alfonso San Miguel Aguirre,
Moshe Y. Vardi:
Random 3-SAT and BDDs: The Plot Thickens Further.
CP 2001: 121-136 |
228 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
View-Based Query Answering and Query Containment over Semistructured Data.
DBPL 2001: 40-61 |
227 | EE | Valerie King,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Parity Word Automata.
FoSSaCS 2001: 276-286 |
226 | EE | Ulrike Sattler,
Moshe Y. Vardi:
The Hybrid µ-Calculus.
IJCAR 2001: 76-91 |
225 | | Orna Kupferman,
Moshe Y. Vardi:
Synthesizing Distributed Systems.
LICS 2001 |
224 | EE | Orna Kupferman,
Moshe Y. Vardi:
On Bounded Specifications.
LPAR 2001: 24-38 |
223 | EE | Nir Piterman,
Moshe Y. Vardi:
From Bidirectionality to Alternation.
MFCS 2001: 598-610 |
222 | EE | Moshe Y. Vardi:
Branching vs. Linear Time: Final Showdown.
TACAS 2001: 1-22 |
221 | EE | Kathi Fisler,
Ranan Fraer,
Gila Kamhi,
Moshe Y. Vardi,
Zijiang Yang:
Is There a Best Symbolic Cycle-Detection Algorithm?
TACAS 2001: 420-434 |
220 | EE | Hana Chockler,
Orna Kupferman,
Moshe Y. Vardi:
Coverage Metrics for Temporal Logic Model Checking.
TACAS 2001: 528-542 |
219 | EE | Orna Kupferman,
Moshe Y. Vardi:
Weak alternating automata are not that weak.
ACM Trans. Comput. Log. 2(3): 408-429 (2001) |
218 | EE | Joseph Y. Halpern,
Robert Harper,
Neil Immerman,
Phokion G. Kolaitis,
Moshe Y. Vardi,
Victor Vianu:
On the unusual effectiveness of logic in computer science.
Bulletin of Symbolic Logic 7(2): 213-236 (2001) |
217 | EE | Enrico Giunchiglia,
Massimo Narizzano,
Armando Tacchella,
Moshe Y. Vardi:
Towards an Efficient Library for SAT: a Manifesto.
Electronic Notes in Discrete Mathematics 9: 290-310 (2001) |
216 | | R. H. Hardin,
Robert P. Kurshan,
Sandeep K. Shukla,
Moshe Y. Vardi:
A New Heuristic for Bad Cycle Detection Using BDDs.
Formal Methods in System Design 18(2): 131-140 (2001) |
215 | | Orna Kupferman,
Moshe Y. Vardi:
Model Checking of Safety Properties.
Formal Methods in System Design 19(3): 291-314 (2001) |
214 | | Orna Kupferman,
Moshe Y. Vardi,
Pierre Wolper:
Module Checking.
Inf. Comput. 164(2): 322-344 (2001) |
213 | | Yonit Kesten,
Amir Pnueli,
Moshe Y. Vardi:
Verification by Augmented Abstraction: The Automata-Theoretic View.
J. Comput. Syst. Sci. 62(4): 668-690 (2001) |
2000 |
212 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
A Game-Theoretic Approach to Constraint Satisfaction.
AAAI/IAAI 2000: 175-181 |
211 | | Orna Kupferman,
Moshe Y. Vardi:
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems.
CAV 2000: 36-52 |
210 | | Ranan Fraer,
Gila Kamhi,
Barukh Ziv,
Moshe Y. Vardi,
Limor Fix:
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification.
CAV 2000: 389-402 |
209 | | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
What is Query Rewriting?
CIA 2000: 51-59 |
208 | EE | Orna Kupferman,
P. Madhusudan,
P. S. Thiagarajan,
Moshe Y. Vardi:
Open Systems in Reactive Environments: Control and Synthesis.
CONCUR 2000: 92-107 |
207 | EE | Cristian Coarfa,
Demetrios D. Demopoulos,
Alfonso San Miguel Aguirre,
Devika Subramanian,
Moshe Y. Vardi:
Random 3-SAT: The Plot Thickens.
CP 2000: 143-159 |
206 | EE | Moshe Y. Vardi:
Automated Verification = Graphs, Automata, and Logic.
CSL 2000: 139 |
205 | EE | Orna Kupferman,
Nir Piterman,
Moshe Y. Vardi:
Fair Equivalence Relations.
FSTTCS 2000: 151-163 |
204 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Answering Regular Path Queries Using Views.
ICDE 2000: 389-398 |
203 | | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Containment of Conjunctive Regular Path Queries with Inverse.
KR 2000: 176-185 |
202 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
What is View-Based Query Rewriting?
KRDB 2000: 17-27 |
201 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
View-Based Query Processing and Constraint Satisfaction.
LICS 2000: 361-371 |
200 | EE | Orna Kupferman,
Moshe Y. Vardi:
µ-Calculus Synthesis.
MFCS 2000: 497-507 |
199 | EE | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey.
MFCS 2000: 84-98 |
198 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
View-Based Query Processing for Regular Path Queries with Inverse.
PODS 2000: 58-66 |
197 | EE | Moshe Y. Vardi:
Constraint Satisfaction and Database Theory: a Tutorial.
PODS 2000: 76-85 |
196 | EE | Orna Kupferman,
Moshe Y. Vardi:
An automata-theortetic approach to modular model checking.
ACM Trans. Program. Lang. Syst. 22(1): 87-128 (2000) |
195 | EE | Orna Kupferman,
Moshe Y. Vardi,
Pierre Wolper:
An automata-theoretic approach to branching-time model checking.
J. ACM 47(2): 312-360 (2000) |
194 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction.
J. Comput. Syst. Sci. 61(2): 302-332 (2000) |
1999 |
193 | EE | Moshe Y. Vardi:
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach.
ARTS 1999: 265-276 |
192 | EE | Orna Kupferman,
Moshe Y. Vardi:
Model Checking of Safety Properties.
CAV 1999: 172-183 |
191 | EE | Marco Daniele,
Fausto Giunchiglia,
Moshe Y. Vardi:
Improved Automata Generation for Linear Temporal Logic.
CAV 1999: 249-260 |
190 | EE | Kathi Fisler,
Moshe Y. Vardi:
Bisimulation and Model Checking.
CHARME 1999: 338-341 |
189 | EE | Orna Kupferman,
Moshe Y. Vardi:
Vacuity Detection in Temporal Model Checking.
CHARME 1999: 82-96 |
188 | EE | Orna Kupferman,
Moshe Y. Vardi:
Robust Satisfaction.
CONCUR 1999: 383-398 |
187 | | Giuseppe De Giacomo,
Moshe Y. Vardi:
Automata-Theoretic Approach to Planning for Temporally Extended Goals.
ECP 1999: 226-238 |
186 | | Marco Daniele,
Paolo Traverso,
Moshe Y. Vardi:
Strong Cyclic Planning Revisited.
ECP 1999: 35-48 |
185 | | Doron Peled,
Moshe Y. Vardi,
Mihalis Yannakakis:
Black Box Checking.
FORTE 1999: 225-240 |
184 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Rewriting of Regular Expressions and Regular Path Queries.
PODS 1999: 194-204 |
183 | | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Rewriting of Regular Path Queries.
SEBD 1999: 213-224 |
182 | EE | Orna Kupferman,
Moshe Y. Vardi:
The Weakness of Self-Complementation.
STACS 1999: 455-466 |
181 | EE | Diego Calvanese,
Giuseppe De Giacomo,
Maurizio Lenzerini,
Moshe Y. Vardi:
Query Answering Using Views for Data Integration over the Web.
WebDB (Informal Proceedings) 1999: 73-78 |
180 | | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
Common Knowledge Revisited.
Ann. Pure Appl. Logic 96(1-3): 89-105 (1999) |
179 | EE | Orna Kupferman,
Moshe Y. Vardi:
Church's problem revisited.
Bulletin of Symbolic Logic 5(2): 245-263 (1999) |
178 | EE | Joan Feigenbaum,
Sampath Kannan,
Moshe Y. Vardi,
Mahesh Viswanathan:
The Complexity of Problems on Graphs Represented as OBDDs.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
177 | EE | Ranan Fraer,
Gila Kamhi,
Limor Fix,
Moshe Y. Vardi:
Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting.
Electr. Notes Theor. Comput. Sci. 23(2): (1999) |
176 | EE | Kenneth A. Ross,
Surajit Chaudhuri,
Gösta Grahne,
H. V. Jagadish,
Jan Van den Bussche,
Moshe Y. Vardi:
Reminiscences on Influential Papers.
SIGMOD Record 28(4): 39-41 (1999) |
1998 |
175 | | Alan J. Hu,
Moshe Y. Vardi:
Computer Aided Verification, 10th International Conference, CAV '98, Vancouver, BC, Canada, June 28 - July 2, 1998, Proceedings
Springer 1998 |
174 | EE | Moshe Y. Vardi:
Sometimes and Not Never Re-revisited: On Branching Versus Linear Time.
CONCUR 1998: 1-17 |
173 | EE | Rajeev Alur,
Thomas A. Henzinger,
Orna Kupferman,
Moshe Y. Vardi:
Alternating Refinement Relations.
CONCUR 1998: 163-178 |
172 | EE | Ron van der Meyden,
Moshe Y. Vardi:
Synthesis from Knowledge-Based Specifications (Extended Abstract).
CONCUR 1998: 34-49 |
171 | EE | Kathi Fisler,
Moshe Y. Vardi:
Bisimulation Minimization in an Automata-Theoretic Verification Framework.
FMCAD 1998: 115-132 |
170 | EE | Moshe Y. Vardi:
Reasoning about The Past with Two-Way Automata.
ICALP 1998: 628-641 |
169 | | Moshe Y. Vardi:
Linear vs. Branching Time: A Complexity-Theoretic Perspective.
LICS 1998: 394-405 |
168 | | Orna Kupferman,
Moshe Y. Vardi:
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time.
LICS 1998: 81-92 |
167 | EE | Phokion G. Kolaitis,
Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction.
PODS 1998: 205-213 |
166 | | Orna Kupferman,
Moshe Y. Vardi:
Relating linear and branching model checking.
PROCOMET 1998: 304-326 |
165 | EE | Kim B. Bruce,
Phokion G. Kolaitis,
Daniel Leivant,
Moshe Y. Vardi:
Panel: logic in the computer science curriculum.
SIGCSE 1998: 376-377 |
164 | | Joan Feigenbaum,
Sampath Kannan,
Moshe Y. Vardi,
Mahesh Viswanathan:
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract).
STACS 1998: 216-226 |
163 | EE | Orna Kupferman,
Moshe Y. Vardi:
Weak Alternating Automata and Tree Automata Emptiness.
STOC 1998: 224-233 |
162 | EE | Orna Kupferman,
Moshe Y. Vardi:
Verification of Fair Transition Systems.
Chicago J. Theor. Comput. Sci. 1998: (1998) |
161 | EE | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
Common knowledge revisited
CoRR cs.LO/9809003: (1998) |
160 | EE | Moshe Y. Vardi:
Computational Model Theory: An Overview.
Logic Journal of the IGPL 6(4): 601-623 (1998) |
159 | | Tomás Feder,
Moshe Y. Vardi:
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory.
SIAM J. Comput. 28(1): 57-104 (1998) |
1997 |
158 | | Moshe Y. Vardi:
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics.
CADE 1997: 191-206 |
157 | | Neil Immerman,
Moshe Y. Vardi:
Model Checking and Transitive-Closure Logic.
CAV 1997: 291-302 |
156 | | Orna Kupferman,
Moshe Y. Vardi:
Model Checking Revisited.
CAV 1997: 36-47 |
155 | EE | Orna Kupferman,
Moshe Y. Vardi:
Modular Model Checking.
COMPOS 1997: 381-401 |
154 | | David Harel,
Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Verifying Concurrent Transition Systems.
CONCUR 1997: 258-272 |
153 | EE | Moshe Y. Vardi:
Verification of Open Systems.
FSTTCS 1997: 250-266 |
152 | EE | Orna Kupferman,
Moshe Y. Vardi:
Weak Alternating Automata Are Not That Weak.
ISTCS 1997: 147-158 |
151 | EE | Kousha Etessami,
Moshe Y. Vardi,
Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic.
LICS 1997: 228-235 |
150 | EE | Erich Grädel,
Phokion G. Kolaitis,
Moshe Y. Vardi:
On the decision problem for two-variable first-order logic.
Bulletin of Symbolic Logic 3(1): 53-69 (1997) |
149 | EE | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
Knowledge-Based Programs.
Distributed Computing 10(4): 199-225 (1997) |
148 | EE | Serge Abiteboul,
Moshe Y. Vardi,
Victor Vianu:
Fixpoint logics, relational machines, and computational complexity.
J. ACM 44(1): 30-56 (1997) |
147 | | Surajit Chaudhuri,
Moshe Y. Vardi:
On the Equivalence of Recursive and Nonrecursive Datalog Programs.
J. Comput. Syst. Sci. 54(1): 61-78 (1997) |
146 | | Moshe Y. Vardi:
Special Selection in Logic in Computer Science.
J. Symb. Log. 62(2): 608 (1997) |
1996 |
145 | | Orna Kupferman,
Moshe Y. Vardi:
Verification of Fair Transisiton Systems.
CAV 1996: 372-382 |
144 | | Orna Kupferman,
Moshe Y. Vardi:
Module Checking.
CAV 1996: 75-86 |
143 | | Thomas A. Henzinger,
Orna Kupferman,
Moshe Y. Vardi:
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking.
CONCUR 1996: 514-529 |
142 | | Moshe Y. Vardi:
Why is Modal Logic So Robustly Decidable?
Descriptive Complexity and Finite Models 1996: 149-184 |
141 | EE | Surajit Chaudhuri,
Ashok K. Chandra,
Umeshwar Dayal,
Jim Gray,
Michael Stonebraker,
Gio Wiederhold,
Moshe Y. Vardi:
Database Research: Lead, Follow, or Get Out of the Way? - Panel Abstract.
ICDE 1996: 190 |
140 | | Orna Kupferman,
Shmuel Safra,
Moshe Y. Vardi:
Relating Word and Tree Automata.
LICS 1996: 322-332 |
139 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
On the Expressive Power of Variable-Confined Logics.
LICS 1996: 348-359 |
138 | EE | Serge Abiteboul,
Gabriel M. Kuper,
Christos H. Papadimitriou,
Moshe Y. Vardi:
In Memoriam: Paris C. Kanellakis.
PODS 1996: 79 |
137 | | Moshe Y. Vardi:
Implementing Knowledge-Based Programs.
TARK 1996: 15-30 |
136 | | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
Common Knowledge Revisited.
TARK 1996: 283-298 |
135 | EE | Serge Abiteboul,
Gabriel M. Kuper,
Harry G. Mairson,
Alexander A. Shvartsman,
Moshe Y. Vardi:
In Memoriam Paris C. Kanellakis.
ACM Comput. Surv. 28(1): 3-15 (1996) |
134 | EE | Moshe Y. Vardi:
Rank Predicates vs. Progress Measures in Concurrent-Program Verification.
Chicago J. Theor. Comput. Sci. 1996: (1996) |
133 | | Moshe Y. Vardi:
In Memoriam: Paris C. Kanellakis (1953-1995).
Inf. Comput. 127(2): 65 (1996) |
1995 |
132 | | Georg Gottlob,
Moshe Y. Vardi:
Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings
Springer 1995 |
131 | | Moshe Y. Vardi:
An Automata-Theoretic Approach to Linear Temporal Logic.
Banff Higher Order Workshop 1995: 238-266 |
130 | | Moshe Y. Vardi:
An Automata-Theoretic Approach to Fair Realizability and Synthesis.
CAV 1995: 267-278 |
129 | | Orna Kupferman,
Moshe Y. Vardi:
On the Complexity of Branching Modular Model Checking (Extended Abstract).
CONCUR 1995: 408-422 |
128 | | Moshe Y. Vardi:
On the Complexity of Modular Model Checking
LICS 1995: 101-111 |
127 | | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
Knowledge-Based Programs.
PODC 1995: 153-163 |
126 | EE | Moshe Y. Vardi:
On the Complexity of Bounded-Variable Queries.
PODS 1995: 266-276 |
125 | | Rob Gerth,
Doron Peled,
Moshe Y. Vardi,
Pierre Wolper:
Simple on-the-fly automatic verification of linear temporal logic.
PSTV 1995: 3-18 |
124 | | Moshe Y. Vardi:
Alternating Automata and Program Verification.
Computer Science Today 1995: 471-485 |
123 | EE | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
A Nonstandard Approach to the Logical Omniscience Problem.
Artif. Intell. 79(2): 203-240 (1995) |
122 | | Ronald Fagin,
Larry J. Stockmeyer,
Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP
Inf. Comput. 120(1): 78-92 (1995) |
121 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study.
J. Comput. Syst. Sci. 51(1): 110-134 (1995) |
120 | | Gerd G. Hillebrand,
Paris C. Kanellakis,
Harry G. Mairson,
Moshe Y. Vardi:
Undecidable Boundedness Problems for Datalog Programs.
J. Log. Program. 25(2): 163-190 (1995) |
119 | EE | Serge Abiteboul,
Moshe Y. Vardi,
Victor Vianu:
Computing with Infinitary Logic.
Theor. Comput. Sci. 149(1): 101-128 (1995) |
1994 |
118 | | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
An Operational Semantics for Knowledge Bases.
AAAI 1994: 1142-1147 |
117 | | Orna Bernholtz,
Moshe Y. Vardi,
Pierre Wolper:
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract).
CAV 1994: 142-155 |
116 | EE | Surajit Chaudhuri,
Moshe Y. Vardi:
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs.
PODS 1994: 107-116 |
115 | | Moshe Y. Vardi:
Nontraditional Applications of Automata Theory.
TACS 1994: 575-597 |
114 | | Joseph Y. Halpern,
Yoram Moses,
Moshe Y. Vardi:
Algorithmic Knowledge.
TARK 1994: 255-266 |
113 | | Moshe Y. Vardi,
Pierre Wolper:
Reasoning About Infinite Computations
Inf. Comput. 115(1): 1-37 (1994) |
1993 |
112 | | Alexander Aiken,
Dexter Kozen,
Moshe Y. Vardi,
Edward L. Wimmers:
The Complexity of Set Constraints.
CSL 1993: 1-17 |
111 | EE | Surajit Chaudhuri,
Moshe Y. Vardi:
Optimization of Real Conjunctive Queries.
PODS 1993: 59-70 |
110 | EE | Rajeev Alur,
Thomas A. Henzinger,
Moshe Y. Vardi:
Parametric real-time reasoning.
STOC 1993: 592-601 |
109 | EE | Tomás Feder,
Moshe Y. Vardi:
Monotone monadic SNP and constraint satisfaction.
STOC 1993: 612-622 |
108 | | Ronald Fagin,
Larry J. Stockmeyer,
Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP (Extended Abstract).
Structure in Complexity Theory Conference 1993: 19-30 |
107 | EE | Gabriel M. Kuper,
Moshe Y. Vardi:
The Logical Data Model.
ACM Trans. Database Syst. 18(3): 379-413 (1993) |
106 | EE | Haim Gaifman,
Harry G. Mairson,
Yehoshua Sagiv,
Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs.
J. ACM 40(3): 683-713 (1993) |
105 | | Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Moshe Y. Vardi:
Logical Query Optimization by Proff-Tree Transformation.
J. Comput. Syst. Sci. 47(1): 222-248 (1993) |
104 | | Gabriel M. Kuper,
Moshe Y. Vardi:
On the Complexity of Queries in the Logical Data Model.
Theor. Comput. Sci. 116(1&2): 33-57 (1993) |
1992 |
103 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Infinitary Logic for Computer Science.
ICALP 1992: 450-473 |
102 | EE | Serge Abiteboul,
Moshe Y. Vardi,
Victor Vianu:
Computing with Infinitary Logic.
ICDT 1992: 113-123 |
101 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory
LICS 1992: 46-57 |
100 | EE | Surajit Chaudhuri,
Moshe Y. Vardi:
On the Equivalence of Recursive and Nonrecursive Datalog Programs.
PODS 1992: 55-66 |
99 | | Serge Abiteboul,
Moshe Y. Vardi,
Victor Vianu:
Fixpoint Logics, Relational Machines, and Computational Complexity.
Structure in Complexity Theory Conference 1992: 156-168 |
98 | | Ronald Fagin,
John Geanakoplos,
Joseph Y. Halpern,
Moshe Y. Vardi:
The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge.
TARK 1992: 229-244 |
97 | | Moshe Y. Vardi:
Automata Theory for Database Theoreticans.
Theoretical Studies in Computer Science 1992: 153-180 |
96 | | Costas Courcoubetis,
Moshe Y. Vardi,
Pierre Wolper,
Mihalis Yannakakis:
Memory-Efficient Algorithms for the Verification of Temporal Properties.
Formal Methods in System Design 1(2/3): 275-288 (1992) |
95 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Infinitary Logics and 0-1 Laws
Inf. Comput. 98(2): 258-294 (1992) |
94 | EE | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
What Can Machines Know? On the Properties of Knowledge in Distributed Systems.
J. ACM 39(2): 328-376 (1992) |
93 | | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
What Is an Inference Rule?
J. Symb. Log. 57(3): 1018-1045 (1992) |
1991 |
92 | | Joseph Y. Halpern,
Moshe Y. Vardi:
Model Checking vs. Theorem Proving: A Manifesto.
KR 1991: 325-334 |
91 | | Thom W. Frühwirth,
Ehud Y. Shapiro,
Moshe Y. Vardi,
Eyal Yardeni:
Logic Programs as Types for Logic Programs
LICS 1991: 300-309 |
90 | EE | Gerd G. Hillebrand,
Paris C. Kanellakis,
Harry G. Mairson,
Moshe Y. Vardi:
Tools for Datalog Boundedness.
PODS 1991: 1-12 |
89 | | Moshe Y. Vardi:
Verification of Concurrent Programs: The Automata-Theoretic Framework.
Ann. Pure Appl. Logic 51(1-2): 79-98 (1991) |
88 | EE | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
A Model-Theoretic Analysis of Knowledge.
J. ACM 38(2): 382-428 (1991) |
87 | | Moshe Y. Vardi:
Database Logic Programming.
J. Log. Program. 10(1/2/3&4): 179-180 (1991) |
1990 |
86 | | Costas Courcoubetis,
Moshe Y. Vardi,
Pierre Wolper,
Mihalis Yannakakis:
Memory Efficient Algorithms for the Verification of Temporal Properties.
CAV 1990: 233-242 |
85 | | Moshe Y. Vardi:
Global Optimization Problems for Database Logic Programs.
ICLP 1990: 767-771 |
84 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws for Infinitary Logics (Preliminary Report)
LICS 1990: 156-167 |
83 | | David Harel,
Roni Rosner,
Moshe Y. Vardi:
On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report)
LICS 1990: 478-488 |
82 | EE | Phokion G. Kolaitis,
Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study.
PODS 1990: 61-71 |
81 | | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
A Nonstandard Approach to the Logical Omniscience Problem.
TARK 1990: 41-55 |
80 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws and Decision Problems for Fragments of Second-Order Logic
Inf. Comput. 87(1/2): 301-337 (1990) |
79 | | Moshe Y. Vardi:
Endmarkers can Make a Difference.
Inf. Process. Lett. 35(3): 145-148 (1990) |
78 | EE | Stavros S. Cosmadakis,
Paris C. Kanellakis,
Moshe Y. Vardi:
Polynomial-Time Implication Problems for Unary Inclusion Dependencies
J. ACM 37(1): 15-46 (1990) |
1989 |
77 | | Moshe Y. Vardi:
On the Complexity of Epistemic Reasoning
LICS 1989: 243-252 |
76 | EE | Yehoshua Sagiv,
Moshe Y. Vardi:
Safety of Datalog Queries over Infinite Databases.
PODS 1989: 160-171 |
75 | EE | Raghu Ramakrishnan,
Yehoshua Sagiv,
Jeffrey D. Ullman,
Moshe Y. Vardi:
Proof-Tree Transformation Theorems and Their Applications.
PODS 1989: 172-181 |
74 | EE | Moshe Y. Vardi:
Automata Theory for Database Theoreticans.
PODS 1989: 83-92 |
73 | | Shmuel Safra,
Moshe Y. Vardi:
On omega-Automata and Temporal Logic (Preliminary Report)
STOC 1989: 127-137 |
72 | | Moshe Y. Vardi:
A Note on the Reduction of Two-Way Automata to One-Way Automata.
Inf. Process. Lett. 30(5): 261-264 (1989) |
71 | | Joseph Y. Halpern,
Moshe Y. Vardi:
The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds.
J. Comput. Syst. Sci. 38(1): 195-237 (1989) |
1988 |
70 | | Moshe Y. Vardi:
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, Pacific Grove, CA, March 1988
Morgan Kaufmann 1988 |
69 | | Moshe Y. Vardi:
An Automata-Theoretic Approach to Protocol Verification (Abstract).
Concurrency 1988: 73 |
68 | EE | Gabriel M. Kuper,
Moshe Y. Vardi:
On the Complexity of Queries in the Logical Data Model (Extended Abstract).
ICDT 1988: 267-280 |
67 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws and Decision Problems for Fragments of Second-Order Logic
LICS 1988: 2-11 |
66 | EE | Moshe Y. Vardi:
Decidability and Undecidability Results for Boundedness of Linear Recursive Queries.
PODS 1988: 341-351 |
65 | EE | Jeffrey D. Ullman,
Moshe Y. Vardi:
The Complexity of Ordering Subgoals.
PODS 1988: 74-81 |
64 | | Moshe Y. Vardi:
A Temporal Fixpoint Calculus.
POPL 1988: 250-259 |
63 | EE | Moshe Y. Vardi:
Database Logic Programming, Deductive Databases, and Expert Database Systems.
SIGMOD Conference 1988: 7 |
62 | | Stavros S. Cosmadakis,
Haim Gaifman,
Paris C. Kanellakis,
Moshe Y. Vardi:
Decidable Optimization Problems for Database Logic Programs (Preliminary Report)
STOC 1988: 477-490 |
61 | | Joseph Y. Halpern,
Moshe Y. Vardi:
Reasoning about Knowledge and Time in Asynchronous Systems
STOC 1988: 53-65 |
60 | | Moshe Y. Vardi:
The Universal-Relation Data Model for Logic Independence.
IEEE Software 5(2): 80-85 (1988) |
59 | | Moshe Y. Vardi:
Response to a Letter to the Editor.
IEEE Software 5(4): 4-6 (1988) |
1987 |
58 | | Haim Gaifman,
Harry G. Mairson,
Yehoshua Sagiv,
Moshe Y. Vardi:
Undecidable Optimization Problems for Database Logic Programs
LICS 1987: 106-115 |
57 | | Moshe Y. Vardi:
Verification of Concurrent Programs: The Automata-Theoretic Framework
LICS 1987: 167-176 |
56 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
The Decision Problem for the Probabilities of Higher-Order Properties
STOC 1987: 425-435 |
55 | | Moshe Y. Vardi:
Unified Verification Theory.
Temporal Logic in Specification 1987: 202-212 |
54 | | A. Prasad Sistla,
Moshe Y. Vardi,
Pierre Wolper:
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic.
Theor. Comput. Sci. 49: 217-237 (1987) |
1986 |
53 | | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
What Can Machines Know? On the Epistemic Properties of Machines.
AAAI 1986: 428-435 |
52 | | Moshe Y. Vardi,
Pierre Wolper:
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
LICS 1986: 332-344 |
51 | EE | Moshe Y. Vardi:
On the Integrity of Databases with Incomplete Information.
PODS 1986: 252-266 |
50 | | Costas Courcoubetis,
Moshe Y. Vardi,
Pierre Wolper:
Reasoning about Fair Concurrent Programs
STOC 1986: 283-294 |
49 | | Joseph Y. Halpern,
Moshe Y. Vardi:
The Complexity of Reasoning about Knowledge and Time: Extended Abstract
STOC 1986: 304-315 |
48 | | Ronald Fagin,
Moshe Y. Vardi:
Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report.
TARK 1986: 187-206 |
47 | | Moshe Y. Vardi:
On Epistemic Logic and Logical Omniscience.
TARK 1986: 293-305 |
46 | | Johann A. Makowsky,
Moshe Y. Vardi:
On the Expressive Power of Data Dependencies.
Acta Inf. 23(3): 231-244 (1986) |
45 | | Ronald Fagin,
Gabriel M. Kuper,
Jeffrey D. Ullman,
Moshe Y. Vardi:
Updating Logical Databases.
Advances in Computing Research 3: 1-18 (1986) |
44 | EE | Marc H. Graham,
Alberto O. Mendelzon,
Moshe Y. Vardi:
Notions of dependency satisfaction.
J. ACM 33(1): 105-129 (1986) |
43 | | Moshe Y. Vardi,
Pierre Wolper:
Automata-Theoretic Techniques for Modal Logics of Programs.
J. Comput. Syst. Sci. 32(2): 183-221 (1986) |
42 | | Moshe Y. Vardi:
Querying Logical Databases.
J. Comput. Syst. Sci. 33(2): 142-160 (1986) |
1985 |
41 | | Moshe Y. Vardi:
Automatic Verification of Probabilistic Concurrent Finite-State Programs
FOCS 1985: 327-338 |
40 | | A. Prasad Sistla,
Moshe Y. Vardi,
Pierre Wolper:
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract).
ICALP 1985: 465-474 |
39 | | Moshe Y. Vardi:
A Model-Theoretic Analysis of Monotonic Knowledge.
IJCAI 1985: 509-512 |
38 | | Moshe Y. Vardi:
The Taming of Converse: Reasoning about Two-way Computations.
Logic of Programs 1985: 413-423 |
37 | EE | Moshe Y. Vardi:
Querying Logical Databases.
PODS 1985: 57-65 |
36 | EE | Gabriel M. Kuper,
Moshe Y. Vardi:
On the Expressive Power of the Logical Data Model (Preliminary Report).
SIGMOD Conference 1985: 180-187 |
35 | | Moshe Y. Vardi,
Larry J. Stockmeyer:
Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report
STOC 1985: 240-251 |
34 | | Ronald Fagin,
Moshe Y. Vardi:
An Internal Semantics for Modal Logic: Preliminary Report
STOC 1985: 305-315 |
33 | | Haim Gaifman,
Moshe Y. Vardi:
A simple proof that connectivity of finite graphs is not first-order definable.
Bulletin of the EATCS 26: 43-44 (1985) |
32 | | Moshe Y. Vardi:
A responce to "A complete axiomatisation for full join dependencies in relations".
Bulletin of the EATCS 26: 65-66 (1985) |
31 | | Ashok K. Chandra,
Moshe Y. Vardi:
The Implication Problem for Functional and Inclusion Dependencies is Undecidable.
SIAM J. Comput. 14(3): 671-677 (1985) |
30 | | Catriel Beeri,
Moshe Y. Vardi:
Formal Systems for Join Dependencies.
Theor. Comput. Sci. 38: 99-116 (1985) |
1984 |
29 | | Ronald Fagin,
Joseph Y. Halpern,
Moshe Y. Vardi:
A Model-Theoretic Analysis of Knowledge: Preliminary Report
FOCS 1984: 268-278 |
28 | | Ronald Fagin,
Moshe Y. Vardi:
The Theory of Data Dependencies - An Overview.
ICALP 1984: 1-22 |
27 | EE | Gabriel M. Kuper,
Jeffrey D. Ullman,
Moshe Y. Vardi:
On the Equivalence of Logical Databases.
PODS 1984: 221-228 |
26 | EE | Marc H. Graham,
Moshe Y. Vardi:
On the Complexity and Axiomatizability of Consistent Database States.
PODS 1984: 281-289 |
25 | EE | Gabriel M. Kuper,
Moshe Y. Vardi:
A New Approach to Database Logic.
PODS 1984: 86-96 |
24 | | Moshe Y. Vardi,
Pierre Wolper:
Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract)
STOC 1984: 446-456 |
23 | EE | David Maier,
Jeffrey D. Ullman,
Moshe Y. Vardi:
On the Foundations of the Universal Relation Model.
ACM Trans. Database Syst. 9(2): 283-308 (1984) |
22 | | Moshe Y. Vardi:
A Note on Lossless Database Decompositions.
Inf. Process. Lett. 18(5): 257-260 (1984) |
21 | | Catriel Beeri,
Moshe Y. Vardi:
On Acyclic Database Decompositions
Information and Control 61(2): 75-84 (1984) |
20 | EE | Catriel Beeri,
Moshe Y. Vardi:
A Proof Procedure for Data Dependencies.
J. ACM 31(4): 718-741 (1984) |
19 | | Moshe Y. Vardi:
The Implication and Finite Implication Problems for Typed Template Dependencies.
J. Comput. Syst. Sci. 28(1): 3-28 (1984) |
18 | | Catriel Beeri,
Moshe Y. Vardi:
Formal Systems for Tuple and Equality Generating Dependencies.
SIAM J. Comput. 13(1): 76-98 (1984) |
1983 |
17 | | Pierre Wolper,
Moshe Y. Vardi,
A. Prasad Sistla:
Reasoning about Infinite Computation Paths (Extended Abstract)
FOCS 1983: 185-194 |
16 | | Moshe Y. Vardi,
Pierre Wolper:
Yet Another Process Logic (Preliminary Version).
Logic of Programs 1983: 501-512 |
15 | EE | David Maier,
Jeffrey D. Ullman,
Moshe Y. Vardi:
The Revenge of the JD.
PODS 1983: 279-287 |
14 | EE | Ronald Fagin,
Jeffrey D. Ullman,
Moshe Y. Vardi:
On the Semantics of Updates in Databases.
PODS 1983: 352-365 |
13 | | Paris C. Kanellakis,
Stavros S. Cosmadakis,
Moshe Y. Vardi:
Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract)
STOC 1983: 264-277 |
12 | EE | Moshe Y. Vardi:
Second-Order Dependency Theory.
XP4.5 Workshop on Database Theory 1983 |
11 | | Moshe Y. Vardi:
Inferring Multivalued Dependencies From Functional and Join Dependencies.
Acta Inf. 19: 305-324 (1983) |
10 | | Ronald Fagin,
Moshe Y. Vardi:
Armstrong Databases for Functional and Inclusion Dependencies.
Inf. Process. Lett. 16(1): 13-19 (1983) |
1982 |
9 | | Moshe Y. Vardi:
On Decomposition of Relational Databases
FOCS 1982: 176-185 |
8 | EE | Moshe Y. Vardi:
The Implication and Finite Implication Problems for Typed Template Dependencies.
PODS 1982: 230-238 |
7 | | Moshe Y. Vardi:
The Complexity of Relational Query Languages (Extended Abstract)
STOC 1982: 137-146 |
1981 |
6 | | Moshe Y. Vardi:
Global Decision Problems for Relational Databases
FOCS 1981: 198-202 |
5 | | Catriel Beeri,
Moshe Y. Vardi:
The Implication Problem for Data Dependencies.
ICALP 1981: 73-85 |
4 | | Moshe Y. Vardi:
The Decision Problem for Database Dependencies.
Inf. Process. Lett. 12(5): 251-254 (1981) |
3 | EE | Catriel Beeri,
Moshe Y. Vardi:
A Note on Decompositions of Relational Databases.
SIGMOD Record 12(1): 33-37 (1981) |
1980 |
2 | EE | Catriel Beeri,
Moshe Y. Vardi:
Decision Problems for Data Dependencies.
XP1 Workshop on Database Theory 1980 |
1979 |
1 | | Catriel Beeri,
Moshe Y. Vardi:
On the Properties of Join Dependencies.
Advances in Data Base Theory 1979: 25-71 |