Abstract
We present several formal program refinement rules for designing multi-tasking programs with hard real-time constraints.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5):284–292, September 1993.
A. Burns and A. J. Wellings. HRT-HOOD: A structured design method for hard real-time systems. Real-Time Systems, 6(1):73–114, January 1994.
A. Burns and A. J. Wellings. Simple Ada 95 tasking models for high integrity applications. Department of Computer Science, University of York, May 1996.
C. J. Fidge. Modelling real-time multi-tasking systems with timed traces. In Proc. Third Australasian Conference on Parallel and Real-Time Systems, pages 94–100, Brisbane, September 1996.
I. J. Hayes and M. Utting. Coercing real-time refinement: A transmitter. In D. J. Duke and A. S. Evans, editors, BCS-FACS Northern Formal Methods Workshop, 1996, Electronic Workshops in Computing. Springer-Verlag, 1997. http:// www.springer.co.uk/ewic/workshops/NFM96/.
M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390–395, 1986.
Z. Liu. Specification and verification in the duration calculus. In M. Joseph, editor, Real-Time Systems—Specification, Verification and Analysis, chapter 7, pages 182–228. Springer-Verlag, 1996.
Z. Liu and M. Joseph. Formalizing real-time scheduling as program refinement. In Proc. 4th AMAST Workshop on Real-Time Systems, Concurrency and Distributed Software, Mallorca, May 1997.
Z. Liu, M. Joseph, and T. Janowski. Verification of schedulability for real-time programs. Formal Aspects of Computing, 7(5):510–532, 1995.
B. Mahony. Using the refinement calculus for dataflow processes. Technical Report 94-32, Software Verification Research Centre, October 1994.
B. P. Mahony. The refinement calculus and data-flow processes. In Proc. Second Australasian Refinement Workshop, pages 1–28, Brisbane, September 1992.
B. P. Mahony and I. J. Hayes. A case-study in timed refinement: A mine pump. IEEE Transactions on Software Engineering, 18(9):817–826, September 1992.
C. Millerchip, B. Mahony, and I. J. Hayes. The generic problem competition: A whole system specification of the boiler system. Software Verification Research Centre, University of Queensland, June 1993.
Z. Yuhua and Z. Chaochen. A formal proof of the deadline driven scheduler. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real Time and Fault Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 756–775. Springer-Verlag, 1994.
C. Zhou. Duration calculi: An overview. In D. Bjorner, M. Broy, and I. Pottosin, editors, Formal Methods in Programming and Their Applications, volume 735 of Lecture Notes in Computer Science, pages 256–266. Springer-Verlag, 1993. Extended abstract.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fidge, C.J. (1997). Refinement rules for real-time multi-tasking programs. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000472
Download citation
DOI: https://doi.org/10.1007/BFb0000472
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63888-9
Online ISBN: 978-3-540-69661-2
eBook Packages: Springer Book Archive