default search action
Dana Fisman
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c41]Dana Fisman, Noa Izsak, Swen Jacobs:
Learning Broadcast Protocols. AAAI 2024: 12016-12023 - [c40]Dana Fisman, Ilay Tzarfati:
When Is the Normalized Edit Distance over Non-Uniform Weights a Metric? CPM 2024: 14:1-14:17 - [c39]Dana Fisman, Emmanuel Goldberg, Oded Zimerman:
A Robust Measure on FDFAs Following Duo-Normalized Acceptance. MFCS 2024: 53:1-53:17 - 2023
- [j15]Dana Fisman, Dolav Nitay, Michal Ziv-Ukelson:
Learning of Structurally Unambiguous Probabilistic Grammars. Log. Methods Comput. Sci. 19(1) (2023) - [j14]Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. Log. Methods Comput. Sci. 19(2) (2023) - [j13]Lu Feng, Dana Fisman:
Introduction to the Special Issue on Runtime Verification. Int. J. Softw. Tools Technol. Transf. 25(4): 519-520 (2023) - [c38]Dana Fisman, Joshua Grogin, Gera Weiss:
A Normalized Edit Distance on Infinite Words. CSL 2023: 20:1-20:20 - [i16]Dana Fisman, Noa Izsak, Swen Jacobs:
Learning Broadcast Protocols. CoRR abs/2306.14284 (2023) - [i15]Dana Fisman, Emmanuel Goldberg, Oded Zimerman:
A Colorful and Robust Measure for FDFAs. CoRR abs/2310.16022 (2023) - 2022
- [c37]Dana Fisman, Sagi Saadon:
Learning and Characterizing Fully-Ordered Lattice Automata. ATVA 2022: 266-282 - [c36]Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss:
The Normalized Edit Distance with Uniform Operation Costs Is a Metric. CPM 2022: 17:1-17:17 - [c35]Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. CSL 2022: 21:1-21:19 - [c34]Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George:
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. FoSSaCS 2022: 1-20 - [e5]Christel Baier, Dana Fisman:
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022. ACM 2022, ISBN 978-1-4503-9351-5 [contents] - [e4]Dana Fisman, Grigore Rosu:
Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part I. Lecture Notes in Computer Science 13243, Springer 2022, ISBN 978-3-030-99523-2 [contents] - [e3]Dana Fisman, Grigore Rosu:
Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II. Lecture Notes in Computer Science 13244, Springer 2022, ISBN 978-3-030-99526-3 [contents] - [i14]Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss:
The Normalized Edit Distance with Uniform Operation Costs is a Metric. CoRR abs/2201.06115 (2022) - [i13]Dana Fisman, Dolav Nitay, Michal Ziv-Ukelson:
Learning of Structurally Unambiguous Probabilistic Grammars. CoRR abs/2203.09441 (2022) - [i12]Dana Angluin, Dana Fisman, Yaara Shoval:
Polynomial Identification of omega-Automata. CoRR abs/2209.09336 (2022) - 2021
- [j12]Rajeev Alur, Dana Fisman:
Colored nested words. Formal Methods Syst. Des. 58(3): 347-374 (2021) - [j11]Dana Fisman, Rishabh Singh, Armando Solar-Lezama:
Special Issue on Syntax-Guided Synthesis Preface. Formal Methods Syst. Des. 58(3): 469-470 (2021) - [j10]Dana Angluin, Dana Fisman:
Regular ω-languages with an informative right congruence. Inf. Comput. 278: 104598 (2021) - [c33]Dolav Nitay, Dana Fisman, Michal Ziv-Ukelson:
Learning of Structurally Unambiguous Probabilistic Grammars. AAAI 2021: 9170-9178 - [e2]Lu Feng, Dana Fisman:
Runtime Verification - 21st International Conference, RV 2021, Virtual Event, October 11-14, 2021, Proceedings. Lecture Notes in Computer Science 12974, Springer 2021, ISBN 978-3-030-88493-2 [contents] - [i11]Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. CoRR abs/2112.14252 (2021) - 2020
- [j9]Rajeev Alur, Dana Fisman, Konstantinos Mamouras, Mukund Raghothaman, Caleb Stanford:
Streamable regular transductions. Theor. Comput. Sci. 807: 15-41 (2020) - [c32]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. CSL 2020: 8:1-8:17 - [c31]Rajarshi Roy, Dana Fisman, Daniel Neider:
Learning Interpretable Models in the Property Specification Language. IJCAI 2020: 2213-2219 - [c30]Dana Angluin, Dana Fisman, Yaara Shoval:
Polynomial Identification of ømega-Automata. TACAS (2) 2020: 325-343 - [i10]Dana Angluin, Dana Fisman:
Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors. CoRR abs/2002.03191 (2020) - [i9]Rajarshi Roy, Dana Fisman, Daniel Neider:
Learning Interpretable Models in the Property Specification Language. CoRR abs/2002.03668 (2020) - [i8]Dana Fisman, Hadar Frenkel, Sandra Zilles:
On the Complexity of Symbolic Finite-State Automata. CoRR abs/2011.05389 (2020) - [i7]Dolav Nitay, Dana Fisman, Michal Ziv-Ukelson:
Learning of Structurally Unambiguous Probabilistic Grammars. CoRR abs/2011.07472 (2020) - [i6]Roderick Bloem, Hana Chockler, Masoud Ebrahimi, Dana Fisman, Heinz Riener:
Safety Synthesis Sans Specification. CoRR abs/2011.07630 (2020)
2010 – 2019
- 2019
- [j8]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query learning of derived ωω\omega-tree languages in polynomial time. Log. Methods Comput. Sci. 15(3) (2019) - [i5]Rajeev Alur, Dana Fisman, Saswat Padhi, Rishabh Singh, Abhishek Udupa:
SyGuS-Comp 2018: Results and Analysis. CoRR abs/1904.07146 (2019) - 2018
- [j7]Rajeev Alur, Rishabh Singh, Dana Fisman, Armando Solar-Lezama:
Search-based program synthesis. Commun. ACM 61(12): 84-93 (2018) - [j6]Dana Fisman:
Inferring regular languages and ω-languages. J. Log. Algebraic Methods Program. 98: 27-49 (2018) - [j5]Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of ω-Regular Languages. Log. Methods Comput. Sci. 14(1) (2018) - [c29]Dana Fisman, Hillel Kugler:
Temporal Reasoning on Incomplete Paths. ISoLA (2) 2018: 28-52 - [c28]Dana Angluin, Dana Fisman:
Regular omega-Languages with an Informative Right Congruence. GandALF 2018: 265-279 - [p2]Cindy Eisner, Dana Fisman:
Functional Specification of Hardware via Temporal Logic. Handbook of Model Checking 2018: 795-829 - [i4]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query learning of derived ω-tree languages in polynomial time. CoRR abs/1802.04739 (2018) - [i3]Rajeev Alur, Dana Fisman, Konstantinos Mamouras, Mukund Raghothaman, Caleb Stanford:
Streamable Regular Transductions. CoRR abs/1807.03865 (2018) - 2017
- [c27]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query Learning of Derived Omega-Tree Languages in Polynomial Time. CSL 2017: 10:1-10:21 - [c26]Rajeev Alur, Dana Fisman, Rishabh Singh, Armando Solar-Lezama:
SyGuS-Comp 2017: Results and Analysis. SYNT@CAV 2017: 97-115 - [e1]Dana Fisman, Swen Jacobs:
Proceedings Sixth Workshop on Synthesis, SYNT@CAV 2017, Heidelberg, Germany, 22nd July 2017. EPTCS 260, 2017 [contents] - 2016
- [j4]Dana Angluin, Dana Fisman:
Learning regular omega languages. Theor. Comput. Sci. 650: 57-72 (2016) - [c25]Rajeev Alur, Dana Fisman, Mukund Raghothaman:
Regular Programming for Quantitative Properties of Data Streams. ESOP 2016: 15-40 - [c24]Dana Fisman:
A Complexity Measure on Büchi Automata. LATA 2016: 102-113 - [c23]Rajeev Alur, Dana Fisman:
Colored Nested Words. LATA 2016: 143-155 - [c22]Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of omega-Regular Languages. MFCS 2016: 11:1-11:14 - [c21]Rajeev Alur, Dana Fisman, Rishabh Singh, Armando Solar-Lezama:
SyGuS-Comp 2016: Results and Analysis. SYNT@CAV 2016: 178-202 - [i2]Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of $ω$-Regular Languages. CoRR abs/1612.08154 (2016) - 2015
- [j3]Shoham Ben-David, Fady Copty, Dana Fisman, Sitvanit Ruah:
Vacuity in practice: temporal antecedent failure. Formal Methods Syst. Des. 46(1): 81-104 (2015) - [c20]Dana Fisman, Yoad Lustig:
A Modular Approach for Büchi Determinization. CONCUR 2015: 368-382 - [c19]Dana Angluin, Sarah Eisenstat, Dana Fisman:
Learning Regular Languages via Alternating Automata. IJCAI 2015: 3308-3314 - [c18]Rajeev Alur, Dana Fisman, Rishabh Singh, Armando Solar-Lezama:
Results and Analysis of SyGuS-Comp'15. SYNT 2015: 3-26 - [p1]Rajeev Alur, Rastislav Bodík, Eric Dallal, Dana Fisman, Pranav Garg, Garvit Juniwal, Hadas Kress-Gazit, P. Madhusudan, Milo M. K. Martin, Mukund Raghothaman, Shambwaditya Saha, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, Abhishek Udupa:
Syntax-Guided Synthesis. Dependable Software Systems Engineering 2015: 1-25 - 2014
- [j2]Cindy Eisner, Dana Fisman, John Havlicek:
Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations. ACM Trans. Comput. Log. 15(2): 13:1-13:44 (2014) - [c17]Dana Angluin, Dana Fisman:
Learning Regular Omega Languages. ALT 2014: 125-139 - 2013
- [c16]Roy Armoni, Dana Fisman, Naiyong Jin:
SVA and PSL Local Variables - A Practical Approach. CAV 2013: 197-212 - 2010
- [c15]Dana Fisman, Orna Kupferman, Yoad Lustig:
Rational Synthesis. TACAS 2010: 190-204
2000 – 2009
- 2009
- [c14]Dana Fisman, Orna Kupferman:
Reasoning about Finite-State Switched Systems. Haifa Verification Conference 2009: 71-86 - [i1]Dana Fisman, Orna Kupferman, Yoad Lustig:
Rational Synthesis. CoRR abs/0907.3019 (2009) - 2008
- [j1]Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
Embedding finite automata within regular expressions. Theor. Comput. Sci. 404(3): 202-218 (2008) - [c13]Cindy Eisner, Dana Fisman:
Augmenting a Regular Expression-Based Temporal Logic with Local Variables. FMCAD 2008: 1-8 - [c12]Dana Fisman, Orna Kupferman, Sarai Sheinvald-Faragy, Moshe Y. Vardi:
A Framework for Inherent Vacuity. Haifa Verification Conference 2008: 7-22 - [c11]Cindy Eisner, Dana Fisman:
Structural Contradictions. Haifa Verification Conference 2008: 164-178 - [c10]Dana Fisman, Orna Kupferman, Yoad Lustig:
On Verifying Fault Tolerance of Distributed Protocols. TACAS 2008: 315-331 - 2007
- [c9]Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
Temporal Antecedent Failure: Refining Vacuity. CONCUR 2007: 492-506 - [c8]Dana Fisman:
On the Characterization of Until as a Fixed Point Under Clocked Semantics. Haifa Verification Conference 2007: 19-33 - 2006
- [b1]Cindy Eisner, Dana Fisman:
A Practical Introduction to PSL. Series on Integrated Circuits and Systems, Springer 2006, ISBN 978-0-387-35313-5, pp. 1-240 - 2005
- [c7]Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
The Safety Simple Subset. Haifa Verification Conference 2005: 14-29 - [c6]Cindy Eisner, Dana Fisman, John Havlicek:
A topological characterization of weakness. PODC 2005: 1-8 - 2004
- [c5]Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
Embedding Finite Automata within regular Expressions. ISoLA (Preliminary proceedings) 2004: 175-180 - 2003
- [c4]Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony McIsaac, David Van Campenhout:
Reasoning with Temporal Logic on Truncated Paths. CAV 2003: 27-39 - [c3]Cindy Eisner, Dana Fisman, John Havlicek, Anthony McIsaac, David Van Campenhout:
The Definition of a Temporal Clock Operator. ICALP 2003: 857-870 - 2001
- [c2]Ilan Beer, Shoham Ben-David, Cindy Eisner, Dana Fisman, Anna Gringauze, Yoav Rodeh:
The Temporal Logic Sugar. CAV 2001: 363-367 - [c1]Dana Fisman, Amir Pnueli:
Beyond Regular Model Checking. FSTTCS 2001: 156-170
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint