Timing analysis of concurrent programs running on shared cache multi-cores

Y Liang, H Ding, T Mitra, A Roychoudhury, Y Li… - Real-Time …, 2012 - Springer
Memory accesses form an important source of timing unpredictability. Timing analysis of real-
time embedded software thus requires bounding the time for memory accesses …

[图书][B] The compiler design handbook: optimizations and machine code generation

YN Srikant, P Shankar - 2002 - taylorfrancis.com
The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

Accurately estimating worst-case execution time for multi-core processors with shared direct-mapped instruction caches

W Zhang, J Yan - 2009 15th IEEE International Conference on …, 2009 - ieeexplore.ieee.org
In a multicore processor, different cores typically share the last level cache, and threads
running on different cores may interfere with each other in accessing the shared cache …

Scratchpad allocation for concurrent embedded software

V Suhendra, A Roychoudhury, T Mitra - ACM Transactions on …, 2010 - dl.acm.org
Software-controlled scratchpad memory is increasingly employed in embedded systems as
it offers better timing predictability compared to caches. Previous scratchpad allocation …

WCET analysis with procedure arguments as parameters

S Grebant, C Ballabriga, J Forget, G Lipari - Proceedings of the 31st …, 2023 - dl.acm.org
Parametric Worst-Case Execution Time (WCET) is a static analysis that computes a WCET
formula that depends on various parameters. The formula can be used off-line for fast …

Performance debugging of Esterel specifications

L Ju, BK Huynh, A Roychoudhury… - … of the 6th IEEE/ACM/IFIP …, 2008 - dl.acm.org
Synchronous languages like Esterel have been widely adopted for designing reactive
systems in safety-critical domains such as avionics. Specifications written in Esterel are …

Terminating exploration of a grid by an optimal number of asynchronous oblivious robots

S Devismes, A Lamani, F Petit, P Raymond… - The Computer …, 2021 - academic.oup.com
We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-
shaped network. In this context, we investigate optimal (wrt the number of robots) …

[图书][B] Embedded systems and software validation

A Roychoudhury - 2009 - books.google.com
Modern embedded systems require high performance, low cost and low power
consumption. Such systems typically consist of a heterogeneous collection of processors …

Trickle: automated infeasible path detection using all minimal unsatisfiable subsets

B Blackham, M Liffiton, G Heiser - 2014 IEEE 19th Real-Time …, 2014 - ieeexplore.ieee.org
Static analysis techniques can be used to compute safe bounds on the worst-case execution
time (WCET) of programs. For large programs, abstractions are often required to curb …

Automatic detection of infeasible paths in large-scale program based on program summaries

Y Dong, S Wang, L Zhang, X Liu, S Liu - Science of Computer …, 2025 - Elsevier
The existence of infeasible paths in a program reduces the coverage of test cases and
causes a waste of valuable testing resources. Detecting infeasible paths allows for focusing …