Resource-Parameterized Timing Analysis of Real-Time Systems

Kim, Jin Hyun; Legay, Axel; Larsen, Kim Guldstrand; Mikučionis, Marius; Nielsen, Brian

doi:10.1007/978-3-319-26287-1_12

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Formal analysis of scheduling system under resource constraints has been performed by Kim et al [13,14]. The proposed approach can be extended to confidentiality as a resource using the model proposed in this paper.…”

Section: Introductionmentioning

confidence: 99%

Information Leakage as a Scheduling Resource

Biondi

Chadli

Given-Wilson

et al. 2017

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

High-security processes have to load confidential information into shared resources as part of their operation. This confidential information may be leaked (directly or indirectly) to low-security processes via the shared resource. This paper considers leakage from high-security to low-security processes from the perspective of scheduling. The workflow model is here extended to support preemption, security levels, and leakage. Formalization of leakage properties is then built upon this extended model, allowing formal reasoning about the security of schedulers. Several heuristics are presented in the form of compositional preprocessors and postprocessors as part of a more general scheduling approach. The effectiveness of such heuristics are evaluated experimentally, showing them to achieve significantly better schedulability than the state of the art. Modeling of leakage from cache attacks is presented as a case study.

show abstract

Section: Introductionmentioning

confidence: 99%

Information Leakage as a Scheduling Resource

Biondi

Chadli

Given-Wilson

et al. 2017

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…For the design of CPS with multi-processor we consider a two-layer approach as proposed in [25]. The first layer models the hardware platform, with a scheduling system composed of real-time tasks and CPUs.…”

Section: High-level Framework For Multi-processor Scheduling Systemsmentioning

confidence: 99%

High-level frameworks for the specification and verification of scheduling problems

Chadli

Kim

Larsen

et al. 2017

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

Over the years, schedulability of Cyber-Physical Systems (CPS) has mainly been performed by analytical methods. These techniques are known to be effective but limited to a few classes of scheduling policies. In a series of recent work, we have shown that schedulability analysis of CPS could be performed with a model-based approach and extensions of verification tools such as UPPAAL. One of our main contributions has been to show that such models are flexible enough to embed various types of scheduling policies, which goes beyond those in the scope of analytical tools.However, the specification of scheduling problems with model-based approaches requires a substantial modeling effort, and a deep understanding of the techniques employed in order to understand their results. In this paper we propose simplicity-driven high-level specification and verification frameworks for various scheduling problems. These frameworks consist of graphical and user-friendly languages for describing scheduling problems. The high-level specifications are then automatically translated to formal models, and results are trans- formed back into the comprehensible model view. To construct these frameworks we exploit a meta-modeling approach based on the tool generator Cinco.Additionally we propose in this paper two new techniques for scheduling analysis. The first performs runtime monitoring using the CUSUM algorithm to detect alarming change in the system. The second performs optimization using efficient statistical techniques. We illustrate our frameworks and techniques on two case studies.

show abstract