Object-oriented real-time language design: constructs for timing constraints
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
A framework for building dependable systems
The Computer Journal - Special issue on methodologies (systems and software)
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Program development by stepwise refinement
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Dedos: A Distributed Real-Time Environment
IEEE Parallel & Distributed Technology: Systems & Technology
Towards a Refinement Calculus for Concurrent Real-Time Programs
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
The Real-Time Refinement Calculus: A Foundation for Machine-Independent Real-Time Programming
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Procedures and parameters in the real-time program refinement calculus
Science of Computer Programming
Deriving real-time action systems in a sampling logic
Science of Computer Programming
Hi-index | 0.00 |
A method for extending programminglanguages with timing constructs is proposed. It enables thespecification of timing constraints in programs. The approachis not language specific and the extension can be included inmany existing programming languages. With the extension it ispossible to write real-time program components that can be provencorrect independently of the properties of the machine that isused for their execution. It therefore provides a similar abstractionfrom the execution platform as is normal in non-real-time programming.The presented approach distinguishes two phases in system construction:(1) a platform-independent programming phase that includes theexpression of timing requirements, and (2) an implementationphase where all platform dependencies are addressed. The latteronly differs from a normal compilation in the sense that a feasibleschedule must be found to execute the program.