On the public citation graph

Developing and Reasoning About Probabilistic Programs in pGCL

https://doi.org/10.1007/11889229_4
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11603009openalex-snapshot
Formal Modeling and Analysis of Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_28openalex-snapshot
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_11openalex-snapshot
New Approaches for Almost-Sure Termination of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_22openalex-snapshot
Termination of Nondeterministic Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_33openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_1openalex-snapshot
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_5openalex-snapshot
Security, Probability and Nearly Fair Coins in the Cryptographers’ Café
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_6openalex-snapshot
Constructive Development of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_14openalex-snapshot
Proving Termination of Probabilistic Programs Using Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.014openalex-snapshot
Hennessy-Milner Results for Probabilistic PDL
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.03.003openalex-snapshot
Stepwise refinement of sequence diagrams with soft real-time constraints
inferred← citeshttps://doi.org/10.1017/9781108770750.008openalex-snapshot
Termination Analysis of Probabilistic Programs with Martingales
inferred← citeshttps://doi.org/10.1109/csicc.2009.5349331openalex-snapshot
A refinement approach for developing probabilistic programs
inferred← citeshttps://doi.org/10.1109/iraniancee.2010.5507014openalex-snapshot
A constructive approach for developing probabilistic programs
inferred← citeshttps://doi.org/10.1145/2837614.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferred← citeshttps://doi.org/10.1145/2914770.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferred← citeshttps://doi.org/10.1145/3009837.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferred← citeshttps://doi.org/10.1145/3093333.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferred← citeshttps://doi.org/10.1145/3158122openalex-snapshot
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
inferred← citeshttps://doi.org/10.1145/3174800openalex-snapshot
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3360555openalex-snapshot
Modular verification for almost-sure termination of probabilistic programs
inferred← citeshttps://doi.org/10.1145/3585391openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1145/3649824openalex-snapshot
Quantitative Bounds on Resource Usage of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3656432openalex-snapshot
Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving
inferred← citeshttps://doi.org/10.1145/3759429.3762623openalex-snapshot
X-by-Construction: Towards Ensuring Non-functional Properties in by-Construction Engineering
inferred← citeshttps://doi.org/10.13140/rg.2.2.28661.58082openalex-snapshot
Stepwise refinement of sequence diagrams with soft real-time requirements
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2932openalex-snapshot
Proving Termination of Probabilistic Programs Using Patterns
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02944openalex-snapshot
Termination of Nondeterministic Recursive Probabilistic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.04304openalex-snapshot
Verification Logics for Quantum Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2008.06295openalex-snapshot
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning
inferred← citeshttps://doi.org/10.5281/zenodo.1056097openalex-snapshot
Pz: A Z-Based Formalism For Modeling Probabilistic Behavior
inferred← citeshttps://doi.org/10.5923/j.computer.20120203.04openalex-snapshot
A Z-Based Formalism to Specify Markov Chains
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.