Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
Moshe Y. Vardi. Logical Algorithmics: From Theory to Practice (Invited Talk). In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, p. 6:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{vardi:LIPIcs.CSL.2024.6, author = {Vardi, Moshe Y.}, title = {{Logical Algorithmics: From Theory to Practice}}, booktitle = {32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)}, pages = {6:1--6:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-310-2}, ISSN = {1868-8969}, year = {2024}, volume = {288}, editor = {Murano, Aniello and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.6}, URN = {urn:nbn:de:0030-drops-196494}, doi = {10.4230/LIPIcs.CSL.2024.6}, annote = {Keywords: Logic, Algorithms} }
Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Yong Li, Sven Schewe, and Moshe Y. Vardi. Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{li_et_al:LIPIcs.CONCUR.2023.37, author = {Li, Yong and Schewe, Sven and Vardi, Moshe Y.}, title = {{Singly Exponential Translation of Alternating Weak B\"{u}chi Automata to Unambiguous B\"{u}chi Automata}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.37}, URN = {urn:nbn:de:0030-drops-190313}, doi = {10.4230/LIPIcs.CONCUR.2023.37}, annote = {Keywords: B\"{u}chi automata, unambiguous automata, alternation, weak, disambiguation} }
Published in: LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
Dror Fried, Alexander Nadel, and Yogev Shalmon. AllSAT for Combinational Circuits. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 271, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{fried_et_al:LIPIcs.SAT.2023.9, author = {Fried, Dror and Nadel, Alexander and Shalmon, Yogev}, title = {{AllSAT for Combinational Circuits}}, booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-286-0}, ISSN = {1868-8969}, year = {2023}, volume = {271}, editor = {Mahajan, Meena and Slivovsky, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.9}, URN = {urn:nbn:de:0030-drops-184717}, doi = {10.4230/LIPIcs.SAT.2023.9}, annote = {Keywords: AllSAT, SAT, Circuits} }
Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Moshe Y. Vardi. Logical Algorithmics: From Theory to Practice (Invited Talk). In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{vardi:LIPIcs.STACS.2023.3, author = {Vardi, Moshe Y.}, title = {{Logical Algorithmics: From Theory to Practice}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.3}, URN = {urn:nbn:de:0030-drops-176555}, doi = {10.4230/LIPIcs.STACS.2023.3}, annote = {Keywords: Logic, Algorithms} }
Published in: LIPIcs, Volume 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022)
Moshe Y. Vardi. Linear Temporal Logic: From Infinite to Finite Horizon (Invited Talk). In 29th International Symposium on Temporal Representation and Reasoning (TIME 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 247, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vardi:LIPIcs.TIME.2022.1, author = {Vardi, Moshe Y.}, title = {{Linear Temporal Logic: From Infinite to Finite Horizon}}, booktitle = {29th International Symposium on Temporal Representation and Reasoning (TIME 2022)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-262-4}, ISSN = {1868-8969}, year = {2022}, volume = {247}, editor = {Artikis, Alexander and Posenato, Roberto and Tonetta, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2022.1}, URN = {urn:nbn:de:0030-drops-172481}, doi = {10.4230/LIPIcs.TIME.2022.1}, annote = {Keywords: Temporal Logic} }
Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Jeffrey M. Dudek and Dror Fried. Transformations of Boolean Functions. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dudek_et_al:LIPIcs.FSTTCS.2019.39, author = {Dudek, Jeffrey M. and Fried, Dror}, title = {{Transformations of Boolean Functions}}, booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-131-3}, ISSN = {1868-8969}, year = {2019}, volume = {150}, editor = {Chattopadhyay, Arkadev and Gastin, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.39}, URN = {urn:nbn:de:0030-drops-116019}, doi = {10.4230/LIPIcs.FSTTCS.2019.39}, annote = {Keywords: Boolean Formulas, Boolean Functions, Transformations, Model Counting} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Laure Daviaud, Marcin Jurdziński, and Karoliina Lehtinen. Alternating Weak Automata from Universal Trees. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{daviaud_et_al:LIPIcs.CONCUR.2019.18, author = {Daviaud, Laure and Jurdzi\'{n}ski, Marcin and Lehtinen, Karoliina}, title = {{Alternating Weak Automata from Universal Trees}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.18}, URN = {urn:nbn:de:0030-drops-109208}, doi = {10.4230/LIPIcs.CONCUR.2019.18}, annote = {Keywords: alternating automata, weak automata, B\"{u}chi automata, parity automata, parity games, universal trees} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Moshe Y. Vardi. The Siren Song of Temporal Synthesis (Invited Talk). In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vardi:LIPIcs.CONCUR.2018.1, author = {Vardi, Moshe Y.}, title = {{The Siren Song of Temporal Synthesis}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.1}, URN = {urn:nbn:de:0030-drops-95393}, doi = {10.4230/LIPIcs.CONCUR.2018.1}, annote = {Keywords: Formal Methods, Temporal Synthesis} }
Published in: LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Orna Kupferman, Gal Vardi, and Moshe Y. Vardi. Flow Games. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kupferman_et_al:LIPIcs.FSTTCS.2017.38, author = {Kupferman, Orna and Vardi, Gal and Vardi, Moshe Y.}, title = {{Flow Games}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-055-2}, ISSN = {1868-8969}, year = {2018}, volume = {93}, editor = {Lokam, Satya and Ramanujam, R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.38}, URN = {urn:nbn:de:0030-drops-83738}, doi = {10.4230/LIPIcs.FSTTCS.2017.38}, annote = {Keywords: Flow networks, Two-player Games, Algorithms} }
Published in: LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Kuldeep S. Meel, Aditya A. Shrotri, and Moshe Y. Vardi. On Hashing-Based Approaches to Approximate DNF-Counting. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{meel_et_al:LIPIcs.FSTTCS.2017.41, author = {Meel, Kuldeep S. and Shrotri, Aditya A. and Vardi, Moshe Y.}, title = {{On Hashing-Based Approaches to Approximate DNF-Counting}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-055-2}, ISSN = {1868-8969}, year = {2018}, volume = {93}, editor = {Lokam, Satya and Ramanujam, R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.41}, URN = {urn:nbn:de:0030-drops-84073}, doi = {10.4230/LIPIcs.FSTTCS.2017.41}, annote = {Keywords: Model Counting, Approximation, DNF, Hash Functions} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Juan L. Reutter, Miguel Romero, and Moshe Y. Vardi. Regular Queries on Graph Databases. In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 177-194, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{reutter_et_al:LIPIcs.ICDT.2015.177, author = {Reutter, Juan L. and Romero, Miguel and Vardi, Moshe Y.}, title = {{Regular Queries on Graph Databases}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {177--194}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-79-8}, ISSN = {1868-8969}, year = {2015}, volume = {31}, editor = {Arenas, Marcelo and Ugarte, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.177}, URN = {urn:nbn:de:0030-drops-49842}, doi = {10.4230/LIPIcs.ICDT.2015.177}, annote = {Keywords: graph databases, conjunctive regular path queries, regular queries, containment.} }
Published in: Dagstuhl Reports, Volume 4, Issue 6 (2015)
Jakob Rehof and Moshe Y. Vardi. Design and Synthesis from Components (Dagstuhl Seminar 14232). In Dagstuhl Reports, Volume 4, Issue 6, pp. 29-47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Article{rehof_et_al:DagRep.4.6.29, author = {Rehof, Jakob and Vardi, Moshe Y.}, title = {{Design and Synthesis from Components (Dagstuhl Seminar 14232)}}, pages = {29--47}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2014}, volume = {4}, number = {6}, editor = {Rehof, Jakob and Vardi, Moshe Y.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.6.29}, URN = {urn:nbn:de:0030-drops-46839}, doi = {10.4230/DagRep.4.6.29}, annote = {Keywords: Component design, Component-based synthesis} }
Published in: Dagstuhl Reports, Volume 2, Issue 11 (2013)
Kurt Mehlhorn, Moshe Y. Vardi, and Marc Herbstritt. Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). In Dagstuhl Reports, Volume 2, Issue 11, pp. 20-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{mehlhorn_et_al:DagRep.2.11.20, author = {Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc}, title = {{Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452)}}, pages = {20--44}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {2}, number = {11}, editor = {Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.20}, URN = {urn:nbn:de:0030-drops-39778}, doi = {10.4230/DagRep.2.11.20}, annote = {Keywords: scholarly publishing, conference, journal, peer review, open archive, open access, indexing, research evaluation} }
Published in: LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Moshe Y. Vardi. Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{vardi:LIPIcs.FSTTCS.2011.3, author = {Vardi, Moshe Y.}, title = {{Constraints, Graphs, Algebra, Logic, and Complexity}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {3--3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-34-7}, ISSN = {1868-8969}, year = {2011}, volume = {13}, editor = {Chakraborty, Supratik and Kumar, Amit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.3}, URN = {urn:nbn:de:0030-drops-33580}, doi = {10.4230/LIPIcs.FSTTCS.2011.3}, annote = {Keywords: constraint satisfaction, NP completeness, dichotomy} }
Published in: Dagstuhl Manifestos, Volume 1, Issue 1 (2011)
Jörg Kreiker, Andrzej Tarlecki, Moshe Y. Vardi, and Reinhard Wilhelm. Modeling, Analysis, and Verification - The Formal Methods Manifesto 2010 (Dagstuhl Perspectives Workshop 10482). In Dagstuhl Manifestos, Volume 1, Issue 1, pp. 21-40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@Article{kreiker_et_al:DagMan.1.1.21, author = {Kreiker, J\"{o}rg and Tarlecki, Andrzej and Vardi, Moshe Y. and Wilhelm, Reinhard}, title = {{Modeling, Analysis, and Verification - The Formal Methods Manifesto 2010 (Dagstuhl Perspectives Workshop 10482)}}, pages = {21--40}, journal = {Dagstuhl Manifestos}, ISSN = {2193-2433}, year = {2011}, volume = {1}, number = {1}, editor = {Kreiker, J\"{o}rg and Tarlecki, Andrzej and Vardi, Moshe Y. and Wilhelm, Reinhard}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagMan.1.1.21}, URN = {urn:nbn:de:0030-drops-32121}, doi = {10.4230/DagMan.1.1.21}, annote = {Keywords: Formal methods, Verification, Analysis, Modeling, Design for Verifiability} }
Feedback for Dagstuhl Publishing