Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. P. Aczel. On an inference rule for parallel composition. Unpublished Paper, February 1983.
2. K. R. Apt, F. S. de Boer, and E. R. Olderog. Proving termination of parallel programs. In W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra, editors, Beauty Is Our Business, A Birthday Salute to Edsger W. Dijkstra. Springer-Verlag, 1990.
3. H. Barringer, R. Kuiper, and A. Pnueli. Now you may compose temporal logic specifications. In Proc. Sixteenth ACM Symposium on Theory of Computing, pages 51–63, 1984.
4. N. Francez and A. Pnueli. A proof method for cyclic programs. Acta Informatica, 9:133–157, 1978.
5. C. B. Jones. Development Methods for Computer Programs Including a Notion of Interference. PhD thesis, Oxford University, 1981.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献