Software design, specification, and verification: Lessons learned from the Rether case study

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

Volumn 1349, Issue , 1997, Pages 185-198

  Du, Xiaoqun ^a   McDonnell, Kevin T ^a   Nanos, Evangelos ^a   Ramakrishna, Y S ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BANDWIDTH; CURRICULA; ETHERNET; MODEL CHECKING; SPECIFICATIONS;

ALTERNATIVE DESIGNS; BANDWIDTH GUARANTEE; GUARANTEED BANDWIDTH; LOCAL MODEL CHECKING; MULTIMEDIA APPLICATIONS; NETWORK CONFIGURATION; POTENTIAL EFFICIENCY; SPECIFICATION AND VERIFICATION;

SOFTWARE DESIGN;

EID: 84947929463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000471     Document Type: Conference Paper

References (16)

1. R. Alur and D. Dill. The theory of timed automata. TCS, 126(2), 1994.
2. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branchlng-time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Hdghts, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
3. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification offirdtestate concurrent systems using temporal logic specifications. AOM TOPLAS, 8(2), 1986.
4. R. Cleaveiand, P. M. Lewis, S. A. Smolka, and O. Sokolsky. The Concurrency Factory: A development environment for concurrent systems. In R. A.lur and T. A. Henzinger, editors, Computer Aided Verification (CAV '96), volume 1102 of Lecture Notes in Computer Science, pages 398-401, New Brunswick, New Jersey, July 1996. SpHnger-Verlag.
5. T. Chlueh and C. Venkatramani The design, implementation and evaluation of a software-based real-time ethernet protocol. In Proceedings of ACM SIGCOMM '95, pages 27-37, 1995.
6. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. A CM Computing Surveys, 28(4), December 1996.
7. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with Hch assertional languages. In Proceedings of the 9th International Conference on Computer-Aided Verification, Hails, Israel, July 1997. Springer-Verlag.
8. D. Kozen. Results on the propositional µ-calculus. Theoretical Computer Sci. ence, 27:333-354, 1983.
9. K. L. McMillan and R. Kurshan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
10. A.K. Mok. Toward mechanization of real-time system design. In A. van Tilborg and G. Koch, editors, Foundations of Real-Time Computing: Formal Specifications and Methods, pages 1-38. Kluwer Academic Publishers, 1991.
11. D. L. Parnas. Why software jewels are rare. IEEE Computer, 29(2):57-61, February 1996.
12. J. P. Queille and J. Sifakls. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.
13. Y. S. Ramakrishna and S.A. Smolka. Partial-order reduction in the weak modal mu-calculus. In Proceedings of the Eighth International Conference on Concurrency Theory (CONCUR '97). Springer-Verlag, July 1997.
14. S. Rajan, N. Shankar, and M. K. Srivaa. An integration of model checking with automated proof checking. In P. Wolper, editor, Computer Aided Verification (CAV '95), volume 939 of Lecture Notes in Computer Science, pages 84-97, Liege, Belgium, July 1995. Springer-Verlag.
15. O. Sokolsky and S. A. Smolka. Local model checking for real-time systems. In Proceedings of the 7th International Conference on Computer-Aided Verification. American Mathematical Society, 1995.
16. B. Thomsen, L. Leth, and T.-M. Kuo. A Facile tutorial. In Proceedings of the Seventh International Conference on Concurrency Theory (CONCUR '96), Vol. 1119 of Lecture Notes in Computer Science, pages 278-298. Springer-Verlag, 1996.