Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Paul Krogmeier"'
Autor:
Paul Krogmeier, P. Madhusudan
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:143-171
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined using a bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::baab74de1d92f8f277d2d143d12d16f6
https://doi.org/10.1145/3586032
https://doi.org/10.1145/3586032
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:1697-1725
Axioms and inference rules form the foundation of deductive systems and are crucial in the study of reasoning with logics over structures. Historically, axiomatizations have been discovered manually with much expertise and effort. In this paper we sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa5dc5faaba3418afc58373d96c89702
https://doi.org/10.1145/3563348
https://doi.org/10.1145/3563348
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-30
Differential privacy is a mathematical framework for developing statistical computations with provable guarantees of privacy and accuracy. In contrast to the privacy component of differential privacy, which has a clear mathematical and intuitive mean
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ffee9e1614934e49e57861533619f8e
https://doi.org/10.1145/3434289
https://doi.org/10.1145/3434289
Autor:
Paul Krogmeier, P. Madhusudan
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that classify a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9db0c33afbf96ac390fce932b4a3add0
Publikováno v:
Computer Aided Verification ISBN: 9783030532901
CAV (2)
CAV (2)
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a restriction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ac4ef5b138929f87c96d6568d31bfe1
https://doi.org/10.1007/978-3-030-53291-8_32
https://doi.org/10.1007/978-3-030-53291-8_32
We investigate the decidability of automatic program verification for programs that manipulate heaps, and in particular, decision procedures for proving memory safety for them. We extend recent work that identified a decidable subclass of uninterpret
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f7e2a656987cae0f2911e146e9b68a