Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Dana Fisman"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 2 (2023)
We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications in software verification. The state-of-the-art literature on this topic follows the query learning paradigm, and so far all obtained results
Externí odkaz:
https://doaj.org/article/efd0e62c94d54830871fefb46742abbf
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results f
Externí odkaz:
https://doaj.org/article/ac4ece3f41ec48568d62c37959c5aca1
Autor:
Dana Angluin, Dana Fisman
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 265-279 (2018)
A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The
Externí odkaz:
https://doaj.org/article/70d51d121d23461088bf9505ba37493a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 260, Iss Proc. SYNT 2017, Pp 97-115 (2017)
Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula phi in a background theory T, and a syntactic constraint given by a grammar G, which specifie
Externí odkaz:
https://doaj.org/article/1a9cc4e9c1a04f1bb87b059c75fdef0c
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\ome
Externí odkaz:
https://doaj.org/article/c9d8bbbeb18344a3b982b43595ca190f
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 229, Iss Proc. SYNT 2016, Pp 178-202 (2016)
Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T, and a syntactic constraint given by a grammar G, which specifies
Externí odkaz:
https://doaj.org/article/9cf5c29b5d594b5bb0a05590ada6b006
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 202, Iss Proc. SYNT 2015, Pp 3-26 (2016)
Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T, and a syntactic constraint given by a grammar G, which specifies
Externí odkaz:
https://doaj.org/article/f51a0b77b4f3448090633d1f629a8d66
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to th
Externí odkaz:
https://doaj.org/article/4a0c4736a6aa4775814223e4d5fc47a1
Autor:
Dana Fisman, Grigore Rosu
This open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the Europea
Autor:
Rajeev Alur, Dana Fisman
Publikováno v:
Formal Methods in System Design. 58:347-374
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::052cba29753a2126dce6f91c681a832d
https://doi.org/10.1007/s10703-021-00384-2
https://doi.org/10.1007/s10703-021-00384-2