Zobrazeno 1 - 10
of 232
pro vyhledávání: '"Dexter Kozen"'
Autor:
Zoltan Esik, Dexter Kozen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 4 (2019)
We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of this form a
Externí odkaz:
https://doaj.org/article/610a89e9ca654cc18009c2bd86c555e3
Autor:
Dexter Kozen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting. We show tha
Externí odkaz:
https://doaj.org/article/964c9181e4e444efa1841247c252da8d
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 126, Iss Proc. FICS 2013, Pp 44-55 (2013)
We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Leiß (1992).
Externí odkaz:
https://doaj.org/article/43a9a29685f8495d8c0738ddeca4a231
Autor:
Dexter Kozen, Nicholas Ruozzi
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009)
Metric coinduction is a form of coinduction that can be used to establish properties of objects constructed as a limit of finite approximations. One can prove a coinduction step showing that some property is preserved by one step of the approximation
Externí odkaz:
https://doaj.org/article/2e4a02dc555349a38ab0c1b86b726510
Autor:
Dexter Kozen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 4 (2007)
We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic arguments,
Externí odkaz:
https://doaj.org/article/b5afb381591b4749abeb99cb92ee23c4
Autor:
Dexter Kozen
Publikováno v:
ACM SIGACT News. 53:32-34
I was fortunate to have been a student of Juris Hartmanis during the early years of the Computer Science Department at Cornell. Juris was a founding member of the department and its first chair.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce614c7ac07cfaa26e426afb6d7a8ae9
https://doi.org/10.1145/3577971.3577976
https://doi.org/10.1145/3577971.3577976
Autor:
Keri D’Angelo, Dexter Kozen
Publikováno v:
2023 Data Compression Conference (DCC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6986baedaeb4e0479530f61599778c72
https://doi.org/10.1109/dcc55655.2023.00077
https://doi.org/10.1109/dcc55655.2023.00077
Autor:
Dexter Kozen
Publikováno v:
ACM SIGLOG News. 9:2-3
The ACM Special Interest Group on Logic (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Goedel Society (KGS) are pleased to announce that has been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b324f746988cc42425159d4579787f4
https://doi.org/10.1145/3583660.3583662
https://doi.org/10.1145/3583660.3583662
This book provides the first comprehensive introduction to Dynamic Logic.Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute n
Publikováno v:
Programming Languages and Systems ISBN: 9783030993351
Proceedings of ESOP 2022
Proceedings of ESOP 2022
We introduce Concurrent (), an extension of with operators for specifying and reasoning about concurrency in scenarios where multiple packets interact through state. We provide a model of the language based on partially-ordered multisets (pomsets), w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8124ce9f91df05bb3f8df8370fc403f1
https://doi.org/10.1007/978-3-030-99336-8_21
https://doi.org/10.1007/978-3-030-99336-8_21