On the public citation graph

A Theory of Slicing for Imperative Probabilistic Programs

https://doi.org/10.1145/3372895
0 signed · 37 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-47764-0_7openalex-snapshot
An Abstract Analysis of the Probabilistic Termination of Programs
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_6openalex-snapshot
Fine-Grained Semantics for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
inferredcites →https://doi.org/10.1007/978-3-662-48057-1_24openalex-snapshot
On the Hardness of Almost–Sure Termination
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-662-49630-5_11openalex-snapshot
A Theory of Slicing for Probabilistic Control Flow Graphs
inferredcites →https://doi.org/10.1007/978-3-662-49665-7_11openalex-snapshot
Cut Branches Before Looking for Bugs: Sound Verification on Relaxed Slices
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_13openalex-snapshot
Uncertainty Propagation Using Probabilistic Affine Forms and Concentration of Measure Inequalities
inferredcites →https://doi.org/10.1007/bfb0019410openalex-snapshot
Slicing programs with arbitrary control-flow
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/j.entcs.2005.12.012openalex-snapshot
Formal Semantics of Programming Languages
inferredcites →https://doi.org/10.1016/j.ipl.2007.10.002openalex-snapshot
Slicing for modern program structures: a theory for eliminating irrelevant loops
inferredcites →https://doi.org/10.1016/j.peva.2013.11.004openalex-snapshot
Operational versus weakest pre-expectation semantics for the probabilistic guarded command language
inferredcites →https://doi.org/10.1016/j.tcs.2009.10.025openalex-snapshot
A trajectory-based strict semantics for program slicing
inferredcites →https://doi.org/10.1016/j.tcs.2011.08.033openalex-snapshot
A unifying theory of control dependence and its application to arbitrary program structures
inferredcites →https://doi.org/10.1109/32.58784openalex-snapshot
A formal model of program dependences and its implications for software testing, debugging, and maintenance
inferredcites →https://doi.org/10.1109/tse.1984.5010248openalex-snapshot
Program Slicing
inferredcites →https://doi.org/10.1142/p595openalex-snapshot
Labelled Markov Processes
inferredcites →https://doi.org/10.1145/1275497.1275502openalex-snapshot
A new foundation for control dependence and slicing for modern program structures
inferredcites →https://doi.org/10.1145/2593882.2593900openalex-snapshot
Probabilistic programming
inferredcites →https://doi.org/10.1145/2594291.2594303openalex-snapshot
Slicing probabilistic programs
inferredcites →https://doi.org/10.1145/2676724.2693169openalex-snapshot
Verified Validation of Program Slicing
inferredcites →https://doi.org/10.1145/2676726.2677001openalex-snapshot
Probabilistic Termination
inferredcites →https://doi.org/10.1145/3156018openalex-snapshot
Conditioning in Probabilistic Programming
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
inferredcites →https://doi.org/10.5539/jpl.v3n1p121openalex-snapshot
The Global Interests in the Process of Globalization

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4580426openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_25openalex-snapshot
Latticed k-Induction with an Application to Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_7openalex-snapshot
Static Slicing for Probabilistic Programs: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-032-08187-2_6openalex-snapshot
A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_8openalex-snapshot
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102822openalex-snapshot
Slicing of probabilistic programs based on specifications
inferred← citeshttps://doi.org/10.1145/3490421openalex-snapshot
Conditional Independence by Typing
inferred← citeshttps://doi.org/10.1145/3656448openalex-snapshot
Compiling Probabilistic Programs for Variable Elimination with Information Flow
inferred← citeshttps://doi.org/10.1145/3764581openalex-snapshot
Slicing of Probabilistic Programs: A Review of Existing Approaches
inferred← citeshttps://doi.org/10.2174/0126662558321267240726093228openalex-snapshot
Program Defect Detection Using Sensitive Slice Semantics with Control Flow Variable Dependency
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.