![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Marcel Moosbrugger
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Julian Müllner
, Marcel Moosbrugger
, Laura Kovács
:
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. Proc. ACM Program. Lang. 8(POPL): 882-910 (2024) - 2023
- [c6]Marcel Moosbrugger
, Julian Müllner
, Laura Kovács
:
Automated Sensitivity Analysis for Probabilistic Loops. iFM 2023: 21-39 - [i9]Marcel Moosbrugger, Julian Müllner, Laura Kovács:
Automated Sensitivity Analysis for Probabilistic Loops. CoRR abs/2305.15259 (2023) - [i8]Daneshvar Amrollahi, Ezio Bartocci, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
(Un)Solvable Loop Analysis. CoRR abs/2306.01597 (2023) - [i7]Andrey Kofnov
, Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Efstathia Bura:
Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments. CoRR abs/2306.07072 (2023) - [i6]Julian Müllner, Marcel Moosbrugger, Laura Kovács:
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. CoRR abs/2307.10902 (2023) - 2022
- [j2]Marcel Moosbrugger
, Ezio Bartocci
, Joost-Pieter Katoen
, Laura Kovács
:
The probabilistic termination tool amber. Formal Methods Syst. Des. 61(1): 90-109 (2022) - [j1]Marcel Moosbrugger
, Miroslav Stankovic
, Ezio Bartocci
, Laura Kovács
:
This is the moment for probabilistic loops. Proc. ACM Program. Lang. 6(OOPSLA2): 1497-1525 (2022) - [c5]Andrey Kofnov
, Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci
, Efstathia Bura:
Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments. QEST 2022: 3-25 - [c4]Ahmad Karimi, Marcel Moosbrugger, Miroslav Stankovic, Laura Kovács, Ezio Bartocci
, Efstathia Bura:
Distribution Estimation for Probabilistic Loops. QEST 2022: 26-42 - [c3]Daneshvar Amrollahi
, Ezio Bartocci, George Kenison
, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
Solving Invariant Generation for Unsolvable Loops. SAS 2022: 19-43 - [i5]Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Laura Kovács:
This is the Moment for Probabilistic Loops. CoRR abs/2204.07185 (2022) - [i4]Andrey Kofnov
, Marcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci
, Efstathia Bura:
Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments. CoRR abs/2205.02577 (2022) - [i3]Daneshvar Amrollahi
, Ezio Bartocci
, George Kenison, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
Solving Invariant Generation for Unsolvable Loops. CoRR abs/2206.06943 (2022) - 2021
- [c2]Marcel Moosbrugger
, Ezio Bartocci
, Joost-Pieter Katoen
, Laura Kovács
:
Automated Termination Analysis of Polynomial Probabilistic Programs. ESOP 2021: 491-518 - [c1]Marcel Moosbrugger
, Ezio Bartocci
, Joost-Pieter Katoen
, Laura Kovács
:
The Probabilistic Termination Tool Amber. FM 2021: 667-675 - [i2]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
The Probabilistic Termination Tool Amber. CoRR abs/2107.13072 (2021) - 2020
- [i1]Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
Automated Termination Analysis of Polynomial Probabilistic Programs. CoRR abs/2010.03444 (2020)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint