Skip to Main content Skip to Navigation
Conference papers

Johnson's procedure: mechanization and parallelization

Abstract : In this note, we present a mechanization of Johnson’s procedure. We first specify the scheduling problem, we are concerned with. Then, we formalize Johnson’s procedure and prove an invariant. Thanks to this invariant, we prove the correctness of Johnson’s procedure and its optimality. Last, also thanks to the invariant, we elaborate a concurrent version of Johnson’s procedure which is correct by construction. We use the Python language for expression and experimentation purposes. The Isabelle HOL assistant theorem prover is used for validating the correctness.
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, May 3, 2017 - 10:29:17 AM
Last modification on : Thursday, March 18, 2021 - 2:34:40 PM
Long-term archiving on: : Friday, August 4, 2017 - 12:43:56 PM


Files produced by the author(s)


  • HAL Id : hal-01517378, version 1
  • OATAO : 17079


M Filali, Nabil Zaidi. Johnson's procedure: mechanization and parallelization. 7th International Real-Time Scheduling Open Problems Seminar (RTSOPS 2016) in conjunction with the 28th Euromicro Conference on Real-Time Systems : ECRTS 2016, Jul 2016, Toulouse, France. pp. 9-10. ⟨hal-01517378⟩



Record views


Files downloads