Reasoning about Non-terminating Loops Using Deadline Commands
暂无分享,去创建一个
[1] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[2] Ian J. Hayes,et al. Deadlines are termination , 1998, PROCOMET.
[3] Hussein Zedan,et al. A Specification-Oriented Semantics for the Refinement of Real-Time Systems , 1994, Theor. Comput. Sci..
[4] Carroll Morgan,et al. Programming from specifications (2nd ed.) , 1994 .
[5] Colin J. Fidge,et al. A real-time refinement calculus that changes only time , 1996 .
[6] Jjm Jozef Hooman. Assertional specification and verification , 1996 .
[7] Eric C. R. Hehner,et al. A Practical Theory of Programming , 1993, Texts and Monographs in Computer Science.
[8] Ian J. Hayes,et al. Coercing real-time refinement: a transmitter , 1996, FME 1996.
[9] Mathai Joseph,et al. Real-time systems - specification, verification and analysis , 1995, Prentice Hall International series in computer science.
[10] Colin J. Fidge,et al. The deadline command , 1999, IEE Proc. Softw..
[11] Sang Lyul Min,et al. An Accurate Worst Case Timing Analysis for RISC Processors , 1995, IEEE Trans. Software Eng..
[12] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[13] Carroll Morgan,et al. Programming from specifications , 1990, Prentice Hall International Series in computer science.
[14] Eric C. R. Hehner. Termination is Timing , 1989, MPC.
[15] Ian J. Hayes,et al. A sequential real-time refinement calculus , 2001, Acta Informatica.