On the public citation graph
Refinement of path expressions for static analysis
0 signed · 66 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.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/978-3-319-12736-1_15openalex-snapshot
Resource Analysis of Complex Programs with Cost Equations
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_20openalex-snapshot
The SeaHorn Verification Framework
inferredcites →https://doi.org/10.1007/978-3-319-99725-4_3openalex-snapshot
Numerical Invariants via Abstract Machines
inferredcites →https://doi.org/10.1007/978-3-540-27815-3_22openalex-snapshot
Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs
inferredcites →https://doi.org/10.1007/978-3-642-11319-2_16openalex-snapshot
Automatic Abstraction for Congruences
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_57openalex-snapshot
Simplifying Loop Invariant Generation Using Splitter Predicates
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_38openalex-snapshot
Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_53openalex-snapshot
Ultimate Automizer with SMTInterpol
inferredcites →https://doi.org/10.1016/0304-3975(96)00072-2openalex-snapshot
Precise interprocedural dataflow analysis with applications to constant propagation
inferredcites →https://doi.org/10.1016/j.entcs.2005.02.028openalex-snapshot
Kleene Algebra and Bytecode Verification
inferredcites →https://doi.org/10.1016/j.entcs.2010.09.002openalex-snapshot
A Modular Static Analysis Approach to Affine Loop Invariants Detection
inferredcites →https://doi.org/10.1016/j.scico.2005.02.009openalex-snapshot
Weighted pushdown systems and their application to interprocedural dataflow analysis
inferredcites →https://doi.org/10.1109/fmcad.2015.7542253openalex-snapshot
Compositional recurrence analysis
inferredcites →https://doi.org/10.1109/tc.1981.1675827openalex-snapshot
Trace Scheduling: A Technique for Global Microcode Compaction
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0204007openalex-snapshot
Finding All the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1145/1275497.1275501openalex-snapshot
The trace partitioning abstract domain
inferredcites →https://doi.org/10.1145/1275497.1275504openalex-snapshot
Analysis of modular arithmetic
inferredcites →https://doi.org/10.1145/1375581.1375615openalex-snapshot
Sound, complete and scalable path-sensitive analysis
inferredcites →https://doi.org/10.1145/1542476.1542518openalex-snapshot
Control-flow refinement and progress invariants for bound analysis
inferredcites →https://doi.org/10.1145/1629335.1629343openalex-snapshot
Refining the control structure of loops using static analysis
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/2509136.2509511openalex-snapshot
Inductive invariant generation via abductive inference
inferredcites →https://doi.org/10.1145/2535838.2535857openalex-snapshot
Symbolic optimization with SMT solvers
inferredcites →https://doi.org/10.1145/2578855.2535857openalex-snapshot
Symbolic optimization with SMT solvers
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/277650.277665openalex-snapshot
Improving data-flow analysis with path profiles
inferredcites →https://doi.org/10.1145/3062341.3062373openalex-snapshot
Compositional recurrence analysis revisited
inferredcites →https://doi.org/10.1145/3158142openalex-snapshot
Non-linear reasoning for invariant synthesis
inferredcites →https://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferredcites →https://doi.org/10.1145/322261.322273openalex-snapshot
Fast Algorithms for Solving Path Problems
inferredcites →https://doi.org/10.1145/503272.503290openalex-snapshot
Systematic design of program transformation frameworks by abstract interpretation
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/604131.604137openalex-snapshot
A generic approach to the static analysis of concurrent programs with procedures
inferredcites →https://doi.org/10.1145/640128.604137openalex-snapshot
A generic approach to the static analysis of concurrent programs with procedures
inferredcites →https://doi.org/10.1145/964001.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
inferredcites →https://doi.org/10.48550/arxiv.1310.3481openalex-snapshot
An Algebraic Framework for Compositional Program Analysis
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-32304-2_13openalex-snapshot
Verifying Numerical Programs via Iterative Abstract Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_1openalex-snapshot
Calculational Design of a Regular Model Checker by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_32openalex-snapshot
Ultimate Taipan with Symbolic Interpretation and Fluid Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_3openalex-snapshot
Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_3openalex-snapshot
Reflections on Termination of Linear Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_20openalex-snapshot
On Polynomial Expressions with C-Finite Recurrences in Loops with Nested Nondeterministic Branches
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-031-82700-6_9openalex-snapshot
Affine Disjunctive Invariant Generation with Farkas’ Lemma
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.037openalex-snapshot
Calculational design of a regular model checker by abstract interpretation
inferred← citeshttps://doi.org/10.1145/3410313openalex-snapshot
Replication Package for Article: Termination Analysis without the Tears
inferred← citeshttps://doi.org/10.1145/3434296openalex-snapshot
Learning the boundary of inductive invariants
inferred← citeshttps://doi.org/10.1145/3434298openalex-snapshot
Verifying correct usage of context-free API protocols
inferred← citeshttps://doi.org/10.1145/3453483.3454110openalex-snapshot
Termination analysis without the tears
inferred← citeshttps://doi.org/10.1145/3464457openalex-snapshot
A Survey of Parametric Static Analysis
inferred← citeshttps://doi.org/10.1145/3571237openalex-snapshot
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic
inferred← citeshttps://doi.org/10.1145/3586028openalex-snapshot
Solving Conditional Linear Recurrences for Program Verification: The Periodic Case
inferred← citeshttps://doi.org/10.1145/3632867openalex-snapshot
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis
inferred← citeshttps://doi.org/10.1145/3704901openalex-snapshot
An Incremental Algorithm for Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1145/3798216openalex-snapshot
Mechanically Translating Iterative Dataflow Analysis to Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1145/3808307openalex-snapshot
A Categorical Basis for Robust Program Analysis
inferred← citeshttps://doi.org/10.4204/eptcs.344.3openalex-snapshot
Regular Path Clauses and Their Application in Solving Loops
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.