Author:
Stoller Scott D.,Schneider Fred B.
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Reference32 articles.
1. P.A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison Wesley, 1987.
2. B. Boigelot and P. Godefroid, “Symbolic verification of communication protocols with infinite state spaces using QDDs,” Formal Methods in System Design Vol. 4, No. 3, pp. 237–255, 1999.
3. A. Bouajjani and P. Habermehl, “Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations,” Theoretical Computer Science, Vol. 221, Nos. 1–2, pp. 211–250, 1999.
4. J.D. Brock, A formal model of non-determinate dataflow computation,” Ph.D. thesis, Massachusetts Institute of Technology. Available as MIT Laboratory for Computer Science Technical Report TR-309, 1983.
5. J.D. Brock and W.B. Ackerman, “Scenarios: A model of non-determinate computation,” in: J. Diaz and I. Ramos (Eds.), Formalisation of Programming Concepts, Vol. 107, of Lecture Notes in Computer Science, Springer-Verlag, pp. 252–259, 1981.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献