Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Theory of computation → Denotational semantics"'
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2023, pp.1-31. ⟨10.1145/3571254⟩
Proceedings of the ACM on Programming Languages, 2023, pp.1-31. ⟨10.1145/3571254⟩
This paper introduces ctrees, a monad for modeling nondeterministic, recursive, and impure programs in Coq. Inspired by Xia et al.'s itrees, this novel data structure embeds computations into coinductive trees with three kind of nodes: external event
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e141125033782b8d8ff47983de3b7d4
https://hal.science/hal-03886910
https://hal.science/hal-03886910
As shown by Tsukada and Ong, normal (extensional) simply-typed resource terms correspond to plays in Hyland-Ong games, quotiented by Melli\`es' homotopy equivalence. Though inspiring, their proof is indirect, relying on the injectivity of the relatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ccbb169d6f3f7ce3a62004004ce80da
http://arxiv.org/abs/2302.04685
http://arxiv.org/abs/2302.04685
Noninterference is the strong information-security property that a program does not leak secrets through publicly-visible behavior. In the presence of effects such as nontermination, state, and exceptions, reasoning about noninterference quickly beco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff46e388c5f3ca8c511510145056d5a9
Linear Logic refines Classical Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various frameworks. The most famous are indexed linear logics which can describe the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e644f5831d557a878b66fd9cae9615c
Noninterference is the strong information-security property that a program does not leak secrets through publicly-visible behavior. In the presence of effects such as nontermination, state, and exceptions, reasoning about noninterference quickly beco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cf7510e03d24936a55e125f6084b3d7
We consider an extension of multiplicative linear logic which encompasses bayesian networks and expresses samples sharing and marginalisation with the polarised rules of contraction and weakening. We introduce the necessary formalism to import exact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::575d27e346b30c05f0908971159953bc
This paper presents a specification framework for monadic, recursive, interactive programs that supports auto-active verification, an approach that combines user-provided guidance with automatic verification techniques. This verification tool is desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::990f888391d1f1d4000b50e1183704a8
Autor:
Uemura, Taichi
We show that certain diagrams of ∞-logoses are reconstructed in internal languages of their oplax limits via lex, accessible modalities, which enables us to use plain homotopy type theory to reason about not only a single ∞-logos but also a diagr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef3efb205ae37eb689079630e083d427
Autor:
McDermott, Dylan, Mycroft, Alan
We establish a general framework for reasoning about the relationship between call-by-value and call-by-name. In languages with side-effects, call-by-value and call-by-name executions of programs often have different, but related, observable behaviou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f0e090b7dc0c3dc4e340e000be65e02
Autor:
Sterling, Jonathan, Harper, Robert
Publikováno v:
Sterling, J & Harper, R 2022, Sheaf Semantics of Termination-Insensitive Noninterference . in A P Felty (ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 ., 5, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 228, 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022, Haifa, Israel, 02/08/2022 . https://doi.org/10.4230/LIPIcs.FSCD.2022.5
We propose a new sheaf semantics for secure information flow over a space of abstract behaviors, based on synthetic domain theory: security classes are open/closed partitions, types are sheaves, and redaction of sensitive information corresponds to r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::119de6864d3b1398c5f4881c4fc43503