On the public citation graph
Static Analysis in Disjunctive Numerical Domains
0 signed · 103 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/11513988_31openalex-snapshot
F-Soft: Software Verification Platform
inferredcites →https://doi.org/10.1007/11609773_8openalex-snapshot
Efficient Strongly Relational Polyhedral Analysis
inferredcites →https://doi.org/10.1007/3-540-45013-0_7openalex-snapshot
Two Variables per Linear Inequality as an Abstract Domain
inferredcites →https://doi.org/10.1007/3-540-45789-5_17openalex-snapshot
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
inferredcites →https://doi.org/10.1007/3-540-49727-7_12openalex-snapshot
Refining Static Analyses by Trace-Based Partitioning Using Control Flow
inferredcites →https://doi.org/10.1007/3-540-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_13openalex-snapshot
Widening Operators for Powerset Domains
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_20openalex-snapshot
Partially Disjunctive Heap Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_23openalex-snapshot
The Octahedron Abstract Domain
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_2openalex-snapshot
Scalable Analysis of Linear Systems Using Mathematical Programming
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_2openalex-snapshot
Trace Partitioning in Abstract Interpretation Based Static Analyzers
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_4openalex-snapshot
Assigning Meanings to Programs
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1016/s0167-6423(97)00034-8openalex-snapshot
Optimal domains for disjunctive abstract interpretation
inferredcites →https://doi.org/10.1023/a:1008678014487openalex-snapshot
Verification of Real-Time Systems using Linear Relation Analysis
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1109/iccd.2005.77openalex-snapshot
Model checking C programs using F-Soft
inferredcites →https://doi.org/10.1145/349299.349325openalex-snapshot
Symbolic bounds analysis of pointers, array indices, and accessed memory regions
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
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
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-030-88806-0_3openalex-snapshot
Backward Symbolic Execution with Loop Folding
inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_2openalex-snapshot
Trace Partitioning as an Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_7openalex-snapshot
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_28openalex-snapshot
Synthesizing Predicates from Abstract Domain Losses
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_10openalex-snapshot
Type-Based Amortized Resource Analysis with Integers and Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_5openalex-snapshot
ICE: A Robust Framework for Learning Invariants
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_19openalex-snapshot
A Decision Tree Abstract Domain for Proving Conditional Termination
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_27openalex-snapshot
Sound Bit-Precise Numerical Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_12openalex-snapshot
Compositional Safety Refutation Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_23openalex-snapshot
Volume-Based Merge Heuristics for Disjunctive Numeric Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_13openalex-snapshot
Inferring Min and Max Invariants Using Max-Plus Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_16openalex-snapshot
SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_20openalex-snapshot
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_40openalex-snapshot
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_26openalex-snapshot
Inferring Disjunctive Postconditions
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_3openalex-snapshot
From Hardware Verification to Software Verification: Re-use and Re-learn
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_13openalex-snapshot
Constraint-Based Invariant Inference over Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_16openalex-snapshot
Automated Analysis of Java Methods for Confidentiality
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_9openalex-snapshot
Proving the Correctness of the Implementation of a Control-Command Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_18openalex-snapshot
Boxes: A Symbolic Abstract Domain of Boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_9openalex-snapshot
Linear Absolute Value Relation Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_53openalex-snapshot
FixBag: A Fixpoint Calculator for Quantified Bag Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_27openalex-snapshot
Using Bounded Model Checking to Focus Fixpoint Iterations
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_5openalex-snapshot
Modular Abstractions of Reactive Nodes Using Disjunctive Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_16openalex-snapshot
Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_5openalex-snapshot
Numeric Bounds Analysis with Conflict-Driven Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_21openalex-snapshot
Verification as Learning Geometric Concepts
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_29openalex-snapshot
The Domain of Parametric Hypercubes for Static Analysis of Computer Games Software
inferred← citeshttps://doi.org/10.1007/978-3-662-48288-9_3openalex-snapshot
A Binary Decision Tree Abstract Domain Functor
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_9openalex-snapshot
$$D^3$$ : Data-Driven Disjunctive Abstraction
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_18openalex-snapshot
An Abstract Domain of Linear Templates with Disjunctive Right-Hand-Side Intervals
inferred← citeshttps://doi.org/10.1007/s10515-014-0164-0openalex-snapshot
Scalable and scope-bounded software verification in Varvel
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.008openalex-snapshot
Quadtrees as an Abstract Domain
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.005openalex-snapshot
Sweeping in Abstract Interpretation
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.10.004openalex-snapshot
Reachability analysis for timed automata using max-plus algebra
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.004openalex-snapshot
Dual analysis for proving safety and finding bugs
inferred← citeshttps://doi.org/10.1016/j.scico.2015.11.011openalex-snapshot
Improving static analyses of C programs with conditional predicates
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.013openalex-snapshot
Efficient SAT-based bounded model checking for software verification
inferred← citeshttps://doi.org/10.1017/s0956796815000192openalex-snapshot
Type-based amortized resource analysis with integers and arrays
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/cdc.2015.7402003openalex-snapshot
Deadlock-free discrete controller synthesis for infinite state systems
inferred← citeshttps://doi.org/10.1109/icse-nier.2019.00032openalex-snapshot
Robustness of Neural Networks: A Probabilistic and Practical Approach
inferred← citeshttps://doi.org/10.1109/sefm.2008.35openalex-snapshot
PED: Proof-Guided Error Diagnosis by Triangulation of Program Error Causes
inferred← citeshttps://doi.org/10.1109/sp.2018.00058openalex-snapshot
AI2: Safety and Robustness Certification of Neural Networks with Abstract Interpretation
inferred← citeshttps://doi.org/10.1109/sp46214.2022.9833751openalex-snapshot
BEACON: Directed Grey-Box Fuzzing with Provable Path Pruning
inferred← citeshttps://doi.org/10.1109/tcad.2008.925777openalex-snapshot
Bitwidth Reduction via Symbolic Interval Analysis for Software Model Checking
inferred← citeshttps://doi.org/10.1145/1190215.1190249openalex-snapshot
Variance analyses from invariance analyses
inferred← citeshttps://doi.org/10.1145/1190216.1190249openalex-snapshot
Variance analyses from invariance analyses
inferred← citeshttps://doi.org/10.1145/1328408.1328434openalex-snapshot
A practical and precise inference and specializer for array bound checks elimination
inferred← citeshttps://doi.org/10.1145/1375634.1375656openalex-snapshot
Analysing memory resource bounds for low-level programs
inferred← citeshttps://doi.org/10.1145/1455229.1455239openalex-snapshot
Model checking sequential software programs via mixed symbolic analysis
inferred← citeshttps://doi.org/10.1145/1542476.1542518openalex-snapshot
Control-flow refinement and progress invariants for bound analysis
inferred← citeshttps://doi.org/10.1145/1543135.1542518openalex-snapshot
Control-flow refinement and progress invariants for bound analysis
inferred← citeshttps://doi.org/10.1145/1629335.1629343openalex-snapshot
Refining the control structure of loops using static analysis
inferred← citeshttps://doi.org/10.1145/1706299.1706309openalex-snapshot
Program analysis via satisfiability modulo path programs
inferred← citeshttps://doi.org/10.1145/1707801.1706309openalex-snapshot
Program analysis via satisfiability modulo path programs
inferred← citeshttps://doi.org/10.1145/1774088.1774538openalex-snapshot
Dual analysis for proving safety and finding bugs
inferred← citeshttps://doi.org/10.1145/2535838.2535853openalex-snapshot
Bias-variance tradeoffs in program analysis
inferred← citeshttps://doi.org/10.1145/2568225.2568275openalex-snapshot
Using dynamic analysis to generate disjunctive invariants
inferred← citeshttps://doi.org/10.1145/2578855.2535853openalex-snapshot
Bias-variance tradeoffs in program analysis
inferred← citeshttps://doi.org/10.1145/2656045.2656060openalex-snapshot
Infinite horizon safety controller synthesis through disjunctive polyhedral abstract interpretation
inferred← citeshttps://doi.org/10.1145/2695664.2695690openalex-snapshot
Programs from proofs of predicated dataflow analyses
inferred← citeshttps://doi.org/10.1145/2908080.2908099openalex-snapshot
Data-driven precondition inference with learned features
inferred← citeshttps://doi.org/10.1145/2980983.2908099openalex-snapshot
Data-driven precondition inference with learned features
inferred← citeshttps://doi.org/10.1145/3395363.3397378openalex-snapshot
Fast bit-vector satisfiability
inferred← citeshttps://doi.org/10.1145/3427762.3429453openalex-snapshot
Abstract domains for constraint programming with differential equations
inferred← citeshttps://doi.org/10.1145/3428203openalex-snapshot
Automated policy synthesis for system call sandboxing
inferred← citeshttps://doi.org/10.1145/3453483.3454086openalex-snapshot
Path-sensitive sparse analysis without path conditions
inferred← citeshttps://doi.org/10.1145/3485495openalex-snapshot
Program analysis via efficient symbolic abstraction
inferred← citeshttps://doi.org/10.1145/3540250.3549166openalex-snapshot
Multi-phase invariant synthesis
inferred← citeshttps://doi.org/10.1145/3656400openalex-snapshot
Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis
inferred← citeshttps://doi.org/10.70675/29d13f3dzed55z419cz9a8ez6fb2580c999dopenalex-snapshot
Static analysis by abstract interpretation of functional temporal properties of programs
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.