Loops for Safety Critical Applications
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. Sorting and Searching , 1984 .
[2] Edward M. Reingold,et al. Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..
[3] Wolfgang A. Halang,et al. Constructing Predictable Real Time Systems , 1991 .
[4] Johann Blieberger. Discrete Loops and Worst Case Performance , 1994, Comput. Lang..
[5] Jacques Loeckx,et al. The Foundations of Program Verification , 1987 .
[6] Robert Sedgewick,et al. The Analysis of Heapsort , 1993, J. Algorithms.
[7] Edward M. Reingold,et al. Binary search trees of bounded balance , 1972, SIAM J. Comput..
[8] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[9] Hideyuki Tokuda,et al. Object-oriented real-time language design: constructs for timing constraints , 1990, OOPSLA/ECOOP '90.
[10] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[11] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[12] Kurt Mehlhorn,et al. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.
[13] Donald E. Knuth,et al. Sorting and Searching , 1973 .