HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
  1. ENSTA Paris's Publications
  2. Search


hal-01246348v1  Conference papers
Sahar Abbaspour, Florian Brandner, Amine Naji, Mathieu Jan. Efficient Context Switching for the Stack Cache
Proceedings of the 23rd International Conference on Real Time and Networks Systems, Julien Forget (Université de Lille, France), Nov 2015, Lille, France. pp.10, ⟨10.1145/2834848.2834861⟩
hal-01108029v1  Journal articles
Florian Brandner, Alexander Jordan. Refinement of worst-case execution time bounds by graph pruning
Computer Languages, Systems and Structures, Elsevier, 2014, 40 (3-4), pp.16. ⟨10.1016/j.cl.2014.09.001⟩
...
hal-01108105v1  Other publications
Sahar Abbaspour, Florian Brandner. Alignment of Memory Transfers of a Time-Predictable Stack Cache
2014, pp.4
...
cea-01773654v1  Journal articles
Amine Naji, Sahar Abbaspour, Florian Brandner, Mathieu Jan. Analysis of preemption costs for the stack cache
Real-Time Systems, Springer Verlag, 2018, ⟨10.1007/s11241-018-9298-7⟩
...
hal-01056216v1  Conference papers
Sahar Abbaspour, Alexander Jordan, Florian Brandner. Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis
14th International Workshop on Worst-Case Execution Time Analysis, Jul 2014, Madrid, Spain. pp.83-92
...
hal-00978015v1  Reports
Florian Brandner, Alexander Jordan. Subgraph-Based Refinement of Worst-Case Execution Time Bounds
2014