On the public citation graph
Predicting program execution times by analyzing static and dynamic program paths
0 signed · 236 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.1002/spe.4380210402openalex-snapshot
Building a real‐time kernel: First steps in validating a pure process/ADT model
inferredcites →https://doi.org/10.1007/bf00355297openalex-snapshot
Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention
inferredcites →https://doi.org/10.1007/bf00365999openalex-snapshot
Real-time Concurrent C: A language for programming dynamic real-time systems
inferredcites →https://doi.org/10.1007/bf00571421openalex-snapshot
Calculating the maximum execution time of real-time programs
inferredcites →https://doi.org/10.1109/2.76286openalex-snapshot
Experiments with a program timing tool based on source-level timing schema
inferredcites →https://doi.org/10.1109/32.29487openalex-snapshot
Reasoning about time in higher-level language software
inferredcites →https://doi.org/10.1109/32.48935openalex-snapshot
Cecil: a sequencing constraint language for automatic static analysis generation
inferredcites →https://doi.org/10.1109/32.57624openalex-snapshot
Automated software test data generation
inferredcites →https://doi.org/10.1109/32.57625openalex-snapshot
State constraints and pathwise decomposition of programs
inferredcites →https://doi.org/10.1109/32.6195openalex-snapshot
Combining static concurrency analysis with symbolic execution
inferredcites →https://doi.org/10.1109/ipps.1991.153757openalex-snapshot
Deterministic timing schema for parallel programs
inferredcites →https://doi.org/10.1109/real.1990.128731openalex-snapshot
Experiments with a program timing tool based on source-level timing schema
inferredcites →https://doi.org/10.1109/real.1991.160358openalex-snapshot
Program representation and translation for predictable real-time systems
inferredcites →https://doi.org/10.1109/real.1991.160359openalex-snapshot
A partial evaluator for the Maruti hard real-time system
inferredcites →https://doi.org/10.1109/tec.1960.5221603openalex-snapshot
Regular Expressions and State Graphs for Automata
inferredcites →https://doi.org/10.1109/tse.1980.230473openalex-snapshot
Experience with Path Analysis and Testing of Programs
inferredcites →https://doi.org/10.1109/tse.1986.6312944openalex-snapshot
Constrained expressions: Adding analysis capabilities to design methods for concurrent software systems
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199903)29:3<235::aid-spe231>3.0.co;2-7openalex-snapshot
A software process for the construction of predictable on-board embedded real-time systems
inferred← citeshttps://doi.org/10.1002/cpe.1015openalex-snapshot
Parametric timing estimation with Newton–Gregory formulae
inferred← citeshttps://doi.org/10.1002/stvr.406openalex-snapshot
A systematic representation of path constraints for implicit path enumeration technique
inferred← citeshttps://doi.org/10.1006/inco.2001.3042openalex-snapshot
Real-Time Properties of Indirect Recursive Procedures
inferred← citeshttps://doi.org/10.1007/11604655_53openalex-snapshot
Analyzing Loop Paths for Execution Time Estimation
inferred← citeshttps://doi.org/10.1007/3-540-36384-x_9openalex-snapshot
Optimized Live Heap Bound Analysis
inferred← citeshttps://doi.org/10.1007/3-540-36554-0_5openalex-snapshot
Model-Based Adaptivity in Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-45245-1_12openalex-snapshot
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
inferred← citeshttps://doi.org/10.1007/3-540-48046-3_7openalex-snapshot
Language Issues of Compiling Ada to Hardware
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_168openalex-snapshot
Designing and implementing correct real-time systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_13openalex-snapshot
Validation, verification and implementation of timed protocols using AORTA
inferred← citeshttps://doi.org/10.1007/978-0-585-35223-7_5openalex-snapshot
Implementation of Hard Real-Time Embedded Control Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3054-3_19openalex-snapshot
Loops for Safety Critical Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-88192-6_35openalex-snapshot
Leakage-Aware Energy Efficient Scheduling for Fixed-Priority Tasks with Preemption Thresholds
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-60535-2_7openalex-snapshot
Zur Unterstützung der Vorhersehbarkeit von Programmausführungszeiten in PEARL
inferred← citeshttps://doi.org/10.1007/978-981-97-0730-0_24openalex-snapshot
An Intelligent Scheduling System for Large-Scale Online Judging
inferred← citeshttps://doi.org/10.1007/b138012openalex-snapshot
Component-Based Software Testing with UML
inferred← citeshttps://doi.org/10.1007/bf00134684openalex-snapshot
A co-synthesis approach to embedded system design automation
inferred← citeshttps://doi.org/10.1007/bf00365315openalex-snapshot
Worst-case space and time complexity of recursive procedures
inferred← citeshttps://doi.org/10.1007/bf00365316openalex-snapshot
Combining static worst-case timing analysis and program proof
inferred← citeshttps://doi.org/10.1007/bf01088803openalex-snapshot
A retargetable technique for predicting execution time of code segments
inferred← citeshttps://doi.org/10.1007/bf01088804openalex-snapshot
Schedulability-analyzable exception handling for fault-tolerant real-time languages
inferred← citeshttps://doi.org/10.1007/bf01088834openalex-snapshot
Pipelined processors and worst case execution times
inferred← citeshttps://doi.org/10.1007/bf01094342openalex-snapshot
Fixed priority pre-emptive scheduling: An historical perspective
inferred← citeshttps://doi.org/10.1007/bfb0002886openalex-snapshot
Deriving annotations for tight calculation of execution time
inferred← citeshttps://doi.org/10.1007/bfb0013500openalex-snapshot
Augmenting Ada95 with additional real-time features
inferred← citeshttps://doi.org/10.1007/bfb0054997openalex-snapshot
Implementing and using execution time clocks in Ada hard real-time applications
inferred← citeshttps://doi.org/10.1007/bfb0057778openalex-snapshot
Automatic accurate time-bound analysis for high-level languages
inferred← citeshttps://doi.org/10.1007/s00165-003-0019-0openalex-snapshot
Linear Approximation of Execution-Time Constraints
inferred← citeshttps://doi.org/10.1007/s100090100054openalex-snapshot
Worst-case execution-time analysis for embedded real-time systems
inferred← citeshttps://doi.org/10.1007/s10270-010-0161-0openalex-snapshot
Beyond loop bounds: comparing annotation languages for worst-case execution time analysis
inferred← citeshttps://doi.org/10.1007/s11241-005-2744-3openalex-snapshot
Feedback EDF Scheduling of Real-Time Tasks Exploiting Dynamic Voltage Scaling
inferred← citeshttps://doi.org/10.1007/s11241-007-9013-6openalex-snapshot
Predictable real-time software synthesis
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.1016/0096-0551(94)90004-3openalex-snapshot
Discrete loops and worst case performance
inferred← citeshttps://doi.org/10.1016/0967-0661(96)00153-0openalex-snapshot
Language and compiler supported timing analysis in real-time control
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.046openalex-snapshot
Verified Compilation and the B Method: A Proposal and a First Appraisal
inferred← citeshttps://doi.org/10.1016/j.future.2008.06.004openalex-snapshot
An ant algorithm for balanced job scheduling in grids
inferred← citeshttps://doi.org/10.1016/j.jss.2017.12.010openalex-snapshot
An input-centric performance model for computational offloading of mobile applications
inferred← citeshttps://doi.org/10.1016/j.scico.2006.06.002openalex-snapshot
Procedures and parameters in the real-time program refinement calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.003openalex-snapshot
A theory for execution-time derivation in real-time programs
inferred← citeshttps://doi.org/10.1016/s0005-1098(98)00034-xopenalex-snapshot
Formal Verification of Compiler Transformations for Speculative Real-Time Execution>>>A short version of t>his paper was presented at the 20th IFAC/IFIP Workshop on Real Time Programming (WRTP’95), which was held in Gt. Lauderdale, Florida, U.S.A., during November 1995. The Published Proceedings…
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00025-3openalex-snapshot
A formal design language for real-time systems with data
inferred← citeshttps://doi.org/10.1016/s0950-5849(01)00191-4openalex-snapshot
A prediction system for evolutionary testability applied to dynamic execution time analysis
inferred← citeshttps://doi.org/10.1016/s0967-0661(00)00022-8openalex-snapshot
Timing analysis of PL programs
inferred← citeshttps://doi.org/10.1016/s0967-0661(97)10050-8openalex-snapshot
Worst-case execution-time analysis at low cost
inferred← citeshttps://doi.org/10.1016/s1367-5788(03)00006-3openalex-snapshot
Improving integrity of embedded computers in control
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)33000-8openalex-snapshot
Enhancing Integrity of Embedded Control Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36339-5openalex-snapshot
Configurable Time-Redundant Task Execution for Fault-Tolerant Real-Time Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36731-9openalex-snapshot
Integrating WCET Analysis into a Matlab/Simulink Simulation Model 1 2 3
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39988-3openalex-snapshot
Timing Analysis of PL Programs
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)42661-9openalex-snapshot
Worst-Case Execution Time Analysis at Low Cost
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43740-2openalex-snapshot
Formal Verification of Transformation Rules for Speculative Execution in Real-Time Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43749-9openalex-snapshot
Programming and Time Analysis of Hard Real-Time Applications
inferred← citeshttps://doi.org/10.1023/a:1005241611742openalex-snapshot
Radical Intersubjectivity: Reflections on the “Different” Foundation of Education
inferred← citeshttps://doi.org/10.1023/a:1007905003094openalex-snapshot
Computing Maximum Task Execution Times — A Graph-Based Approach
inferred← citeshttps://doi.org/10.1023/a:1007920407968openalex-snapshot
Implementation of Hard Real-Time Embedded Control Systems
inferred← citeshttps://doi.org/10.1023/a:1008055919262openalex-snapshot
Real-Time Performance of Sorting Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008096431840openalex-snapshot
Verifying Timing Constraints of Real-Time Systems by Means of Evolutionary Testing
inferred← citeshttps://doi.org/10.1023/a:1008101416758openalex-snapshot
WCET Analysis of Superscalar Processors Using Simulation With Coloured Petri Nets
inferred← citeshttps://doi.org/10.1023/a:1008119029962openalex-snapshot
Guest Editorial: A Review of Worst-Case Execution-Time Analysis
inferred← citeshttps://doi.org/10.1023/a:1008145215849openalex-snapshot
Timing Analysis for Instruction Caches
inferred← citeshttps://doi.org/10.1023/a:1008149332687openalex-snapshot
Worst Case Execution Time Analysis for a Processor with Branch Prediction
inferred← citeshttps://doi.org/10.1023/a:1008190423977openalex-snapshot
Timing Analysis for Data and Wrap-Around Fill Caches
inferred← citeshttps://doi.org/10.1023/a:1008193114940openalex-snapshot
Symbolic Cache Analysis for Real-Time Systems
inferred← citeshttps://doi.org/10.1023/a:1011132221066openalex-snapshot
A Comparison of Static Analysis and Evolutionary Testing for the Verification of Timing Constraints
inferred← citeshttps://doi.org/10.1023/a:1014535317056openalex-snapshot
Data-Flow Frameworks for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1023/a:1020227912579openalex-snapshot
Analysis of Worst Case DMA Response Time in a Fixed-Priority Bus Arbitration Protocol
inferred← citeshttps://doi.org/10.1023/a:1024806606443openalex-snapshot
Timing Analysis of Compound Scheduling Policies: Application to Posix1003.1B
inferred← citeshttps://doi.org/10.1049/ip-sen:20010834openalex-snapshot
Semantic characterisation of dead control-flow paths
inferred← citeshttps://doi.org/10.1049/sej.1994.0026openalex-snapshot
Application-oriented real-time algebra
inferred← citeshttps://doi.org/10.1049/sej.1994.0036openalex-snapshot
Real-time safety-critical systems: analysis and synthesis
inferred← citeshttps://doi.org/10.1093/comjnl/38.4.319openalex-snapshot
A Language for Complex Real-Time Systems
inferred← citeshttps://doi.org/10.1109/12.689649openalex-snapshot
Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
inferred← citeshttps://doi.org/10.1109/12.743411openalex-snapshot
Bounding pipeline and instruction cache performance
inferred← citeshttps://doi.org/10.1109/12.868027openalex-snapshot
Properties of rescheduling size invariance for dynamic rescheduling-based VLIW cross-generation compatibility
inferred← citeshttps://doi.org/10.1109/32.392980openalex-snapshot
An accurate worst case timing analysis for RISC processors
inferred← citeshttps://doi.org/10.1109/32.748918openalex-snapshot
A development environment for complex distributed real-time applications
inferred← citeshttps://doi.org/10.1109/32.815328openalex-snapshot
Statically safe speculative execution for real-time systems
inferred← citeshttps://doi.org/10.1109/43.594830openalex-snapshot
Specification and analysis of timing constraints for embedded systems
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/apcsac.2008.4625471openalex-snapshot
Profile guided optimization for dataflow predication
inferred← citeshttps://doi.org/10.1109/ares.2006.117openalex-snapshot
Schedulability driven security optimization in real-time systems
inferred← citeshttps://doi.org/10.1109/asap.2005.34openalex-snapshot
Expression Synthesis in Process Networks generated by LAURA
inferred← citeshttps://doi.org/10.1109/ccece.2008.4564838openalex-snapshot
Compiling parallel applications to Coarse-Grained Reconfigurable Architectures
inferred← citeshttps://doi.org/10.1109/cgo.2007.31openalex-snapshot
Profile-assisted Compiler Support for Dynamic Predication in Diverge-Merge Processors
inferred← citeshttps://doi.org/10.1109/dac.1996.545646openalex-snapshot
Analysis of operation delay and execution rate constraints for embedded systems
inferred← citeshttps://doi.org/10.1109/dac.1996.545647openalex-snapshot
Efficient software performance estimation methods for hardware/software codesign
inferred← citeshttps://doi.org/10.1109/dac.2006.229300openalex-snapshot
Efficient detection and exploitation of infeasible paths for software timing analysis
inferred← citeshttps://doi.org/10.1109/date.2001.915082openalex-snapshot
Reliable estimation of execution time of embedded software
inferred← citeshttps://doi.org/10.1109/emrts.2000.853996openalex-snapshot
Predicting computation time for advanced processor architectures
inferred← citeshttps://doi.org/10.1109/emrts.2001.933995openalex-snapshot
A modular and retargetable framework for tree-based WCET analysis
inferred← citeshttps://doi.org/10.1109/emrts.2001.933998openalex-snapshot
WCET analysis of reusable portable code
inferred← citeshttps://doi.org/10.1109/emrts.2002.1019183openalex-snapshot
Fully automatic worst-case execution time analysis for MATLAB/Simulink models
inferred← citeshttps://doi.org/10.1109/emrts.2002.1019185openalex-snapshot
Scope-tree: a program representation for symbolic worst-case execution time analysis
inferred← citeshttps://doi.org/10.1109/emwrts.1996.557943openalex-snapshot
Multi-staged discrete loops for real-time systems
inferred← citeshttps://doi.org/10.1109/emwrts.1997.613765openalex-snapshot
Generalizing timing predictions to set-associative caches
inferred← citeshttps://doi.org/10.1109/emwrts.1997.613792openalex-snapshot
Which sorting algorithms to choose for hard real-time applications
inferred← citeshttps://doi.org/10.1109/emwrts.1998.685077openalex-snapshot
A tool for high-level language analysis of worst-case execution times
inferred← citeshttps://doi.org/10.1109/emwrts.1998.685079openalex-snapshot
Facilitating worst-case execution times analysis for optimized code
inferred← citeshttps://doi.org/10.1109/etfa.1996.573985openalex-snapshot
Predicting execution time of relay ladder logic for programmable logic controllers
inferred← citeshttps://doi.org/10.1109/etfa.1997.616318openalex-snapshot
Estimation of time delay of relay ladder in sequential control systems
inferred← citeshttps://doi.org/10.1109/etfa.1999.813149openalex-snapshot
Evaluation of execution time in programmable controller
inferred← citeshttps://doi.org/10.1109/etfa.2006.355425openalex-snapshot
Towards New Methods for Developing Real-Time Systems: Automatically Deriving Loop Bounds Using Machine Learning
inferred← citeshttps://doi.org/10.1109/fpt.2006.270334openalex-snapshot
A C compiler for implementing FPGA based bit-serial DSP systems
inferred← citeshttps://doi.org/10.1109/hotos.1995.513445openalex-snapshot
Real-time is no longer a small specialized niche
inferred← citeshttps://doi.org/10.1109/iccad.2004.1382658openalex-snapshot
Dynamic range estimation for nonlinear systems
inferred← citeshttps://doi.org/10.1109/iccd.1999.808609openalex-snapshot
Hardware/software partitioning of multirate system using static scheduling theory
inferred← citeshttps://doi.org/10.1109/iceccs.1996.558328openalex-snapshot
Toward compiler optimization of distributed real-time processes
inferred← citeshttps://doi.org/10.1109/iceccs.1997.622313openalex-snapshot
A language support environment for complex distributed real-time applications
inferred← citeshttps://doi.org/10.1109/icpads.1996.517590openalex-snapshot
Allowing cycle-stealing direct memory access I/O concurrent with hard-real-time programs
inferred← citeshttps://doi.org/10.1109/icsamos.2007.4285742openalex-snapshot
The Weight-Watcher Service and its Lightweight Implementation
inferred← citeshttps://doi.org/10.1109/icse.1994.296792openalex-snapshot
Experience with the development of hard real-time embedded Ada software
inferred← citeshttps://doi.org/10.1109/iecon.1998.723961openalex-snapshot
Study on execution time of ladder diagram in programmable controller
inferred← citeshttps://doi.org/10.1109/ieee.edge.2017.11openalex-snapshot
A-Priori Estimation of Computation Times in Fog Networked Robotics
inferred← citeshttps://doi.org/10.1109/iiswc55918.2022.00012openalex-snapshot
GRANITE: A Graph Neural Network Model for Basic Block Throughput Estimation
inferred← citeshttps://doi.org/10.1109/iiswc55918.2022.00017openalex-snapshot
An Evaluation of Edge TPU Accelerators for Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1109/isca.2003.1207013openalex-snapshot
Virtual simple architecture (VISA): exceeding the complexity limit in safe real-time systems
inferred← citeshttps://doi.org/10.1109/isie.1999.801753openalex-snapshot
State of the art review paper: advances in embedded hard real-time systems design
inferred← citeshttps://doi.org/10.1109/isorc.2005.19openalex-snapshot
Classification of WCET Analysis Techniques
inferred← citeshttps://doi.org/10.1109/isorc.2006.5openalex-snapshot
A Hybrid Approach in TADE for Derivation of Execution Time Bounds of Program-Segments in Distributed Real-Time Embedded Computing
inferred← citeshttps://doi.org/10.1109/iwrsp.2000.855214openalex-snapshot
Coprocessor synthesis of multirate system using static scheduling theory
inferred← citeshttps://doi.org/10.1109/micro.2001.991124openalex-snapshot
Enhancing loop buffering of media and telecommunications applications using low-overhead predication
inferred← citeshttps://doi.org/10.1109/real.1994.342717openalex-snapshot
Deterministic upperbounds of the worst-case execution times of cached programs
inferred← citeshttps://doi.org/10.1109/real.1994.342718openalex-snapshot
Bounding worst-case instruction cache performance
inferred← citeshttps://doi.org/10.1109/real.1995.495218openalex-snapshot
Integrating the timing analysis of pipelining and instruction caching
inferred← citeshttps://doi.org/10.1109/real.1995.495220openalex-snapshot
Worst case timing analysis of RISC processors: R3000/R3010 case study
inferred← citeshttps://doi.org/10.1109/real.1996.563723openalex-snapshot
Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
inferred← citeshttps://doi.org/10.1109/real.1997.641282openalex-snapshot
A cache-aware scheduling algorithm for embedded systems
inferred← citeshttps://doi.org/10.1109/real.1998.739765openalex-snapshot
A worst case timing analysis technique for multiple-issue machines
inferred← citeshttps://doi.org/10.1109/real.2000.896006openalex-snapshot
Modeling complex flows for worst-case execution time analysis
inferred← citeshttps://doi.org/10.1109/real.2001.990614openalex-snapshot
Statistical analysis of WCET for scheduling
inferred← citeshttps://doi.org/10.1109/real.2003.1253252openalex-snapshot
FAST: frequency-aware static timing analysis
inferred← citeshttps://doi.org/10.1109/real.2004.19openalex-snapshot
Enforcing Safety of Real-Time Schedules on Contemporary Processors Using a Virtual Simple Architecture (VISA)
inferred← citeshttps://doi.org/10.1109/rtas.2005.53openalex-snapshot
Timing Analysis for Sensor Network Nodes of the Atmega Processor Family
inferred← citeshttps://doi.org/10.1109/rtas.2008.11openalex-snapshot
Using Trace Scratchpads to Reduce Execution Times in Predictable Real-Time Architectures
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.1996.554975openalex-snapshot
Worst-case timing prediction of relay ladder logic by constraint analysis
inferred← citeshttps://doi.org/10.1109/rtcsa.1998.726411openalex-snapshot
A worst case timing analysis technique for optimized programs
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.11openalex-snapshot
Improving WCET Analysis Precision through Automata Product
inferred← citeshttps://doi.org/10.1109/rtss.2005.33openalex-snapshot
ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling
inferred← citeshttps://doi.org/10.1109/rtss.2005.45openalex-snapshot
WCET Centric Data Allocation to Scratchpad Memory
inferred← citeshttps://doi.org/10.1109/rttas.1996.509540openalex-snapshot
Efficient worst case timing analysis of data caching
inferred← citeshttps://doi.org/10.1109/rttas.1998.683198openalex-snapshot
A comparison of static analysis and evolutionary testing for the verification of timing constraints
inferred← citeshttps://doi.org/10.1109/rttas.2002.1137403openalex-snapshot
Hardware implementation of programming languages for real-time
inferred← citeshttps://doi.org/10.1109/sies.2011.5953664openalex-snapshot
Video subset selection for measurement based Worst Case Execution Time analysis
inferred← citeshttps://doi.org/10.1109/tc.2001.970569openalex-snapshot
Automatic accurate cost-bound analysis for high-level languages
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.2009.2014055openalex-snapshot
Static Security Optimization for Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tvlsi.2012.2236114openalex-snapshot
WCET-Aware Re-Scheduling Register Allocation for Real-Time Embedded Systems With Clustered VLIW Architecture
inferred← citeshttps://doi.org/10.1109/words.1994.518685openalex-snapshot
Calculation of execution times in RealTimeTalk-an object-oriented language for real-time
inferred← citeshttps://doi.org/10.1109/words.2001.945133openalex-snapshot
Dealing with tasking overload in object oriented real-time applications design
inferred← citeshttps://doi.org/10.1109/wpdrts.1995.470500openalex-snapshot
Predictability of program execution times on superscalar pipelined architectures
inferred← citeshttps://doi.org/10.1145/1133373.1133411openalex-snapshot
Execution time limitation of interrupt handlers in a Java operating system
inferred← citeshttps://doi.org/10.1145/1146909.1147002openalex-snapshot
Efficient detection and exploitation of infeasible paths for software timing analysis
inferred← citeshttps://doi.org/10.1145/1880050.1880061openalex-snapshot
Parametric timing analysis and its application to dynamic voltage scaling
inferred← citeshttps://doi.org/10.1145/192867.192873openalex-snapshot
Static worst-case timing analysis of Ada
inferred← citeshttps://doi.org/10.1145/2038642.2038692openalex-snapshot
Symbolic simulation on complicated loops for WCET path analysis
inferred← citeshttps://doi.org/10.1145/2162131.2162132openalex-snapshot
Collecting signatures to model latency tolerance in high-level simulations of microthreaded cores
inferred← citeshttps://doi.org/10.1145/216633.216650openalex-snapshot
Worst-case execution time analysis on modern processors
inferred← citeshttps://doi.org/10.1145/216636.216650openalex-snapshot
Worst-case execution time analysis on modern processors
inferred← citeshttps://doi.org/10.1145/240518.240632openalex-snapshot
Analysis of operation delay and execution rate constraints for embedded systems
inferred← citeshttps://doi.org/10.1145/240518.240633openalex-snapshot
Efficient software performance estimation methods for hardware/software codesign
inferred← citeshttps://doi.org/10.1145/2814228.2814232openalex-snapshot
Runtime metric meets developer: building better cloud applications using feedback
inferred← citeshttps://doi.org/10.1145/2814228.2814243openalex-snapshot
Musiplectics: computational assessment of the complexity of music scores
inferred← citeshttps://doi.org/10.1145/3394810.3394816openalex-snapshot
Establishing Confidence and Understanding Uncertainty in Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3473333openalex-snapshot
Scenario-Aware Program Specialization for Timing Predictability
inferred← citeshttps://doi.org/10.1145/384196.384212openalex-snapshot
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages
inferred← citeshttps://doi.org/10.1145/384197.384212openalex-snapshot
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages
inferred← citeshttps://doi.org/10.1145/384198.384212openalex-snapshot
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages
inferred← citeshttps://doi.org/10.1145/502217.502233openalex-snapshot
Hardware compilation of sequential ada
inferred← citeshttps://doi.org/10.1145/502217.502240openalex-snapshot
Efficient longest executable path search for programs with complex flows and pipeline effects
inferred← citeshttps://doi.org/10.1145/503032.503039openalex-snapshot
Automatic time-bound analysis for a higher-order language
inferred← citeshttps://doi.org/10.1145/509799.503039openalex-snapshot
Automatic time-bound analysis for a higher-order language
inferred← citeshttps://doi.org/10.1145/513829.513865openalex-snapshot
Energy-conserving feedback EDF scheduling for embedded systems with real-time constraints
inferred← citeshttps://doi.org/10.1145/566225.513865openalex-snapshot
Energy-conserving feedback EDF scheduling for embedded systems with real-time constraints
inferred← citeshttps://doi.org/10.1145/584417.584430openalex-snapshot
Language issues of compiling Ada to hardware
inferred← citeshttps://doi.org/10.1145/859618.859659openalex-snapshot
Virtual simple architecture (VISA)
inferred← citeshttps://doi.org/10.1145/871656.859659openalex-snapshot
Virtual simple architecture (VISA)
inferred← citeshttps://doi.org/10.1145/997163.997183openalex-snapshot
Compositional static instruction cache simulation
inferred← citeshttps://doi.org/10.1145/998300.997183openalex-snapshot
Compositional static instruction cache simulation
inferred← citeshttps://doi.org/10.1201/9781420043839.ch1openalex-snapshot
Worst-Case Execution Time and Energy Analysis
inferred← citeshttps://doi.org/10.12694/scpe.v1i2.81openalex-snapshot
Automatic derivation of path and loop annotations in object-oriented real-time programs
inferred← citeshttps://doi.org/10.12694/scpe.v4i2.240openalex-snapshot
The Estimation of the WCET in Super-Scalar Real-Time System
inferred← citeshttps://doi.org/10.1541/ieejias.119.1053openalex-snapshot
A Study on Execution Time of Ladder Diagram in Programmable Controller
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.2197/ipsjtsldm.3.69openalex-snapshot
Performance Estimation with Automatic False-Path Detection for System-Level Designs
inferred← citeshttps://doi.org/10.2498/cit.2000.03.01openalex-snapshot
State of the Art and Open Research Topics in Embedded Hard Real-Time Systems Design
inferred← citeshttps://doi.org/10.2514/6.1995-989openalex-snapshot
A real-time performability evaluation tool
inferred← citeshttps://doi.org/10.26634/jse.10.2.3731openalex-snapshot
An Optimal Ant Algorithm For Balanced Scheduling In Computing Grids
inferred← citeshttps://doi.org/10.3745/kipsta.2005.12a.5.365openalex-snapshot
Implementation of Worst Case Execution Time Analysis Tool For Embedded Software based on XScale Processor
inferred← citeshttps://doi.org/10.3929/ethz-a-004937456openalex-snapshot
Approximating the worst-case execution of soft real-time applications
inferred← citeshttps://doi.org/10.4018/978-1-4666-0056-0.ch002openalex-snapshot
Balanced Job Scheduling Based on Ant Algorithm for Grid Network
showing the first 200 of 215 · page through all 215
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.