( en | de | ru )

 

Disambiguation of "Quinton, Sophie"

Author of the publication

copydeleteadd this publication to your clipboard
Bounding deadline misses in weakly-hard real-time systems with task dependencies.

, , , , and . DATE, page 584-589. IEEE, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Clément Quinton

Sophie Scaruppe

Sophie Schetke

Sophie Schäfer

Sophie Romberg

 

Other publications of authors with the same name

Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks., , , and . ECRTS, volume 106 of LIPIcs, page 15:1-15:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks., , and . ACM Trans. Embed. Comput. Syst., 18 (6): 121:1-121:25 (2020)Improving and Estimating the Precision of Bounds on the Worst-Case Latency of Task Chains., , , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 37 (11): 2578-2589 (2018)Finite ready queues as a mean for overload reduction in weakly-hard real-time systems., , and . RTNS, page 88-97. ACM, (2017)Generalized Weakly-Hard Constraints., and . ISoLA (2), volume 7610 of Lecture Notes in Computer Science, page 96-110. Springer, (2012)Exploiting Execution Dynamics in Timing Analysis Using Job Sequences., , and . IEEE Des. Test, 35 (4): 16-22 (2018)A Formal Link Between Response Time Analysis and Network Calculus (Artifact)., , and . Dagstuhl Artifacts Ser., 8 (1): 03:1-03:3 (2022)Formal analysis of sporadic bursts in real-time systems., , and . DATE, page 767-772. EDA Consortium San Jose, CA, USA / ACM DL, (2013)A Formal Link Between Response Time Analysis and Network Calculus., , and . ECRTS, volume 231 of LIPIcs, page 5:1-5:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Generic Coq Proof of Typical Worst-Case Analysis., , , and . RTSS, page 218-229. IEEE Computer Society, (2018)