Verification of a scheduler in B through a timed automata specification

Authors:
Odile Nasr;Jean-Paul Bodeveix;Mamoun Filali;Miloud Rached Irit
Affiliations:
Paul Sabatier University, Toulouse France;Paul Sabatier University, Toulouse France;Paul Sabatier University, Toulouse France;Paul Sabatier University, Toulouse France
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 4
Cited 0

A theory of timed automata

Theoretical Computer Science
The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a methodology for specifying and verifying schedulers using the B method. It is based on the refinement mechanism. The specification must manage time through clocks, whereas the natural modeling of schedulers exploits only stopwatches.