The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Benjamin Lucien Kaminski" ( http://dblp.L3S.de/Authors/Benjamin_Lucien_Kaminski )

URL (Homepage):  https://moves.rwth-aachen.de/people/kaminski/  Author page on DBLP  Author page in RDF  Community of Benjamin Lucien Kaminski in ASPL-2

Publication years (Num. hits)
2011-2016 (15) 2017-2019 (16)
Publication types (Num. hits)
article(20) inproceedings(10) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 32 publication records. Showing 31 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll Quantitative separation logic: a logic for reasoning about probabilistic pointer programs. Search on Bibsonomy PACMPL The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja On the hardness of analyzing probabilistic programs. Search on Bibsonomy Acta Inf. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Alejandro Aguirre 0001, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja Kantorovich Continuity of Probabilistic Programs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Arnd Hartmanns, Benjamin Lucien Kaminski Optimistic Value Iteration. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Benjamin Lucien Kaminski Advanced weakest precondition calculi for probabilistic programs. Search on Bibsonomy 2019   RDF
1Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen A new proof rule for almost-sure termination. Search on Bibsonomy PACMPL The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll Quantitative Separation Logic. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Federico Olmedo, Friedrich Gretz, Nils Jansen 0001, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver Conditioning in Probabilistic Programming. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen Rule-Based Conditioning of Probabilistic Data. Search on Bibsonomy SUM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times. Search on Bibsonomy ESOP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen A New Proof Rule for Almost-Sure Termination. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen A weakest pre-expectation semantics for mixed-sign expectations. Search on Bibsonomy LICS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja Inferring Covariances for Probabilistic Programs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nils Jansen 0001, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen Bounded Model Checking for Probabilistic Programs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja Reasoning about Recursive Probabilistic Programs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja Inferring Covariances for Probabilistic Programs. Search on Bibsonomy QEST The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja Reasoning about Recursive Probabilistic Programs. Search on Bibsonomy LICS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nils Jansen 0001, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen Bounded Model Checking for Probabilistic Programs. Search on Bibsonomy ATVA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. Search on Bibsonomy ESOP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nils Jansen 0001, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver Conditioning in Probabilistic Programming. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Friedrich Gretz, Nils Jansen 0001, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver, Federico Olmedo Conditioning in Probabilistic Programming. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen On the Hardness of Almost-Sure Termination. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen 0001, Benjamin Lucien Kaminski, Federico Olmedo Understanding Probabilistic Programs. Search on Bibsonomy Correct System Design The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen On the Hardness of Almost-Sure Termination. Search on Bibsonomy MFCS (1) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Klaus Wehrle, Carsten Weise, Stefan Kowalewski Scalable Symbolic Execution of Distributed Systems. Search on Bibsonomy ICDCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #31 of 31 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license