Programs as paths: An approach to timing constraint analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2885, Issue , 2003, Pages 1-15

  Hayes, Ian J ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

TIMING CIRCUITS;

COMPOSITION OPERATORS; EXECUTION PATHS; NONDETERMINISTIC CHOICE; PROGRAM TESTING; REAL TIME PROGRAMS; SEQUENTIAL COMPOSITIONS; TIMING ANALYSIS; TIMING CONSTRAINTS;

SOFTWARE TESTING;

EID: 0345687161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39893-6_1     Document Type: Article

References (19)

1. R.-J. Back and J. von Wright. Refinement Calculus: A Systematic Introduction. Springer, 1998.
2. R.J.R. Back and J. von Wright. Reasoning algebraically about loops. Acta Informatica, 36:295-334, 1999.
3. B. Beizer. Software Testing Techniques. Thomson Computer Press, second edition, 1990.
4. R. Chapman, A. Burns, and A. J. Wellings. Integrated program proof and worst-case timing analysis of SPARK Ada. In ACM Workshop on language, compiler and tool support for real-time systems. ACM Press, 1994.
5. E. Cohen. Hypotheses in Kleene algebra. Technical report TM-ARH-023814, Bellcore, 1994.
6. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
7. C. J. Fidge, I. J. Hayes, and G. Watson. The deadline command. IEE Proceedings - Software, 146(2):104-111, April 1999.
8. S. Grundon, I. J. Hayes, and C. J. Fidge. Timing constraint analysis. In C. McDonald, editor, Computer Science '98: Proc. 21st Australasian Computer Sci. Conf. (ACSC'98), Perth, 4-6 Feb., pages 575-586. Springer, 1998.
9. E.L. Gunter and D. Peled. Path exploration tool. In W.R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS/ETAPS'99), volume 1579 of Lecture Notes in Computer Science, pages 405-419. Springer, 1999.
10. I. J. Hayes. Real-time program refinement using auxiliary variables. In M. Joseph, editor, Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 1926 of Lecture Notes in Camp. Sci., pages 170-184. Springer, 2000.
11. I. J. Hayes. Reasoning about real-time repetitions: Terminating and nonterminating. Science of Computer Programming, 43(2-3):161-192, May-June 2002.
12. I. J. Hayes, C. J. Fidge, and K. Lermer. Semantic characterisation of dead control-flow paths. IEE Proceedings - Software, 148(6):175-186, December 2001.
13. I. J. Hayes and M. Utting. A sequential real-time refinement calculus. Acta Informatica, 37(6):385-448, 2001.
14. E. C. R. Hehner. A Practical Theory of Programming. Springer, 1993.
15. C. A. R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall, 1998.
16. Dexter Kozen. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems, 19(3):427-443, May 1997.
17. K. Lermer, C. J. Fidge, and I. J. Hayes. Linear approximation of execution time constraints. Technical Report 02-31, Software Verification Reseach Centre, The University of Queensland, Oct 2002.
18. C. C. Morgan. Programming from Specifications. Prentice Hall, second edition, 1994.
19. M. Utting and C. J. Fidge. A real-time refinement calculus that changes only time. In He Jifeng, editor, Proc. 7th BCS/FACS Refinement Workshop, Electronic Workshops in Computing. Springer, July 1996.