On the public citation graph

Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation

0 signed · 53 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.1023/a:1008189014032openalex-snapshot
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
inferredcites →https://doi.org/10.1109/isorc.2007.36openalex-snapshot
Experiences from Applying WCET Analysis in Industrial Settings
inferredcites →https://doi.org/10.1109/rtss.2006.12openalex-snapshot
Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/93542.93583openalex-snapshot
Automatic recognition of induction variables and recurrence relations by abstract interpretation
inferredcites →https://doi.org/10.1145/93548.93583openalex-snapshot
Automatic recognition of induction variables and recurrence relations by abstract interpretation
inferredcites →https://doi.org/10.4230/oasics.wcet.2007.1193openalex-snapshot
Data-Flow Based Detection of Loop Bounds
inferredcites →https://doi.org/10.4230/oasics.wcet.2007.1194openalex-snapshot
Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118790229.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/cpe.3154openalex-snapshot
ResAna: a resource analysis toolset for (real‐time) JAVA
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_8openalex-snapshot
Towards a Dereversibilizer: Fewer Asserts, Statically
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_9openalex-snapshot
Computing Exact Loop Bounds for Bounded Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-16256-5_6openalex-snapshot
OTAWA: An Open Toolbox for Adaptive WCET Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-16561-0_43openalex-snapshot
Partial Flow Analysis with oRange
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_34openalex-snapshot
r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_20openalex-snapshot
Symbolic Loop Bound Computation for WCET Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-36424-2_29openalex-snapshot
Predictable Two-Level Bus Arbitration for Heterogeneous Task Sets
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_5openalex-snapshot
Data-Dependent WAR Analysis for Efficient Task-Based Intermittent Computing
inferred← citeshttps://doi.org/10.1007/s11227-014-1308-5openalex-snapshot
Modeling flow information of loops using compositional condition of controls
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.11.005openalex-snapshot
Normalisation of Loops with Covariant Variables
inferred← citeshttps://doi.org/10.1016/j.infsof.2022.107068openalex-snapshot
Integrating DSGEO into test case generation for path coverage of MPI programs
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.006openalex-snapshot
Certifying execution time in multicores
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102304openalex-snapshot
A generic framework to integrate data caches in the WCET analysis of real-time systems
inferred← citeshttps://doi.org/10.1109/emc.2010.5575754openalex-snapshot
MBBA: A Multi-Bandwidth Bus Arbiter for Hard Real-Time
inferred← citeshttps://doi.org/10.1109/etfa.2011.6059179openalex-snapshot
Predictable bus arbitration schemes for heterogeneous time-critical workloads running on multicore processors
inferred← citeshttps://doi.org/10.1109/icpp.2013.63openalex-snapshot
Symbolic Analysis of Concurrency Errors in OpenMP Programs
inferred← citeshttps://doi.org/10.1109/iri.2016.22openalex-snapshot
Modular Verification of Termination and Execution Time Bounds Using Separation Logic
inferred← citeshttps://doi.org/10.1109/isorc52013.2021.00019openalex-snapshot
Experiences from Adjusting Industrial Software for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1109/itng.2011.134openalex-snapshot
A New Approach to Determine Number of Loop Iterations for WCET Analysis
inferred← citeshttps://doi.org/10.1109/mm.2010.78openalex-snapshot
Merasa: Multicore Execution of Hard Real-Time Applications Supporting Analyzability
inferred← citeshttps://doi.org/10.1109/rtas.2009.29openalex-snapshot
Guaranteed Loop Bound Identification from Program Traces for WCET
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.11openalex-snapshot
Improving WCET Analysis Precision through Automata Product
inferred← citeshttps://doi.org/10.1109/rtss.2008.9openalex-snapshot
Predictable Out-of-Order Execution Using Virtual Traces
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00022openalex-snapshot
Reconciling Compiler Optimizations and WCET Estimation Using Iterative Compilation
inferred← citeshttps://doi.org/10.1109/tc.2010.59openalex-snapshot
Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1109/tc.2013.28openalex-snapshot
A Predictable Framework for Safety-Critical Embedded Systems
inferred← citeshttps://doi.org/10.1145/1772643.1772663openalex-snapshot
Experimentation of WCET computation on both ends of automotive processor range
inferred← citeshttps://doi.org/10.1145/1852761.1852776openalex-snapshot
Test-based inference of polynomial loop-bound functions
inferred← citeshttps://doi.org/10.1145/2388936.2388959openalex-snapshot
Making resource analysis practical for real-time Java
inferred← citeshttps://doi.org/10.1145/2392987.2392999openalex-snapshot
FFX
inferred← citeshttps://doi.org/10.1145/2609248.2609261openalex-snapshot
Minimizing the cost of synchronisations in the WCET of real-time parallel programs
inferred← citeshttps://doi.org/10.1145/3133956.3134009openalex-snapshot
Mass Discovery of Android Traffic Imprints through Instantiated Partial Execution
inferred← citeshttps://doi.org/10.1371/journal.pone.0229980openalex-snapshot
Reducing the WCET and analysis time of systems with simple lockable instruction caches
inferred← citeshttps://doi.org/10.4230/lites-v004-i002-a002openalex-snapshot
EMSBench: Benchmark and Testbed for Reactive Real-Time Systems
inferred← citeshttps://doi.org/10.4230/lites-v006-i001-a002openalex-snapshot
Improving WCET Evaluation using Linear Relation Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2009.2280openalex-snapshot
Worst-Case Timing Estimation and Architecture Exploration in Early Design Phases
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2009.2290openalex-snapshot
A Generic Framework for Blackbox Components in WCET Computation
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2013.32openalex-snapshot
Program Semantics in Model-Based WCET Analysis: A State of the Art Perspective
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2014.93openalex-snapshot
Identifying Relevant Parameters to Improve WCET Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2015.33openalex-snapshot
GenE: A Benchmark Generator for WCET Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6031openalex-snapshot
A framework to experiment optimizations for real-time and embedded software
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
inferred← citeshttps://doi.org/10.70675/fcf804bfz26f7z49a0z9d70z24d28bca5c4aopenalex-snapshot
Certified Compilation and Worst-Case Execution Time Estimation
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.