The Temporal Logic Sugar. - Ilan Beer; Shoham Ben-David; Cindy Eisner; Dana Fisman; Anna Gringauze; Yoav Rodeh (CAV, 2001)

Beyond Regular Model Checking. - Dana Fisman; Amir Pnueli (FSTTCS, 2001)

Reasoning with Temporal Logic on Truncated Paths. - Cindy Eisner; Dana Fisman; John Havlicek; Yoad Lustig; Anthony McIsaac; David Van Campenhout (CAV, 2003)

The Definition of a Temporal Clock Operator. - Cindy Eisner; Dana Fisman; John Havlicek; Anthony McIsaac; David Van Campenhout (ICALP, 2003)

The Safety Simple Subset. - Shoham Ben-David; Dana Fisman; Sitvanit Ruah (Haifa Verification Conference, 2005)

A topological characterization of weakness. - Cindy Eisner; Dana Fisman; John Havlicek (PODC, 2005)

A Practical Introduction to PSL - Cindy Eisner; Dana Fisman (Springer, 2006)

Temporal Antecedent Failure: Refining Vacuity. - Shoham Ben-David; Dana Fisman; Sitvanit Ruah (CONCUR, 2007)

On the Characterization of Until as a Fixed Point Under Clocked Semantics. - Dana Fisman (Haifa Verification Conference, 2007)

Augmenting a Regular Expression-Based Temporal Logic with Local Variables. - Cindy Eisner; Dana Fisman (FMCAD, 2008)

Structural Contradictions. - Cindy Eisner; Dana Fisman (Haifa Verification Conference, 2008)

A Framework for Inherent Vacuity. - Dana Fisman; Orna Kupferman; Sarai Sheinvald-Faragy; Moshe Y. Vardi (Haifa Verification Conference, 2008)

On Verifying Fault Tolerance of Distributed Protocols. - Dana Fisman; Orna Kupferman; Yoad Lustig (TACAS, 2008)

Embedding finite automata within regular expressions. - Shoham Ben-David; Dana Fisman; Sitvanit Ruah (Theor. Comput. Sci., 2008)

Reasoning about Finite-State Switched Systems. - Dana Fisman; Orna Kupferman (Haifa Verification Conference, 2009)

Rational Synthesis. - Dana Fisman; Orna Kupferman; Yoad Lustig (TACAS, 2010)

SVA and PSL Local Variables - A Practical Approach. - Roy Armoni; Dana Fisman; Naiyong Jin (CAV, 2013)

Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations. - Cindy Eisner; Dana Fisman; John Havlicek (ACM Trans. Comput. Log., 2014)

A Modular Approach for Büchi Determinization. - Dana Fisman; Yoad Lustig (CONCUR, 2015)

Learning Regular Languages via Alternating Automata. - Dana Angluin; Sarah Eisenstat; Dana Fisman (IJCAI, 2015)

Results and Analysis of SyGuS-Comp'15. - Rajeev Alur; Dana Fisman; Rishabh Singh; Armando Solar-Lezama (SYNT, 2015)

Vacuity in practice: temporal antecedent failure. - Shoham Ben-David; Fady Copty; Dana Fisman; Sitvanit Ruah (Formal Methods Syst. Des., 2015)

Syntax-Guided Synthesis. - Rajeev Alur; Rastislav Bodík; Eric Dallal; Dana Fisman; Pranav Garg 001; Garvit Juniwal; Hadas Kress-Gazit; P. Madhusudan; Milo M. K. Martin; Mukund Raghothaman; Shambwaditya Saha; Sanjit A. Seshia; et al. (Dependable Software Systems Engineering, 2015)

Regular Programming for Quantitative Properties of Data Streams. - Rajeev Alur; Dana Fisman; Mukund Raghothaman (ESOP, 2016)

A Complexity Measure on Büchi Automata. - Dana Fisman (LATA, 2016)

Families of DFAs as Acceptors of omega-Regular Languages. - Dana Angluin; Udi Boker; Dana Fisman (MFCS, 2016)

SyGuS-Comp 2016: Results and Analysis. - Rajeev Alur; Dana Fisman; Rishabh Singh; Armando Solar-Lezama (SYNT@CAV, 2016)

Learning regular omega languages. - Dana Angluin; Dana Fisman (Theor. Comput. Sci., 2016)

Query Learning of Derived Omega-Tree Languages in Polynomial Time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CSL, 2017)

SyGuS-Comp 2017: Results and Analysis. - Rajeev Alur; Dana Fisman; Rishabh Singh; Armando Solar-Lezama (SYNT@CAV, 2017)

Temporal Reasoning on Incomplete Paths. - Dana Fisman; Hillel Kugler (ISoLA (2), 2018)

Search-based program synthesis. - Rajeev Alur; Rishabh Singh; Dana Fisman; Armando Solar-Lezama (Commun. ACM, 2018)

Query learning of derived ω-tree languages in polynomial time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CoRR, 2018)

Regular omega-Languages with an Informative Right Congruence. - Dana Angluin; Dana Fisman (GandALF, 2018)

Inferring regular languages and ω-languages. - Dana Fisman (J. Log. Algebraic Methods Program., 2018)

Families of DFAs as Acceptors of ω-Regular Languages. - Dana Angluin; Udi Boker; Dana Fisman (Log. Methods Comput. Sci., 2018)

Functional Specification of Hardware via Temporal Logic. - Cindy Eisner; Dana Fisman (Handbook of Model Checking, 2018)

SyGuS-Comp 2018: Results and Analysis. - Rajeev Alur; Dana Fisman; Saswat Padhi; Rishabh Singh; Abhishek Udupa (CoRR, 2019)

Query learning of derived ωω omega-tree languages in polynomial time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (Log. Methods Comput. Sci., 2019)

Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CSL, 2020)

Learning Interpretable Models in the Property Specification Language. - Rajarshi Roy 002; Dana Fisman; Daniel Neider (IJCAI, 2020)

Polynomial Identification of ømega-Automata. - Dana Angluin; Dana Fisman; Yaara Shoval (TACAS (2), 2020)

Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors. - Dana Angluin; Dana Fisman (CoRR, 2020)

On the Complexity of Symbolic Finite-State Automata. - Dana Fisman; Hadar Frenkel; Sandra Zilles (CoRR, 2020)

Safety Synthesis Sans Specification. - Roderick Bloem; Hana Chockler; Masoud Ebrahimi 002; Dana Fisman; Heinz Riener (CoRR, 2020)

Streamable regular transductions. - Rajeev Alur; Dana Fisman; Konstantinos Mamouras; Mukund Raghothaman; Caleb Stanford (Theor. Comput. Sci., 2020)

Colored nested words. - Rajeev Alur; Dana Fisman (Formal Methods Syst. Des., 2021)

Special Issue on Syntax-Guided Synthesis Preface. - Dana Fisman; Rishabh Singh; Armando Solar-Lezama (Formal Methods Syst. Des., 2021)

Regular ω-languages with an informative right congruence. - Dana Angluin; Dana Fisman (Inf. Comput., 2021)

Learning and Characterizing Fully-Ordered Lattice Automata. - Dana Fisman; Sagi Saadon (ATVA, 2022)

The Normalized Edit Distance with Uniform Operation Costs Is a Metric. - Dana Fisman; Joshua Grogin; Oded Margalit; Gera Weiss (CPM, 2022)

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. - Dana Angluin; Timos Antonopoulos; Dana Fisman; Nevin George (FoSSaCS, 2022)

A Normalized Edit Distance on Infinite Words. - Dana Fisman; Joshua Grogin; Gera Weiss (CSL, 2023)

A Colorful and Robust Measure for FDFAs. - Dana Fisman; Emmanuel Goldberg; Oded Zimerman (CoRR, 2023)

Inferring Symbolic Automata. - Dana Fisman; Hadar Frenkel; Sandra Zilles (Log. Methods Comput. Sci., 2023)

Learning of Structurally Unambiguous Probabilistic Grammars. - Dana Fisman; Dolav Nitay; Michal Ziv-Ukelson (Log. Methods Comput. Sci., 2023)

Introduction to the Special Issue on Runtime Verification. - Lu Feng 001; Dana Fisman (Int. J. Softw. Tools Technol. Transf., 2023)

Learning Broadcast Protocols. - Dana Fisman; Noa Izsak; Swen Jacobs (AAAI, 2024)

Learning Broadcast Protocols with LeoParDS. - Noa Izsak; Dana Fisman; Swen Jacobs (ATVA, 2024)

When Is the Normalized Edit Distance over Non-Uniform Weights a Metric? - Dana Fisman; Ilay Tzarfati (CPM, 2024)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance. - Dana Fisman; Emmanuel Goldberg; Oded Zimerman (MFCS, 2024)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages. - Dana Angluin; Dana Fisman (Log. Methods Comput. Sci., 2024)

Omega-Regular Robustness. - Dana Fisman; Elina Sudit (CoRR, 2025)

Runtime Consultants. - Dana Fisman; Elina Sudit (CoRR, 2025)