Checking for language inclusion using simulation preorders

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

Volumn 575 LNCS, Issue , 1992, Pages 255-265

  Dill, David L ^a   Hu, Alan J ^a   Wong Toi, Howard ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85029640358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55179-4_25     Document Type: Conference Paper

References (16)

1. J.R. Burch, E.M. Clark, K.L. McMillan, and David L. Dill, “Sequential Circuit Verification Using Symbolic Model Checking,” 27th ACM/IEEE Design Automation Conference, 1990, pp. 46-51.
2. 20 States and Beyond,” Proceedings of the Conference on Logic in Computer Science, 1990, pp. 428-439.
3. A.A. Bestavros, “The input-output timed automaton: a model for real-time parallel computation”, Presentation at Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 1990.
4. Karl S. Grace, Richard L. Rudeil, and Randal E. Bryant, “Efficient Implementation of a BDD Package,” 27th ACM/IEEE Design Automation Conference, 1990, pp. 40-45.
5. Randal E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Transactions on Computers, Vol. C-35, No. 8 (August 1986), pp. 677-691.
6. R. Cleaveland, J. Parrow, B. Steffen, “The Concurrency Workbench”, Proceedings of the International Workshop on Automatic Verification of Finite State Systems, June 1989, LNCS 407, J. Sifakis (ed.), Springer-Verlag 1989, pp. 24-37.
7. A. Ginzburg, “Algebraic Theory of Automata”, ACM Monograph Series, Academic Press, 1968.
8. N. Klarlund, “Progress Measures and Finite Arguments for Infinite Computations”, Ph.D Thesis, Cornell University, TR 90-1153, September 1990.
9. N. Klarlund and F.B. Schneider, “Verifying safety properties using infinite-state automata”, Technical report TR-1036, Cornell University, 1989.
10. R. Kurshau, “Analysis of discrete event coordination”, in Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, LNCS 430, J.W. deBakker, W.-P. de Roever, G. Rodenberg (eds.), Springer-Verlag 1990, pp. 414-453.
11. N.A. Lynch, II. Attiya, “Using mappings to prove timing properties”, MIT-LCS-TM-412.b, 1989.
12. Paul Loewenstein and David Dill, “Formal Verification of Cache Systems using Refinement Relations,” IEEE International Conference on Computer Design, 1990, pp. 228-233.
13. S.S. Lam, A.U. Shankar, “Protocol verification via projections”, IEEE Transactions on Software Engineering, SE-10(4):325-342, July 1984
14. N.A. Lynch, M.R. Tuttle, “Hierarchical correctness proofs for distributed algorithms”, in Proceedings of the 61h Annual ACM Symposium on Principles of Distributed Computing, 1987, pp. 137-151.
15. R. Milner, “An algebraic definition of simulation between programs”, Proceedings of the Snd International Joint Conference on Artificial Intelligence, British Computer Society, 1971, pp. 481-489.
16. D.M.R, Park, “Concurrency and automata on infinite sequences”, in Proc. 5th GI conference (P. Deussen. ed.), LNCS 104, 1981, pp. 167-183.