Abstract
The process of showing that a program satisfies some particular properties with respect to its specification is called program verification. Axiomatic semantics is a verification method that makes assertions describing properties about the states of a program. There exists a transformation from the assertions of a program's verification proof to executable assertions. The latter may be embedded in the program to make it fault tolerant. An axiomatic proof system for concurrent programs is applied to generate executable assertions in a real time distributed environment. A train set example is used as modelproblem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hoare, C. A. R. 1985. Communicating Sequential Processes. Prentice Hall.
Hong, C., and McMillin, B. 1991. Fault-tolerant matrix multiplication with one-iteration fault latency. Proceedings of the 15th IEEE COMPSAC.
de Lemos, R., Saeed, A., and Anderson, T. 1992a. Analysis of timeliness requirements in safety-critical systems, Lecture Notes in Computer Science 571, Formal Techniques in Real-Time and Fault-Tolerant Systems, pp. 171-192.
de Lemos, R., Saeed, A., and Waterworth, A. 1992b. Exception handling in real-time software from specification to design. Proceedings of the Second International Workshop on Responsive Computing Systems, pp. 108-121.
Lamport, L., and Shostack, R. 1982. The Byzantine general's problem. ACM Transactions on Programming Language Systems 4: 382-401.
McMillin, B., and Ni, L. 1988. Executable assertion development for the distributed parallel environment. Proceedings of the 12th IEEE COMPSAC, pp. 284-291.
McMillin, B., and Ni, L. 1988. A reliable parallel algorithm for relaxation labeling. In Parallel Processing for Computer Vision and Display, P.M. Dew, R.A. Earnshaw and T.R. Heywood, eds. Addison-Wesley, pp. 190-209.
McMillin, B., and Ni, L. 1989. Reliable distributed sorting through the application-oriented fault tolerance paradigm. Proceedings of the 9th ICDS, pp. 508-515.
Moszkowski, B. 1985. Temporal logic for multilevel reasoning about hardware. The Computer Journal 10-18.
Moszkowski, B., and Manna, Z. 1983. Reasoning in interval temporal logic. Lecture Notes in Computer Science 164, Logic of Programs, pp. 371-382.
Moszkowski, B. 1993. Some very compositional temporal properties. Tech. Rep. TR-466, Dept. of Computer Science, University of Newcastle upon Tyne.
Narayana, K. T., and Aaby, A. A. 1988. Specification of real-time systems in real-time temporal interval logic. Proceedings of the IEEE Real-Time Systems Symposium, pp. 86-95.
Peled, D., and Pnueli, A. 1990. Proving partial order liveness properties. Proceedings of the 17th Colloquium on Automata, Language and Programming, pp. 553-571.
Sun, A., and McMillin, B. 1991. Application-oriented fault-tolerant parallel branch and bound. UMR Dept. of Computer Science Technical Report CSC-91-014.
Tsai, G., Insall, M., and McMillin, B. 1995. Constructing an interval temporal logic for real-time systems. Proceedings of the 20th IFAC/IFIC Workshop in Real Time Programming.
Tsai, G., Insall, M., and McMillin, B. 1998. Deriving a fault-tolerant program from verification proof. Computer Science and Information Systems, Fairleigh Dickenson University, Technical Report TR-001-98.
Yau, S. S., and Cheung, R. C. 1975. Design of self-checking software, Proceedings of the International Conference on Reliability Software, pp. 450-457.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tsai, G., Wang, S. Using Program Transformations to Provide Safety Properties for Real-Time Systems. Real-Time Systems 27, 191–207 (2004). https://doi.org/10.1023/B:TIME.0000027933.63133.5f
Issue Date:
DOI: https://doi.org/10.1023/B:TIME.0000027933.63133.5f