On the public citation graph

Program analysis via efficient symbolic abstraction

0 signed · 75 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/11814948_18openalex-snapshot
On SAT Modulo Theories and Optimization Problems
inferredcites →https://doi.org/10.1007/11817963_39openalex-snapshot
SMT Techniques for Fast Predicate Abstraction
inferredcites →https://doi.org/10.1007/11823230_2openalex-snapshot
Static Analysis in Disjunctive Numerical Domains
inferredcites →https://doi.org/10.1007/978-3-030-72013-1_8openalex-snapshot
Syntax-Guided Quantifier Instantiation
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_4openalex-snapshot
Scalable Approximation of Quantitative Information Flow in Programs
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_23openalex-snapshot
Evaluating Design Tradeoffs in Numeric Static Analysis for Java
inferredcites →https://doi.org/10.1007/978-3-319-94205-6_10openalex-snapshot
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_15openalex-snapshot
Delta-Decision Procedures for Exists-Forall Problems over the Reals
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_39openalex-snapshot
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis
inferredcites →https://doi.org/10.1007/978-3-540-78739-6_16openalex-snapshot
Cover Algorithms and Their Combination
inferredcites →https://doi.org/10.1007/978-3-540-78791-4_14openalex-snapshot
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_51openalex-snapshot
Quantifier Elimination by Lazy Model Enumeration
inferredcites →https://doi.org/10.1007/978-3-642-15769-1_11openalex-snapshot
Automatic Abstraction for Intervals Using Boolean Formulae
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_10openalex-snapshot
Bilateral Algorithms for Symbolic Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_6openalex-snapshot
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_14openalex-snapshot
νZ - An Optimizing SMT Solver
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_27openalex-snapshot
Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_53openalex-snapshot
Bit-Vector Optimization
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_15openalex-snapshot
Counterexample-Guided Model Synthesis
inferredcites →https://doi.org/10.1007/s10703-012-0156-2openalex-snapshot
Efficiently solving quantified bit-vector formulas
inferredcites →https://doi.org/10.1007/s10703-016-0249-4openalex-snapshot
SMT-based model checking for recursive programs
inferredcites →https://doi.org/10.1007/s10990-006-8609-1openalex-snapshot
The octagon abstract domain
inferredcites →https://doi.org/10.1007/s12532-016-0104-zopenalex-snapshot
Computing convex hulls and counting integer points with polymake
inferredcites →https://doi.org/10.1016/j.entcs.2010.09.003openalex-snapshot
Range and Set Abstraction using SAT
inferredcites →https://doi.org/10.1016/j.entcs.2012.10.003openalex-snapshot
Fully Bounded Polyhedral Analysis of Integers with Wrapping
inferredcites →https://doi.org/10.1016/j.entcs.2015.02.003openalex-snapshot
PostHat and All That: Automating Abstract Interpretation
inferredcites →https://doi.org/10.1016/j.jpaa.2008.11.043openalex-snapshot
New developments in the theory of Gröbner bases and applications to formal verification
inferredcites →https://doi.org/10.1016/s0004-3702(01)00068-6openalex-snapshot
From binary temporal relations to non-binary ones and back☆☆Parts of this paper have been published in [36] and in [39].
inferredcites →https://doi.org/10.1016/s0304-4076(03)00100-3openalex-snapshot
An MCMC approach to classical estimation
inferredcites →https://doi.org/10.1016/s0747-7171(88)80016-6openalex-snapshot
A bibliography of quantifier elimination for real closed fields
inferredcites →https://doi.org/10.1093/comjnl/36.5.450openalex-snapshot
Applying Linear Quantifier Elimination
inferredcites →https://doi.org/10.1109/fmcad.2009.5351147openalex-snapshot
Software model checking via large-block encoding
inferredcites →https://doi.org/10.1109/hldvt.2009.5340162openalex-snapshot
Modular arithmetic decision procedure with auto-correction mechanism
inferredcites →https://doi.org/10.1109/iccad.2007.4397275openalex-snapshot
Stimulus generation for constrained random simulation
inferredcites →https://doi.org/10.1109/msp.2016.14openalex-snapshot
The DARPA Cyber Grand Challenge: A Competitor's Perspective, Part 2
inferredcites →https://doi.org/10.1109/msp.2016.77openalex-snapshot
Putting the "Systems" in Security Engineering: An Examination of NIST Special Publication 800-160
inferredcites →https://doi.org/10.1109/sp.2016.17openalex-snapshot
SOK: (State of) The Art of War: Offensive Techniques in Binary Analysis
inferredcites →https://doi.org/10.1109/sp.2017.67openalex-snapshot
Your Exploit is Mine: Automatic Shellcode Transplant for Remote Exploits
inferredcites →https://doi.org/10.1109/sp35280.2016openalex-snapshot
2016 IEEE Symposium on Security and Privacy (SP)
inferredcites →https://doi.org/10.1137/0217060openalex-snapshot
On the Complexity of Computing the Volume of a Polyhedron
inferredcites →https://doi.org/10.1145/1024393.1024410openalex-snapshot
HOIST
inferredcites →https://doi.org/10.1145/1250734.1250746openalex-snapshot
Valgrind
inferredcites →https://doi.org/10.1145/1480881.1480899openalex-snapshot
Automatic modular abstractions for linear constraints
inferredcites →https://doi.org/10.1145/1536414.1536491openalex-snapshot
Random walks on polytopes and an affine interior point method for linear programming
inferredcites →https://doi.org/10.1145/2103656.2103675openalex-snapshot
Constraints as control
inferredcites →https://doi.org/10.1145/2450136.2450139openalex-snapshot
TSL
inferredcites →https://doi.org/10.1145/2463209.2488880openalex-snapshot
A robust constraint solving framework for multiple constraint sets in constrained random verification
inferredcites →https://doi.org/10.1145/2535838.2535857openalex-snapshot
Symbolic optimization with SMT solvers
inferredcites →https://doi.org/10.1145/2597809.2597817openalex-snapshot
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics
inferredcites →https://doi.org/10.1145/2651360openalex-snapshot
Interval Analysis and Machine Arithmetic
inferredcites →https://doi.org/10.1145/2699915openalex-snapshot
Optimization Modulo Theories with Linear Rational Costs
inferredcites →https://doi.org/10.1145/2737924.2738000openalex-snapshot
Making numerical program analysis fast
inferredcites →https://doi.org/10.1145/3009837.3009885openalex-snapshot
Fast polyhedra abstract domain
inferredcites →https://doi.org/10.1145/3180155.3180248openalex-snapshot
Efficient sampling of SAT solutions for testing
inferredcites →https://doi.org/10.1145/3314221.3314601openalex-snapshot
A complete formal semantics of x86-64 user-level instruction set architecture
inferredcites →https://doi.org/10.1145/3385412.3386016openalex-snapshot
Learning fast and precise numerical analysis
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/780822.781153openalex-snapshot
A static analyzer for large safety-critical software
inferredcites →https://doi.org/10.1145/781131.781153openalex-snapshot
A static analyzer for large safety-critical software
inferredcites →https://doi.org/10.1145/800022.808314openalex-snapshot
Static determination of dynamic properties of generalized type unions
inferredcites →https://doi.org/10.1287/moor.1110.0519openalex-snapshot
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
inferredcites →https://doi.org/10.48550/arxiv.1710.08165openalex-snapshot
Fast MCMC sampling algorithms on polytopes

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-63498-7_27openalex-snapshot
Generalized Optimization Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-032-04200-2_9openalex-snapshot
Leveraging Large Language Models for Software Defect Detection
inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_8openalex-snapshot
Bounded-Exhaustive Subspace Diversification for SMT Solver Testing
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_4openalex-snapshot
Sound and Precise Symbolic Automata Model for Stateful Software Systems
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00069openalex-snapshot
Demystifying Template-Based Invariant Generation for Bit-Vector Programs
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00128openalex-snapshot
Improving NLSAT for Nonlinear Real Arithmetic
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00059openalex-snapshot
Titan : Efficient Multi-target Directed Greybox Fuzzing
inferred← citeshttps://doi.org/10.1145/3597503.3639220openalex-snapshot
Precise Sparse Abstract Execution via Cross-Domain Interaction
inferred← citeshttps://doi.org/10.1145/3622861openalex-snapshot
Synthesizing Specifications
inferred← citeshttps://doi.org/10.1145/3689765openalex-snapshot
Scaling Abstraction Refinement for Program Analyses in Datalog using Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3728905openalex-snapshot
Program Analysis Combining Generalized Bit-Level and Word-Level Abstractions
inferred← citeshttps://doi.org/10.1145/3839537openalex-snapshot
Validating Optimizing SMT Solvers via Cross-Theory Approximation
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.