Dana Fisman

Orcid: 0000-0002-6015-4170

Affiliations:
  • Ben-Gurion University, Beersheba, Israel


According to our database1, Dana Fisman authored at least 60 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Robust Measure on FDFAs Following Duo-Normalized Acceptance.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

When Is the Normalized Edit Distance over Non-Uniform Weights a Metric?
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Learning Broadcast Protocols.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Introduction to the Special Issue on Runtime Verification.
Int. J. Softw. Tools Technol. Transf., August, 2023

Learning of Structurally Unambiguous Probabilistic Grammars.
Log. Methods Comput. Sci., 2023

Inferring Symbolic Automata.
Log. Methods Comput. Sci., 2023

A Colorful and Robust Measure for FDFAs.
CoRR, 2023

A Normalized Edit Distance on Infinite Words.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

The Normalized Edit Distance with Uniform Operation Costs Is a Metric.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Learning and Characterizing Fully-Ordered Lattice Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2022

2021
Regular <i>ω</i>-languages with an informative right congruence.
Inf. Comput., 2021

Special Issue on Syntax-Guided Synthesis Preface.
Formal Methods Syst. Des., 2021

Colored nested words.
Formal Methods Syst. Des., 2021

2020
Streamable regular transductions.
Theor. Comput. Sci., 2020

Safety Synthesis Sans Specification.
CoRR, 2020

On the Complexity of Symbolic Finite-State Automata.
CoRR, 2020

Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors.
CoRR, 2020

Polynomial Identification of ømega-Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Learning Interpretable Models in the Property Specification Language.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Query learning of derived ωω\omega-tree languages in polynomial time.
Log. Methods Comput. Sci., 2019

SyGuS-Comp 2018: Results and Analysis.
CoRR, 2019

2018
Functional Specification of Hardware via Temporal Logic.
Proceedings of the Handbook of Model Checking., 2018

Families of DFAs as Acceptors of ω-Regular Languages.
Log. Methods Comput. Sci., 2018

Inferring regular languages and <i>ω</i>-languages.
J. Log. Algebraic Methods Program., 2018

Regular omega-Languages with an Informative Right Congruence.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Query learning of derived ω-tree languages in polynomial time.
CoRR, 2018

Search-based program synthesis.
Commun. ACM, 2018

Temporal Reasoning on Incomplete Paths.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification, 2018

2017
SyGuS-Comp 2017: Results and Analysis.
Proceedings of the Proceedings Sixth Workshop on Synthesis, 2017

Query Learning of Derived Omega-Tree Languages in Polynomial Time.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
Learning regular omega languages.
Theor. Comput. Sci., 2016

SyGuS-Comp 2016: Results and Analysis.
Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Families of DFAs as Acceptors of omega-Regular Languages.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A Complexity Measure on Büchi Automata.
Proceedings of the Language and Automata Theory and Applications, 2016

Regular Programming for Quantitative Properties of Data Streams.
Proceedings of the Programming Languages and Systems, 2016

2015

Vacuity in practice: temporal antecedent failure.
Formal Methods Syst. Des., 2015

Results and Analysis of SyGuS-Comp'15.
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

Learning Regular Languages via Alternating Automata.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Modular Approach for Büchi Determinization.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations.
ACM Trans. Comput. Log., 2014

2013
SVA and PSL Local Variables - A Practical Approach.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2010
Rational Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

2009
Reasoning about Finite-State Switched Systems.
Proceedings of the Hardware and Software: Verification and Testing, 2009

2008
Embedding finite automata within regular expressions.
Theor. Comput. Sci., 2008

On Verifying Fault Tolerance of Distributed Protocols.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

A Framework for Inherent Vacuity.
Proceedings of the Hardware and Software: Verification and Testing, 2008

Structural Contradictions.
Proceedings of the Hardware and Software: Verification and Testing, 2008

Augmenting a Regular Expression-Based Temporal Logic with Local Variables.
Proceedings of the Formal Methods in Computer-Aided Design, 2008

2007
On the Characterization of Until as a Fixed Point Under Clocked Semantics.
Proceedings of the Hardware and Software: Verification and Testing, 2007

Temporal Antecedent Failure: Refining Vacuity.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
A Practical Introduction to PSL
Series on Integrated Circuits and Systems, Springer, ISBN: 978-0-387-36123-9, 2006

2005
A topological characterization of weakness.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

The Safety Simple Subset.
Proceedings of the Hardware and Software Verification and Testing, 2005

2003
The Definition of a Temporal Clock Operator.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Reasoning with Temporal Logic on Truncated Paths.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2001
Beyond Regular Model Checking.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

The Temporal Logic Sugar.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001


  Loading...