On the public citation graph

Trace abstraction modulo probability

0 signed · 90 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/11547662_8openalex-snapshot
Abstraction Refinement for Termination
inferredcites →https://doi.org/10.1007/11681878_14openalex-snapshot
Calibrating Noise to Sensitivity in Private Data Analysis
inferredcites →https://doi.org/10.1007/11817963_14openalex-snapshot
Lazy Abstraction with Interpolants
inferredcites →https://doi.org/10.1007/3-540-45309-1_24openalex-snapshot
Backwards Abstract Interpretation of Probabilistic Programs
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-319-10575-8openalex-snapshot
Handbook of Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_28openalex-snapshot
Model Checking Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-319-29604-3_5openalex-snapshot
Probabilistic Inference by Program Transformation in Hakaru (System Description)
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_1openalex-snapshot
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_3openalex-snapshot
Synthesizing Probabilistic Invariants via Doob’s Decomposition
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_4openalex-snapshot
PSI: Exact Symbolic Inference for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_31openalex-snapshot
A Storm is Coming: A Modern Probabilistic Model Checker
inferredcites →https://doi.org/10.1007/978-3-319-66706-5_1openalex-snapshot
Probabilistic Horn Clause Verification
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_5openalex-snapshot
An Assertion-Based Program Logic for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-89963-3_30openalex-snapshot
Ultimate Automizer and the Search for Perfect Interpolants
inferredcites →https://doi.org/10.1007/978-3-319-94205-6_36openalex-snapshot
Efficient Interpolation for the Theory of Arrays
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_17openalex-snapshot
Abstract Interpretation of Probabilistic Semantics
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_16openalex-snapshot
Probabilistic CEGAR
inferredcites →https://doi.org/10.1007/978-3-540-93900-9_17openalex-snapshot
Abstraction Refinement for Probabilistic Software
inferredcites →https://doi.org/10.1007/978-3-642-03237-0_7openalex-snapshot
Refinement of Trace Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_47openalex-snapshot
PRISM 4.0: Verification of Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1007/978-3-642-27940-9_4openalex-snapshot
Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_9openalex-snapshot
Probabilistic Abstract Interpretation
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_7openalex-snapshot
The MathSAT5 SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_2openalex-snapshot
Software Model Checking for People Who Love Automata
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_22openalex-snapshot
Beautiful Interpolants
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-642-54108-7_1openalex-snapshot
Classifying and Solving Horn Clauses for Verification
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_26openalex-snapshot
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
inferredcites →https://doi.org/10.1007/s10703-010-0097-6openalex-snapshot
A game-based abstraction-refinement framework for Markov decision processes
inferredcites →https://doi.org/10.1007/s10817-016-9365-5openalex-snapshot
Proof Tree Preserving Tree Interpolation
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.021openalex-snapshot
VPHL: A Verified Partial-Correctness Logic for Probabilistic Programs
inferredcites →https://doi.org/10.1016/j.scico.2005.02.008openalex-snapshot
Abstract interpretation of programs as Markov decision processes
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.040openalex-snapshot
Reasoning about probabilistic sequential programs
inferredcites →https://doi.org/10.1023/a:1017584715408openalex-snapshot
Stochastic Boolean Satisfiability
inferredcites →https://doi.org/10.1080/01621459.1965.10480775openalex-snapshot
Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
inferredcites →https://doi.org/10.1109/allerton.2010.5707120openalex-snapshot
Advances and challenges of probabilistic model checking
inferredcites →https://doi.org/10.1109/csf.2011.15openalex-snapshot
Dynamic Enforcement of Knowledge-Based Security Policies
inferredcites →https://doi.org/10.1109/fmcad.2013.6679393openalex-snapshot
Exploring interpolants
inferredcites →https://doi.org/10.1109/fmcad33676.2014openalex-snapshot
2014 Formal Methods in Computer-Aided Design (FMCAD)
inferredcites →https://doi.org/10.1109/focs.2007.41openalex-snapshot
Towards Sharp Inapproximability For Any 2-CSP
inferredcites →https://doi.org/10.1145/1706299.1706353openalex-snapshot
Nested interpolants
inferredcites →https://doi.org/10.1145/1806689.1806787openalex-snapshot
Differential privacy under continual observation
inferredcites →https://doi.org/10.1145/2043621.2043626openalex-snapshot
Private and Continual Release of Statistics
inferredcites →https://doi.org/10.1145/2090236.2090255openalex-snapshot
Fairness through awareness
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2429069.2429086openalex-snapshot
Inductive data flow graphs
inferredcites →https://doi.org/10.1145/2491411.2491423openalex-snapshot
Bayesian inference using data flow analysis
inferredcites →https://doi.org/10.1145/2509136.2509546openalex-snapshot
Verifying quantitative reliability for programs that execute on unreliable hardware
inferredcites →https://doi.org/10.1145/2641638.2641655openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.1145/2837614.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferredcites →https://doi.org/10.1145/2933575.2934574openalex-snapshot
The Probabilistic Model Checking Landscape
inferredcites →https://doi.org/10.1145/3009837.3009864openalex-snapshot
Complexity verification using guided theorem enumeration
inferredcites →https://doi.org/10.1145/3009837.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3035918.3035940openalex-snapshot
Utility Cost of Formal Privacy for Releasing National Employer-Employee Statistics
inferredcites →https://doi.org/10.1145/3133904openalex-snapshot
FairSquare: probabilistic verification of program fairness
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
inferredcites →https://doi.org/10.1145/3158146openalex-snapshot
Synthesizing coupling proofs of differential privacy
inferredcites →https://doi.org/10.1145/3187009.3177733openalex-snapshot
Towards practical differential privacy for SQL queries
inferredcites →https://doi.org/10.1145/3192366.3192399openalex-snapshot
Incremental inference for probabilistic programs
inferredcites →https://doi.org/10.1145/3192366.3192400openalex-snapshot
Bayonet: probabilistic inference for networks
inferredcites →https://doi.org/10.1145/3192366.3192408openalex-snapshot
PMAF: an algebraic framework for static analysis of probabilistic programs
inferredcites →https://doi.org/10.1145/964001.964021openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.1162/153244302760200704openalex-snapshot
10.1162/153244302760200704
inferredcites →https://doi.org/10.1561/0400000042openalex-snapshot
The Algorithmic Foundations of Differential Privacy
inferredcites →https://doi.org/10.1561/9781601988195openalex-snapshot
The Algorithmic Foundations of Differential Privacy
inferredcites →https://doi.org/10.2307/2963594openalex-snapshot
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
inferredcites →https://doi.org/10.48550/arxiv.1602.05681openalex-snapshot
A program logic for union bounds
inferredcites →https://doi.org/10.48550/arxiv.1709.05361openalex-snapshot
Synthesizing Coupling Proofs of Differential Privacy
inferredcites →https://doi.org/10.48550/arxiv.1711.03588openalex-snapshot
A New Proof Rule for Almost-Sure Termination
inferredcites →https://doi.org/10.48550/arxiv.1804.04052openalex-snapshot
Constraint-Based Synthesis of Coupling Proofs
inferredcites →https://doi.org/10.48550/arxiv.1810.12396openalex-snapshot
Trace Abstraction Modulo Probability

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_3openalex-snapshot
Data-Driven Invariant Learning for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_2openalex-snapshot
Automated Tail Bound Analysis for Probabilistic Recurrence Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_1openalex-snapshot
Choose Your Proofs: Commutativity and Symmetry for Smarter Reasoning
inferred← citeshttps://doi.org/10.1007/s10703-024-00466-xopenalex-snapshot
Data-driven invariant learning for probabilistic programs
inferred← citeshttps://doi.org/10.1109/sp40000.2020.00086openalex-snapshot
A Programming Framework for Differential Privacy with Accuracy Concentration Bounds
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00131openalex-snapshot
GAuV: A Graph-Based Automated Verification Framework for Perfect Semi-Honest Security of Multiparty Computation Protocols
inferred← citeshttps://doi.org/10.1145/3341698openalex-snapshot
Synthesizing differentially private programs
inferred← citeshttps://doi.org/10.1145/3371118openalex-snapshot
A language for probabilistically oblivious computation
inferred← citeshttps://doi.org/10.1145/3434289openalex-snapshot
Deciding accuracy of differential privacy schemes
inferred← citeshttps://doi.org/10.1145/3452096openalex-snapshot
A Programming Language for Data Privacy with Accuracy Estimations
inferred← citeshttps://doi.org/10.1145/3453483.3454102openalex-snapshot
Quantitative analysis of assertion violations in probabilistic programs
inferred← citeshttps://doi.org/10.1145/3563344openalex-snapshot
Symbolic execution for randomized programs
inferred← citeshttps://doi.org/10.1145/3674635openalex-snapshot
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3719027.3765043openalex-snapshot
Approximate Algorithms for Verifying Differential Privacy with Gaussian Distributions
inferred← citeshttps://doi.org/10.24963/ijcai.2023/712openalex-snapshot
Data-Driven Invariant Learning for Probabilistic Programs (Extended Abstract)
inferred← citeshttps://doi.org/10.30738/union.v12i3.17730openalex-snapshot
Analysis of students’ difficulties in solving probability questions: The case of advanced certificate of secondary education examination in Tanzania
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.