OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments
Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovič, et al.
Lecture notes in computer science (2022), pp. 3-25
Closed Access | Times Cited: 6
Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovič, et al.
Lecture notes in computer science (2022), pp. 3-25
Closed Access | Times Cited: 6
Showing 6 citing articles:
Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments
Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovič, et al.
ACM Transactions on Modeling and Computer Simulation (2024) Vol. 34, Iss. 3, pp. 1-25
Open Access | Times Cited: 5
Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovič, et al.
ACM Transactions on Modeling and Computer Simulation (2024) Vol. 34, Iss. 3, pp. 1-25
Open Access | Times Cited: 5
Probabilistic Loop Synthesis from Sequences of Moments
Miroslav Stankovič, Ezio Bartocci
Lecture notes in computer science (2024), pp. 233-248
Closed Access | Times Cited: 1
Miroslav Stankovič, Ezio Bartocci
Lecture notes in computer science (2024), pp. 233-248
Closed Access | Times Cited: 1
The ProbInG Project: Advancing Automatic Analysis of Probabilistic Loops
Ezio Bartocci
Lecture notes in computer science (2024), pp. 152-167
Closed Access | Times Cited: 1
Ezio Bartocci
Lecture notes in computer science (2024), pp. 152-167
Closed Access | Times Cited: 1
Quantifying Uncertainty in Probabilistic Loops Without Sampling: A Fully Automated Approach
Ezio Bartocci
Lecture notes in computer science (2024), pp. 3-8
Closed Access
Ezio Bartocci
Lecture notes in computer science (2024), pp. 3-8
Closed Access
Polar: An Algebraic Analyzer for (Probabilistic) Loops
Marcel Moosbrugger, Julian Müllner, Ezio Bartocci, et al.
Lecture notes in computer science (2024), pp. 179-200
Closed Access
Marcel Moosbrugger, Julian Müllner, Ezio Bartocci, et al.
Lecture notes in computer science (2024), pp. 179-200
Closed Access
A Unified Framework for Quantitative Analysis of Probabilistic Programs
Shenghua Feng, Tengshun Yang, Mingshuai Chen, et al.
Lecture notes in computer science (2024), pp. 230-254
Closed Access
Shenghua Feng, Tengshun Yang, Mingshuai Chen, et al.
Lecture notes in computer science (2024), pp. 230-254
Closed Access
