Zobrazeno 1 - 10
of 2 196
pro vyhledávání: '"Philipp, G."'
Autor:
Haselwarter, Philipp G., Li, Kwing Hei, Aguirre, Alejandro, Gregersen, Simon Oddershede, Tassarotti, Joseph, Birkedal, Lars
Publikováno v:
Proc. ACM Program. Lang. 9, POPL, Article 41 (January 2025)
Properties such as provable security and correctness for randomized programs are naturally expressed relationally as approximate equivalences. As a result, a number of relational program logics have been developed to reason about such approximate equ
Externí odkaz:
http://arxiv.org/abs/2407.14107
Autor:
Haselwarter, Philipp G., Li, Kwing Hei, de Medeiros, Markus, Gregersen, Simon Oddershede, Aguirre, Alejandro, Tassarotti, Joseph, Birkedal, Lars
Publikováno v:
Proc. ACM Program. Lang. 8, OOPSLA2, Article 313 (October 2024), 30 pages
We present Tachis, a higher-order separation logic to reason about the expected cost of probabilistic programs. Inspired by the uses of time credits for reasoning about the running time of deterministic programs, we introduce a novel notion of probab
Externí odkaz:
http://arxiv.org/abs/2405.20083
Autor:
Aguirre, Alejandro, Haselwarter, Philipp G., de Medeiros, Markus, Li, Kwing Hei, Gregersen, Simon Oddershede, Tassarotti, Joseph, Birkedal, Lars
Probabilistic programs often trade accuracy for efficiency, and thus may, with a small probability, return an incorrect result. It is important to obtain precise bounds for the probability of these errors, but existing verification approaches have li
Externí odkaz:
http://arxiv.org/abs/2404.14223
Autor:
Gregersen, Simon Oddershede, Aguirre, Alejandro, Haselwarter, Philipp G., Tassarotti, Joseph, Birkedal, Lars
Almost-sure termination is an important correctness property for probabilistic programs, and a number of program logics have been developed for establishing it. However, these logics have mostly been developed for first-order programs written in lang
Externí odkaz:
http://arxiv.org/abs/2404.08494
Autor:
Milad Mokhtaridoost, Jordan J. Chalmers, Marzieh Soleimanpoor, Brandon J. McMurray, Daniella F. Lato, Son C. Nguyen, Viktoria Musienko, Joshua O. Nash, Sergio Espeso-Gil, Sameen Ahmed, Kate Delfosse, Jared W. L. Browning, A. Rasim Barutcu, Michael D. Wilson, Thomas Liehr, Adam Shlien, Samin Aref, Eric F. Joyce, Anja Weise, Philipp G. Maass
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-17 (2024)
Abstract Non-homologous chromosomal contacts (NHCCs) between different chromosomes participate considerably in gene and genome regulation. Due to analytical challenges, NHCCs are currently considered as singular, stochastic events, and their extent a
Externí odkaz:
https://doaj.org/article/ac9565cd1a404b17b3b13e344b9a0a2f
Autor:
Grützmacher, Philipp G., Cutini, Michele, Marquis, Edoardo, Ripoll, Manel Rodríguez, Riedl, Helmut, Kutrowatz, Philip, Bug, Stefan, Hsu, Chia-Jui, Bernardi, Johannes, Righi, M. Clelia, Gachot, Carsten, Erdemir, Ali
Transition metal dichalcogenide (TMD) coatings have attracted enormous scientific and industrial interest due to their outstanding tribological behavior. The paradigmatic example is MoS2, even though selenides and tellurides have demonstrated superio
Externí odkaz:
http://arxiv.org/abs/2304.14311
Autor:
Gregersen, Simon Oddershede, Aguirre, Alejandro, Haselwarter, Philipp G., Tassarotti, Joseph, Birkedal, Lars
Probabilistic couplings are the foundation for many probabilistic relational program logics and arise when relating random sampling statements across two programs. In relational program logics, this manifests as dedicated coupling rules that, e.g., s
Externí odkaz:
http://arxiv.org/abs/2301.10061
Autor:
Grützmacher, Philipp G. a, ⁎⁎, Majed, Ahmad b, Marquis, Edoardo c, Sui, Xudong a, d, Righi, M. Clelia c, ⁎, Sauer, Markus e, Foelske, Annette e, Naguib, Michael b, f, Gachot, Carsten a, ⁎⁎⁎
Publikováno v:
In Carbon January 2025 231
Autor:
Haselwarter, Philipp G., Bauer, Andrej
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We prove several
Externí odkaz:
http://arxiv.org/abs/2112.00539