Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Avrunin, G.S., Corbett, J.C., Dwyer, M.B., Pasareanu, C.S., Siegel, S.F.: Comparing finite-state verification techniques for concurrent software. Technical Report UM-CS-1999-069, Dept. of CS, University of Massachusetts (November 1999) (in preparation)
2. Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over half-duplex lines. Communications of ACM 12(5), 260–261 (1969)
3. Bryant, R.E.: Graph-based algorithms for boolean function manipulations. IEEE Transactions on Computers C-35(8), 677–691 (1986)
4. Cheng, Y.: Refactoring design models for inductive verification. In: Proceedings of International Symposium on Software Testing and Analysis (ISSTA 2002), Rome, Italy, July 2002, pp. 164–168 (2002)
5. Cheng, Y.-P., Young, M., Huang, C.-L., Pan, C.-Y.: Towards scalable compositional analysis by refactoring design models. In: Proceedings of the ACM SIGSOFT 2003 Symposium on the Foundations of Software Engineering, pp. 247–256 (2003)