On the public citation graph
Symbolic execution for randomized programs
0 signed · 73 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferredcites →https://doi.org/10.1007/978-3-030-31157-5_3openalex-snapshot
Constraints in Dynamic Symbolic Execution: Bitvectors or Integers?
inferredcites →https://doi.org/10.1007/978-3-030-31784-3_15openalex-snapshot
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
inferredcites →https://doi.org/10.1007/978-3-030-45190-5_28openalex-snapshot
Mora - Automatic Generation of Moment-Based Invariants
inferredcites →https://doi.org/10.1007/978-3-030-72019-3_18openalex-snapshot
Automated Termination Analysis of Polynomial Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-030-72019-3_8openalex-snapshot
Coupled Relational Symbolic Execution for Differential Privacy
inferredcites →https://doi.org/10.1007/978-3-031-13185-1_3openalex-snapshot
Data-Driven Invariant Learning for Probabilistic Programs
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-41528-4_4openalex-snapshot
PSI: Exact Symbolic Inference for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-96145-3_18openalex-snapshot
Constraint-Based Synthesis of Coupling Proofs
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_7openalex-snapshot
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
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-28869-2_9openalex-snapshot
Probabilistic Abstract Interpretation
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-40196-1_17openalex-snapshot
Prinsys—On a Quest for Probabilistic Loop Invariants
inferredcites →https://doi.org/10.1007/s10009-021-00633-zopenalex-snapshot
The probabilistic model checker Storm
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.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferredcites →https://doi.org/10.1017/9781108770750.006openalex-snapshot
Probabilistic Couplings from Program Logics
inferredcites →https://doi.org/10.1109/ase.2015.78openalex-snapshot
Quantification of Software Changes through Probabilistic Symbolic Execution (N)
inferredcites →https://doi.org/10.1109/icdcs.2011.28openalex-snapshot
Scalable Symbolic Execution of Distributed Systems
inferredcites →https://doi.org/10.1109/icse.2013.6606608openalex-snapshot
Reliability analysis in Symbolic PathFinder
inferredcites →https://doi.org/10.1109/icse.2019.00071openalex-snapshot
Statistical Algorithmic Profiling for Randomized Approximate Programs
inferredcites →https://doi.org/10.1145/1646353.1646374openalex-snapshot
A few billion lines of code later
inferredcites →https://doi.org/10.1145/2254064.2254086openalex-snapshot
Proving acceptability properties of relaxed nondeterministic approximate programs
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2338965.2336773openalex-snapshot
Probabilistic symbolic execution
inferredcites →https://doi.org/10.1145/2491411.2491423openalex-snapshot
Bayesian inference using data flow analysis
inferredcites →https://doi.org/10.1145/2499370.2462179openalex-snapshot
Static analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/2594291.2594294openalex-snapshot
Expressing and verifying probabilistic assertions
inferredcites →https://doi.org/10.1145/2666356.2594329openalex-snapshot
Compositional solution space quantification for probabilistic software analysis
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/2884781.2884794openalex-snapshot
Generating performance distributions via probabilistic symbolic execution
inferredcites →https://doi.org/10.1145/3133904openalex-snapshot
FairSquare: probabilistic verification of program fairness
inferredcites →https://doi.org/10.1145/3158146openalex-snapshot
Synthesizing coupling proofs of differential privacy
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/3354166.3354175openalex-snapshot
Relational Symbolic Execution
inferredcites →https://doi.org/10.1145/3385412.3386006openalex-snapshot
λPSI: exact inference for higher-order probabilistic programs
inferredcites →https://doi.org/10.1145/3428208openalex-snapshot
Scaling exact inference for discrete probabilistic programs
inferredcites →https://doi.org/10.1145/3434289openalex-snapshot
Deciding accuracy of differential privacy schemes
inferredcites →https://doi.org/10.1145/3445814.3446764openalex-snapshot
Probabilistic profiling of stateful data planes for adversarial testing
inferredcites →https://doi.org/10.1145/3453483.3454062openalex-snapshot
Central moment analysis for cost accumulators in probabilistic programs
inferredcites →https://doi.org/10.1145/3563344openalex-snapshot
Symbolic execution for randomized programs
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.5281/zenodo.7061818openalex-snapshot
Artifact for Symbolic Execution for Randomized Programs
inferredcites →https://doi.org/10.5555/1855741.1855756openalex-snapshot
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
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-43835-6_23openalex-snapshot
Symbolic Semantics for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-40374-2_11openalex-snapshot
Verifying $$\varepsilon $$-Differential Privacy Bit by Bit
inferred← citeshttps://doi.org/10.1016/j.suscom.2026.101464openalex-snapshot
Optimising dynamic symbolic execution processes for large-scale software systems via deep learning-based neighbourhood policies
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00101openalex-snapshot
An Integrated Program Analysis Framework for Graduate Courses in Programming Languages and Software Engineering
inferred← citeshttps://doi.org/10.1109/icse-seet58685.2023.00021openalex-snapshot
A Theorem Proving Approach to Programming Language Semantics
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00190openalex-snapshot
Empc: Effective Path Prioritization for Symbolic Execution with Path Cover
inferred← citeshttps://doi.org/10.1109/tse.2025.3567423openalex-snapshot
Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
inferred← citeshttps://doi.org/10.1142/s0218194025300027openalex-snapshot
A Systematic Literature Review of Software Vulnerability Mining Approaches Based on Symbolic Execution
inferred← citeshttps://doi.org/10.1142/s0218194025500457openalex-snapshot
A Reinforcement Learning-Based Approach for Determining Infeasible Paths of Programs
inferred← citeshttps://doi.org/10.1145/3597503.3639078openalex-snapshot
Concrete Constraint Guided Symbolic Execution
inferred← citeshttps://doi.org/10.1145/3622870openalex-snapshot
A Deductive Verification Infrastructure for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3656419openalex-snapshot
Symbolic Execution for Quantum Error Correction Programs
inferred← citeshttps://doi.org/10.1145/3720501openalex-snapshot
A Unifying Approach to Product Constructions for Quantitative Temporal Inference
inferred← citeshttps://doi.org/10.1145/3729334openalex-snapshot
Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3808343openalex-snapshot
Categorical Semantics of Probabilistic Symbolic Execution
inferred← citeshttps://doi.org/10.4204/eptcs.428.8openalex-snapshot
Parallelizable Feynman-Kac Models for Universal Probabilistic Programming
showing the first 17 of 18 · page through all 18
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.