Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Matheja, Christoph
18  Ergebnisse:
Artikel (Online) X
Personensuche X
?
1

A Calculus for Amortized Expected Runtimes:

Batz, Kevin ; Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter..
Proceedings of the ACM on Programming Languages.  7 (2023)  POPL - p. 1957-1986 , 2023
Link: https://doi.org/10.1145/..
 
?
2

A Decision Procedure for Guarded Separation Logic Complete ..:

Matheja, Christoph ; Pagel, Jens ; Zuleger, Florian
ACM Transactions on Computational Logic.  24 (2023)  1 - p. 1-76 , 2023
Link: https://doi.org/10.1145/..
 
?
3

A Deductive Verification Infrastructure for Probabilistic P..:

Schröer, Philipp ; Batz, Kevin ; Kaminski, Benjamin Lucien..
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 2052-2082 , 2023
Link: https://doi.org/10.1145/..
 
?
4

A pre-expectation calculus for probabilistic sensitivity:

Aguirre, Alejandro ; Barthe, Gilles ; Hsu, Justin...
Proceedings of the ACM on Programming Languages.  5 (2021)  POPL - p. 1-28 , 2021
Link: https://doi.org/10.1145/..
 
?
5

Modular specification and verification of closures in Rust:

Wolff, Fabian ; Bílý, Aurel ; Matheja, Christoph..
Proceedings of the ACM on Programming Languages.  5 (2021)  OOPSLA - p. 1-29 , 2021
Link: https://doi.org/10.1145/..
 
?
6

Relatively complete verification of probabilistic programs:..:

Batz, Kevin ; Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter.
Proceedings of the ACM on Programming Languages.  5 (2021)  POPL - p. 1-30 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

A pre-expectation calculus for probabilistic sensitivity:

Aguirre, Alejandro ; Barthe, Gilles ; Hsu, Justin...
Proceedings of the ACM on Programming Languages.  5 (2021)  POPL - p. 1-28 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Modular specification and verification of closures in Rust:

Wolff, Fabian ; Bílý, Aurel ; Matheja, Christoph..
Proceedings of the ACM on Programming Languages.  5 (2021)  OOPSLA - p. 1-29 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Relatively complete verification of probabilistic programs:..:

Batz, Kevin ; Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter.
Proceedings of the ACM on Programming Languages.  5 (2021)  POPL - p. 1-30 , 2021
Link: https://doi.org/10.1145/..
 
?
10

How do programmers use unsafe rust?:

Astrauskas, Vytautas ; Matheja, Christoph ; Poli, Federico..
Proceedings of the ACM on Programming Languages.  4 (2020)  OOPSLA - p. 1-27 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

How do programmers use unsafe rust?:

Astrauskas, Vytautas ; Matheja, Christoph ; Poli, Federico..
Proceedings of the ACM on Programming Languages.  4 (2020)  OOPSLA - p. 1-27 , 2020
Link: https://doi.org/10.1145/..
 
?
12

Quantitative separation logic: a logic for reasoning about ..:

Batz, Kevin ; Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter..
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-29 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

Quantitative separation logic: a logic for reasoning about ..:

Batz, Kevin ; Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter..
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-29 , 2019
Link: https://doi.org/10.1145/..
 
?
14

Weakest Precondition Reasoning for Expected Runtimes of Ran..:

Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter ; Matheja, Christoph.
Journal of the ACM.  65 (2018)  5 - p. 1-68 , 2018
Link: https://doi.org/10.1145/..
 
?
15

On the hardness of analyzing probabilistic programs:

Kaminski, Benjamin Lucien ; Katoen, Joost-Pieter ; Matheja, Christoph
Acta Informatica.  56 (2018)  3 - p. 255-285 , 2018
Link: https://doi.org/10.1007/..
 
1-15