On the public citation graph
Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution
0 signed · 180 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.1023/a:1008189014032openalex-snapshot
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
inferredcites →https://doi.org/10.1109/ecrts.2005.7openalex-snapshot
Applying Static WCET Analysis to Automotive Communication Software
inferredcites →https://doi.org/10.1109/emwrts.1996.557827openalex-snapshot
On the false path problem in hard real-time programs
inferredcites →https://doi.org/10.1109/isola.2006.63openalex-snapshot
Static WCET Analysis of Real-Time Task-Oriented Code in Vehicle Control Systems
inferredcites →https://doi.org/10.1109/pccc.2000.830347openalex-snapshot
Tighten the computation of worst-case execution-time by detecting feasible paths
inferredcites →https://doi.org/10.1109/rtcsa.1996.554976openalex-snapshot
Safe and efficient elimination of infeasible execution paths in WCET estimation
inferredcites →https://doi.org/10.1109/rttas.1999.777663openalex-snapshot
Tighter timing predictions by automatic detection and exploitation of value-dependent constraints
inferredcites →https://doi.org/10.1109/tc.2005.139openalex-snapshot
Clustered Worst-Case Execution-Time Calculation
inferredcites →https://doi.org/10.1109/words.2005.53openalex-snapshot
Towards a Flow Analysis for Embedded System C Programs
inferredcites →https://doi.org/10.1145/1134650.1134666openalex-snapshot
Faster WCET flow analysis by program slicing
inferredcites →https://doi.org/10.22028/d291-25797openalex-snapshot
Safe and Precise WCET Determination by Abstract Interpretation of Pipeline Models
inferredcites →https://doi.org/10.4230/oasics.wcet.2005.816openalex-snapshot
Exploiting Branch Constraints without Exhaustive Path Enumeration
inferredcites →https://doi.org/10.5281/zenodo.37579openalex-snapshot
Worst-Case Execution Time Analysis For Digital Signal Processors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118984413.ch5openalex-snapshot
Estimation of Execution Time and Delays
inferred← citeshttps://doi.org/10.1002/spe.968openalex-snapshot
Worst‐case execution time analysis for a Java processor
inferred← citeshttps://doi.org/10.1002/stvr.1716openalex-snapshot
Complexity vulnerability analysis using symbolic execution
inferred← citeshttps://doi.org/10.1007/978-3-319-11863-5_9openalex-snapshot
Real-World Loops Are Easy to Predict
inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9openalex-snapshot
Techniques for Building Timing-Predictable Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_4openalex-snapshot
Analyzing Preemptive Global Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_7openalex-snapshot
Parametric Utilization Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_32openalex-snapshot
Tighter Loop Bound Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_35openalex-snapshot
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-89740-8_9openalex-snapshot
Statistically Analyzing Execution Variance for Soft Real-Time Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-01924-1_10openalex-snapshot
Predicated Worst-Case Execution-Time Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_7openalex-snapshot
SPEED: Symbolic Complexity Bound Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-10265-3_28openalex-snapshot
Approximate Worst-Case Execution Time Analysis for Early Stage Embedded Systems Development
inferred← citeshttps://doi.org/10.1007/978-3-642-13550-7_10openalex-snapshot
Cache-Aware Development of High-Integrity Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-16561-0_40openalex-snapshot
Source-Level Support for Timing Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-16561-0_41openalex-snapshot
Practical Experiences of Applying Source-Level WCET Flow Analysis on Industrial Code
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_7openalex-snapshot
ABC: Algebraic Bound Computation for Loops
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-34032-1_18openalex-snapshot
Abstract Execution for Event-Driven Systems – An Application from Automotive/Infotainment Development
inferred← citeshttps://doi.org/10.1007/978-3-642-45422-6_5openalex-snapshot
Detection of Infeasible Paths: Approaches and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_4openalex-snapshot
Timing Analysis of Parallel Software Using Abstract Execution
inferred← citeshttps://doi.org/10.1007/978-3-642-54804-8_8openalex-snapshot
TouchCost: Cost Analysis of TouchDevelop Scripts
inferred← citeshttps://doi.org/10.1007/978-3-662-45231-8_38openalex-snapshot
SWEET – A Tool for WCET Flow Analysis (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_3openalex-snapshot
Path Sensitive Cache Analysis Using Cache Miss Paths
inferred← citeshttps://doi.org/10.1007/978-90-481-9929-7_3openalex-snapshot
WCC—WCET-Aware C Compiler
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_14openalex-snapshot
Cache Behavior Analysis with SP-Relative Addressing for WCET Estimation
inferred← citeshttps://doi.org/10.1007/s10009-012-0255-9openalex-snapshot
Practical experiences of applying source-level WCET flow analysis to industrial code
inferred← citeshttps://doi.org/10.1007/s10009-012-0266-6openalex-snapshot
Measurement and tracing methods for timing analysis
inferred← citeshttps://doi.org/10.1007/s10009-018-0497-2openalex-snapshot
Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors: a comeback of model checking
inferred← citeshttps://doi.org/10.1007/s10617-017-9183-yopenalex-snapshot
RELSPEC: a framework for reliability aware design of component based embedded systems
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.1007/s11241-010-9091-8openalex-snapshot
Transforming flow information during code optimization for timing analysis
inferred← citeshttps://doi.org/10.1007/s11241-010-9101-xopenalex-snapshot
A compiler framework for the reduction of worst-case execution times
inferred← citeshttps://doi.org/10.1007/s11241-012-9155-zopenalex-snapshot
Performance debugging of Esterel specifications
inferred← citeshttps://doi.org/10.1007/s11241-015-9219-yopenalex-snapshot
Timing analysis enhancement for synchronous program
inferred← citeshttps://doi.org/10.1007/s11241-017-9286-3openalex-snapshot
High-assurance timing analysis for a high-assurance real-time operating system
inferred← citeshttps://doi.org/10.1007/s11859-012-0860-1openalex-snapshot
A Worst-case execution time analysis approach based on independent paths for ARM programs
inferred← citeshttps://doi.org/10.1016/j.cl.2014.09.001openalex-snapshot
Refinement of worst-case execution time bounds by graph pruning
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.ipl.2014.08.008openalex-snapshot
A case for a fast trip count predictor
inferred← citeshttps://doi.org/10.1016/j.pmcj.2015.10.001openalex-snapshot
Precise execution offloading for applications with dynamic behavior in mobile cloud computing
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.006openalex-snapshot
Certifying execution time in multicores
inferred← citeshttps://doi.org/10.1016/j.scico.2016.07.006openalex-snapshot
Improved precision in polyhedral analysis with wrapping
inferred← citeshttps://doi.org/10.1016/j.sysarc.2011.03.002openalex-snapshot
Identifying irreducible loops in the Instrumentation Point Graph
inferred← citeshttps://doi.org/10.1108/ijwis-04-2016-0024openalex-snapshot
Formal analysis and verification support for reactive rule-based Web agents
inferred← citeshttps://doi.org/10.1109/access.2019.2906011openalex-snapshot
Modeling and Timing Analysis for Microkernel-Based Real-Time Embedded System
inferred← citeshttps://doi.org/10.1109/aero.2008.4526588openalex-snapshot
Visualization and Formalization of User Constraints for Tight Estimation of Worst-Case Execution Time
inferred← citeshttps://doi.org/10.1109/cascon62161.2024.10838116openalex-snapshot
Worst-Case Execution Time Analysis of Real-Time Robotic Algorithms Using Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/cgo.2009.17openalex-snapshot
A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models
inferred← citeshttps://doi.org/10.1109/csmr-wcre.2014.6747227openalex-snapshot
Detecting infeasible branches based on code patterns
inferred← citeshttps://doi.org/10.1109/ecrts.2008.37openalex-snapshot
Evaluation of Automatic Flow Analysis for WCET Calculation on Industrial Real-Time System Code
inferred← citeshttps://doi.org/10.1109/ecrts.2009.32openalex-snapshot
Deriving the Worst-Case Execution Time Input Values
inferred← citeshttps://doi.org/10.1109/etfa.2018.8502620openalex-snapshot
Static Flow Analysis of the Action Language for Foundational UML
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237066openalex-snapshot
WCET nested-loop minimization in terms of instruction-level-parallelism
inferred← citeshttps://doi.org/10.1109/iccsce.2014.7072733openalex-snapshot
Synthesis of sampling modes for adaptive control
inferred← citeshttps://doi.org/10.1109/icse.2009.5070545openalex-snapshot
WISE: Automated test generation for worst-case complexity
inferred← citeshttps://doi.org/10.1109/icst.2015.7102579openalex-snapshot
A Lightweight, Static Approach to Detecting Unbounded Thread-Instantiation Loops
inferred← citeshttps://doi.org/10.1109/icst.2017.13openalex-snapshot
Symbolic Complexity Analysis Using Context-Preserving Histories
inferred← citeshttps://doi.org/10.1109/icst.2019.00011openalex-snapshot
XSTRESSOR : Automatic Generation of Large-Scale Worst-Case Test Inputs by Inferring Path Conditions
inferred← citeshttps://doi.org/10.1109/isola.2006.63openalex-snapshot
Static WCET Analysis of Real-Time Task-Oriented Code in Vehicle Control Systems
inferred← citeshttps://doi.org/10.1109/isorc.2007.36openalex-snapshot
Experiences from Applying WCET Analysis in Industrial Settings
inferred← citeshttps://doi.org/10.1109/isorc.2008.55openalex-snapshot
Usability Aspects of WCET Analysis
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/mdat.2018.2794204openalex-snapshot
Time-Critical Systems Design: A Survey
inferred← citeshttps://doi.org/10.1109/rtas.2009.16openalex-snapshot
Model Identification for WCET Analysis
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/rtas.2013.6531082openalex-snapshot
Precise micro-architectural modeling for WCET analysis via AI+SAT
inferred← citeshttps://doi.org/10.1109/rtas.2013.6531083openalex-snapshot
Sequoll: A framework for model checking binaries
inferred← citeshttps://doi.org/10.1109/rtas.2016.7461326openalex-snapshot
Complete, High-Assurance Determination of Loop Bounds and Infeasible Paths for WCET Analysis
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.32openalex-snapshot
Contract-Based ReusableWorst-Case Execution Time Estimate
inferred← citeshttps://doi.org/10.1109/rtcsa.2008.53openalex-snapshot
Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation
inferred← citeshttps://doi.org/10.1109/rtcsa.2012.25openalex-snapshot
Resource Sharing under Multiprocessor Semi-partitioned Scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.11openalex-snapshot
Improving WCET Analysis Precision through Automata Product
inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046322openalex-snapshot
Benchmarking OpenMP programs for real-time scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00011openalex-snapshot
WE-HML: hybrid WCET estimation using machine learning for architectures with caches
inferred← citeshttps://doi.org/10.1109/rtss.2018.00014openalex-snapshot
RIM: Robust Intersection Management for Connected Autonomous Vehicles
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/rtss46320.2019.00025openalex-snapshot
From Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed C
inferred← citeshttps://doi.org/10.1109/scam.2017.13openalex-snapshot
Working Around Loops for Infeasible Path Detection in Binary Programs
inferred← citeshttps://doi.org/10.1109/seaa.2014.59openalex-snapshot
Handling Cyclic Execution Paths in Timing Analysis of Component-Based Software
inferred← citeshttps://doi.org/10.1109/snpd.2007.247openalex-snapshot
Study of Ontology-based Semantic Matching of Model Function System
inferred← citeshttps://doi.org/10.1109/snpd.2007.430openalex-snapshot
DYFARS: Boosting Reliability in Fault-Tolerant Heterogeneous Distributed Systems Through Dynamic Scheduling
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00035openalex-snapshot
CHLOE: Loop Transformation over Fully Homomorphic Encryption via Multi-Level Vectorization and Control-Path Reduction
inferred← citeshttps://doi.org/10.1109/tac.2024.3395521openalex-snapshot
Exact Worst-Case Execution-Time Analysis for Implicit Model Predictive Control
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/tii.2012.2187457openalex-snapshot
Fast, Interactive Worst-Case Execution Time Analysis With Back-Annotation
inferred← citeshttps://doi.org/10.1109/tmc.2014.2374153openalex-snapshot
Mantis: Efficient Predictions of Execution Time, Energy Usage, Memory Usage and Network Usage on Smart Mobile Devices
inferred← citeshttps://doi.org/10.1109/vlsid.2015.12openalex-snapshot
RELSPEC: A Framework for Early Reliability Refinement of Embedded Applications
inferred← citeshttps://doi.org/10.1109/wfcs46889.2021.9483614openalex-snapshot
Static Timing Analysis of OPC UA PubSub
inferred← citeshttps://doi.org/10.1109/wfcs53837.2022.9779177openalex-snapshot
Timing Analysis of TSN-Enabled OPC UA PubSub
inferred← citeshttps://doi.org/10.1109/wfcs60972.2024.10540916openalex-snapshot
Time-Predictable Software-Based TSN-Enabled Network Stack for Mixed Criticality Traffic
inferred← citeshttps://doi.org/10.1109/wises.2008.4623310openalex-snapshot
Using model checking to derive loop bounds of general loops within ANSI-C applications for measurement based WCET analysis
inferred← citeshttps://doi.org/10.1145/1361096.1361100openalex-snapshot
WCET-driven, code-size critical procedure cloning
inferred← citeshttps://doi.org/10.1145/1450135.1450175openalex-snapshot
Performance debugging of Esterel specifications
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/1850771.1850793openalex-snapshot
The design of SafeJML, a specification language for SCJ with support for WCET specification
inferred← citeshttps://doi.org/10.1145/2465554.2465567openalex-snapshot
Combined WCET analysis of bitcode and machine code using control-flow relation graphs
inferred← citeshttps://doi.org/10.1145/2491899.2465567openalex-snapshot
Combined WCET analysis of bitcode and machine code using control-flow relation graphs
inferred← citeshttps://doi.org/10.1145/2499369.2465567openalex-snapshot
Combined WCET analysis of bitcode and machine code using control-flow relation graphs
inferred← citeshttps://doi.org/10.1145/2500886openalex-snapshot
Computation takes time, but how much?
inferred← citeshttps://doi.org/10.1145/2516821.2516832openalex-snapshot
Leveraging transactional memory for a predictable execution of applications composed of hard real-time and best-effort tasks
inferred← citeshttps://doi.org/10.1145/2516821.2516841openalex-snapshot
Timing analysis enhancement for synchronous program
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1145/2656045.2656046openalex-snapshot
A general approach for expressing infeasibility in implicit path enumeration technique
inferred← citeshttps://doi.org/10.1145/2666357.2597817openalex-snapshot
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics
inferred← citeshttps://doi.org/10.1145/2786805.2786873openalex-snapshot
CLAPP: characterizing loops in Android applications
inferred← citeshttps://doi.org/10.1145/2822304.2822309openalex-snapshot
Safety-Critical Java on a Time-Predictable Processor
inferred← citeshttps://doi.org/10.1145/2997465.2997467openalex-snapshot
Time for Reactive System Modeling
inferred← citeshttps://doi.org/10.1145/3213846.3213868openalex-snapshot
Badger: complexity analysis with fuzzing and symbolic execution
inferred← citeshttps://doi.org/10.1145/3314221.3314612openalex-snapshot
Modular divide-and-conquer parallelization of nested loops
inferred← citeshttps://doi.org/10.1145/3323439.3323978openalex-snapshot
WCET Analysis meets Virtual Prototyping
inferred← citeshttps://doi.org/10.1145/3394810.3394816openalex-snapshot
Establishing Confidence and Understanding Uncertainty in Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3471904openalex-snapshot
Worst-case Execution Time Calculation for Query-based Monitors by Witness Generation
inferred← citeshttps://doi.org/10.1145/3622803openalex-snapshot
Beacons: An End-to-End Compiler Framework for Predicting and Utilizing Dynamic Loop Characteristics
inferred← citeshttps://doi.org/10.1145/3678169openalex-snapshot
Timing Side-Channel Mitigation via Automated Program Repair
inferred← citeshttps://doi.org/10.1186/s13639-015-0020-8openalex-snapshot
Symbolic execution and timed automata model checking for timing analysis of Java real-time systems
inferred← citeshttps://doi.org/10.1561/1000000037openalex-snapshot
Time-Predictable Embedded Software on Multi-Core Platforms: Analysis and Optimization
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.24openalex-snapshot
Visualization and Formalization of User Constraints for Tight Estimation of Worst-Case Execution Time
inferred← citeshttps://doi.org/10.17877/de290r-16409openalex-snapshot
Tight integration of cache, path and task-interference modeling for the analysis of hard real time systems
inferred← citeshttps://doi.org/10.21236/ada605312openalex-snapshot
Towards Interactive Timing Analysis for Designing Reactive Systems
inferred← citeshttps://doi.org/10.22215/etd/2024-16354openalex-snapshot
Black-Box Worst Case Execution Time Analysis on Real-Time Robotic Algorithms
inferred← citeshttps://doi.org/10.2298/csis230730015popenalex-snapshot
A novel approach to source code assembling in the field of algorithmic complexity
inferred← citeshttps://doi.org/10.25916/sut.26283199openalex-snapshot
Hard real-time motion planning for autonomous vehicles
inferred← citeshttps://doi.org/10.26190/unsworks/16384openalex-snapshot
Towards verified microkernels for real-time mixed-criticality systems
inferred← citeshttps://doi.org/10.32657/10356/61780openalex-snapshot
Augmenting static program analysis and design verification with pattern recognition
inferred← citeshttps://doi.org/10.3384/9789179292720openalex-snapshot
Synthesis of Safety-Critical Real-Time Systems
inferred← citeshttps://doi.org/10.3390/en10122113openalex-snapshot
Reducing WCET Overestimations by Correcting Errors in Loop Bound Constraints
inferred← citeshttps://doi.org/10.3390/jlpea11010013openalex-snapshot
Statically Analyzing the Energy Efficiency of Software Product Lines
inferred← citeshttps://doi.org/10.4018/978-1-60960-086-0.ch005openalex-snapshot
Measurement-Based Timing Analysis for Reconfigurable Embedded Systems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.651-653.624openalex-snapshot
An Overview of Worst-Case Execution Time Estimation for Embedded Programs
inferred← citeshttps://doi.org/10.4230/lites-v003-i001-a005openalex-snapshot
A Survey on Static Cache Analysis for Real-Time Systems
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.2007.1194openalex-snapshot
Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2007.1195openalex-snapshot
Analysing Switch-Case Tables by Partial Evaluation
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2008.1658openalex-snapshot
Merging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2008.1660openalex-snapshot
Computing time as a program variable: a way around infeasible paths
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2008.1661openalex-snapshot
TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2010.77openalex-snapshot
A Code Policy Guaranteeing Fully Automated Path Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2012.91openalex-snapshot
A Formal Framework for Precise Parametric WCET Formulas
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2012.iopenalex-snapshot
Frontmatter, Table of Contents, Preface, Workshop Organization, List of Authors
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.2013.53openalex-snapshot
The Auspicious Couple: Symbolic Execution and WCET Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2015.21openalex-snapshot
Timing Analysis of Event-Driven Programs with Directed Testing
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2015.85openalex-snapshot
Analysing Switch-Case Code with Abstract Execution
inferred← citeshttps://doi.org/10.48550/arxiv.1712.05264openalex-snapshot
A Brief Overview of the KTA WCET Tool
inferred← citeshttps://doi.org/10.48550/arxiv.1904.01031openalex-snapshot
Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)
inferred← citeshttps://doi.org/10.5121/ijcses.2011.2108openalex-snapshot
Automated Software Test Data Generation: Direction of Research
inferred← citeshttps://doi.org/10.5121/ijsea.2010.1405openalex-snapshot
Heuristic Approach of Automated Test Data Generation for Programs Having Array of Different Dimensions and Loops with Variable Number of Iteration
inferred← citeshttps://doi.org/10.5626/jcse.2013.7.4.285openalex-snapshot
Counter-Based Approaches for Efficient WCET Analysis of Multicore Processors with Shared Caches
inferred← citeshttps://doi.org/10.6028/nist.tn.1867openalex-snapshot
Time-Aware Applications, Computers, and Communication Systems (TAACCS)
inferred← citeshttps://doi.org/10.70675/29c4dcbaz365ez4589zad7ez2e35c1b7665copenalex-snapshot
Maîtrise du temps d'exécution de logiciels déployés dans des dispositifs personnels de confiance
inferred← citeshttps://doi.org/10.70675/3aae1dacz8e78z4548zb112z283138654eb5openalex-snapshot
Efficient tree-based symbolic WCET computation
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/93ac1b8dzd215z40b2zafb4z5d67102b516aopenalex-snapshot
Extraction and traceability of annotations for WCET estimation
inferred← citeshttps://doi.org/10.70675/d276d583z0ce4z41b2za54azf081cb28f62copenalex-snapshot
Machine learning for timing estimation
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.