Model-based verification of a framework for flexible scheduling in the real-time specification for Java

Zerzelidis, Alexandros; Wellings, Andy

doi:10.1145/1167999.1168005

Cited by 4 publications

(5 citation statements)

References 17 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is modified to allow applications to implement two-level scheduling mechanism where the first level is the RTSJ priority scheduler and the second level is under application control [92,93]. They also verify the two-level scheduler for RTSJ using Timed Automata in the UPPAAL tool [94]. The Thread, BaseScheduler (global scheduler), EDFScheduler(local scheduler) and other components are presented by timed automata.…”

Section: • Honeywell Deos Schedulermentioning

confidence: 99%

A survey on formal specification and verification of separation kernels

Zhao¹,

Yang

Ma³

2017

Front. Comput. Sci.

View full text Add to dashboard Cite

Separation kernels are fundamental software of safety and security-critical systems, which provide to their hosted applications spatial and temporal separation as well as controlled information flows among partitions. The application of separation kernels in critical domain demands the correctness of the kernel by formal verification. To the best of our knowledge, there is no survey paper on this topic. This paper presents an overview of formal specification and verification of separation kernels. We first present the background including the concept of separation kernel and the comparisons among different kernels. Then, we survey the state of the art on this topic since 2000. Finally, we summarize research work by detailed comparison and discussion.

show abstract

Section: • Honeywell Deos Schedulermentioning

confidence: 99%

A survey on formal specification and verification of separation kernels

Zhao¹,

Yang

Ma³

2017

Front. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Finally, a yield can also be seen as suspension, in this case self-suspension. Thus, of the eight operations we identify five basic operations which are sufficient to test against for the framework's correctness, as was shown in Zerzelidis and Wellings [2006b]. These are release, end, lock, unlock, and suspend.…”

Section: Scheduling Band Operationsmentioning

confidence: 99%

“…The FMSF framework has already been evaluated for its correctness in Zerzelidis and Wellings [2006b]. In this section we add to the framework's evaluation by describing an implementation of an EDF application scheduler.…”

Section: Framework Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

A framework for flexible scheduling in the RTSJ

Zerzelidis

Wellings

2010

ACM Trans. Embed. Comput. Syst.

Self Cite

View full text Add to dashboard Cite

This article presents a viable solution to introducing flexible scheduling in the Real-Time specification for Java (RTSJ), in the form of a flexible scheduling framework. The framework allows the concurrent use of multiple application-defined scheduling policies, each scheduling a subset of the total set of threads. Moreover, all threads, regardless of the policy under which they are scheduled, are permitted to share common resources. Thus, the framework can accommodate a variety of interworking applications (soft, firm, and hard) running under the RTSJ. The proposed approach is a two-level scheduling framework, where the first level is the RTSJ priority scheduler and the second level is under application control. This article describes the framework's protocol, examines the different types of scheduling policies that can be supported, and evaluates the proposed framework by measuring its execution cost. A description of an application-defined Earliest-Deadline-First (EDF) scheduler illustrates how the interface can be used. Minimum backward-compatible changes to the RTSJ specification are discussed to motivate the required interface. The only assumptions made about the underlying real-time operating system is that it supports preemptive priority-based dispatching of threads and that changes to priorities have immediate effect.

show abstract

“…For this purpose, we adopt a generic solution: we study the mapping to RTSJ [14]. The choice of RTSJ is motivated by two facts: RTSJ has already been considered as a possible execution kernel for space applications [8], moreover since we are also concerned by establishing the correctness of our mapping, the availability of precise descriptions as well informal [4,14] as well formal [8,15] was crucial.…”

Section: Introductionmentioning

confidence: 99%