Zobrazeno 1 - 10
of 1 959
pro vyhledávání: '"Program logics"'
Tape diagrams provide a convenient notation for arrows of rig categories, i.e., categories equipped with two monoidal products, $\oplus$ and $\otimes$, where $\otimes$ distributes over $\oplus $. In this work, we extend tape diagrams with traces over
Externí odkaz:
http://arxiv.org/abs/2410.03561
Autor:
Cimini, Matteo
Program logics are a powerful formal method in the context of program verification. Can we develop a counterpart of program logics in the context of language verification? This paper proposes language logics, which allow for statements of the form $\
Externí odkaz:
http://arxiv.org/abs/2408.01515
Autor:
Cousot, Patrick
We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a natural rela
Externí odkaz:
http://arxiv.org/abs/2310.15340
Autor:
Sato, Tetsuya, Katsumata, Shin-ya
Several relational program logics have been introduced for integrating reasoning about relational properties of programs and measurement of quantitative difference between computational effects. Towards a general framework for such logics, in this pa
Externí odkaz:
http://arxiv.org/abs/2206.05716
Autor:
Aguirre, Alejandro, Barthe, Gilles, Gaboardi, Marco, Garg, Deepak, Katsumata, Shin-ya, Sato, Tetsuya
Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with private state. These computations arise routinely in several domains, inc
Externí odkaz:
http://arxiv.org/abs/2107.01155
We propose the first framework for defining relational program logics for arbitrary monadic effects. The framework is embedded within a relational dependent type theory and is highly expressive. At the semantic level, we provide an algebraic presenta
Externí odkaz:
http://arxiv.org/abs/1907.05244
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Berger, Martin, Tratt, Laurence
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 1 (March 6, 2015) lmcs:929
This paper provides the first program logic for homogeneous generative run-time meta-programming---using a variant of MiniML by Davies and Pfenning as its underlying meta-programming language. We show the applicability of our approach by reasoning ab
Externí odkaz:
http://arxiv.org/abs/1411.4256
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.