On the public citation graph
Executable Analysis using Abstract Interpretation with Circular Linear Progressions
0 signed · 33 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/978-3-540-24723-4_2openalex-snapshot
Analyzing Memory Accesses in x86 Executables
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_85openalex-snapshot
A Note on Karr’s Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_23openalex-snapshot
The Octahedron Abstract Domain
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1023/a:1008186323068openalex-snapshot
Efficient and Precise Cache Behavior Prediction for Real-Time Systems
inferredcites →https://doi.org/10.1023/a:1008678014487openalex-snapshot
Verification of Real-Time Systems using Linear Relation Analysis
inferredcites →https://doi.org/10.1109/memcod.2007.371251openalex-snapshot
Executable Analysis using Abstract Interpretation with Circular Linear Progressions
inferredcites →https://doi.org/10.1145/268946.268948openalex-snapshot
Alias analysis of executable code
inferredcites →https://doi.org/10.1145/964001.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
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-20652-9_8openalex-snapshot
Using Binary Analysis Frameworks: The Case for BAP and angr
inferred← citeshttps://doi.org/10.1007/978-3-031-50524-9_3openalex-snapshot
Generation of Violation Witnesses by Under-Approximating Abstract Interpretation
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-66706-5_17openalex-snapshot
A New Abstraction Framework for Affine Transformers
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_3openalex-snapshot
Static Timing Analysis for Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-24349-3_6openalex-snapshot
Improving the Precision of WCET Analysis by Input Constraints and Model-Derived Flow Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-35182-2_9openalex-snapshot
Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code
inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_15openalex-snapshot
Solving Difference Constraints over Modular Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_3openalex-snapshot
Abstract Interpretation over Non-lattice Abstract Domains
inferred← citeshttps://doi.org/10.1007/s10703-018-0325-zopenalex-snapshot
A new abstraction framework for affine transformers
inferred← citeshttps://doi.org/10.1007/s10703-022-00399-3openalex-snapshot
Relational abstract interpretation of arrays in assembly code
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.09.002openalex-snapshot
Exact join detection for convex polyhedra and other numerical abstractions
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.003openalex-snapshot
Fully Bounded Polyhedral Analysis of Integers with Wrapping
inferred← citeshttps://doi.org/10.1016/j.scico.2016.07.006openalex-snapshot
Improved precision in polyhedral analysis with wrapping
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678584openalex-snapshot
ASE: A Value Set Decision Procedure for Symbolic Execution
inferred← citeshttps://doi.org/10.1109/tcad.2009.2013287openalex-snapshot
Memory Hierarchies, Pipelines, and Buses for Future Architectures in Time-Critical Embedded Systems
inferred← citeshttps://doi.org/10.1145/1289927.1289960openalex-snapshot
WCET estimation for executables in the presence of data caches
inferred← citeshttps://doi.org/10.1145/1629335.1629370openalex-snapshot
Probabilistic modeling of data cache behavior
inferred← citeshttps://doi.org/10.1145/2651360openalex-snapshot
Interval Analysis and Machine Arithmetic
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2013.42openalex-snapshot
Multi-architecture Value Analysis for Machine Code
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2015.85openalex-snapshot
Analysing Switch-Case Code with Abstract Execution
inferred← citeshttps://doi.org/10.70675/5c48fbd2z0163z458ez9d37z9b9a04bfba0dopenalex-snapshot
Détermination de propriétés de flot de données pour améliorer les estimations de temps d'exécution pire-cas
showing the first 22 of 23 · page through all 23
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.