This work was supported by the NSF under grant MIP-8858807. The second author is also supported by an ONR Graduate Fellowship.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
J.R. Burch, E.M. Clark, K.L. McMillan, D.L. Dill, and L.J. Hwang, “Symbolic Model Checking: 1020 States and Beyond,” Proceedings of the Conference on Logic in Computer Science, 1990, pp. 428–439.
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.
Karl S. Brace, Richard L. Rudell, and Randal E. Bryant, “Efficient Implementation of a BDD Package,” 27th ACM/IEEE Design Automation Conference, 1990, pp. 40–45.
Randal E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation”, IEEE Transactions on Computers, Vol. C-35, No. 8 (August 1986), pp. 677–691.
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.
A. Ginzburg, “Algebraic Theory of Automata”, ACM Monograph Series, Academic Press, 1968.
N. Klarlund, “Progress Measures and Finite Arguments for Infinite Computations”, Ph.D Thesis, Cornell University, TR 90-1153, September 1990.
N. Klarlund and F.B. Schneider, “Verifying safety properties using infinite-state automata”, Technical report. TR-1036, Cornell University, 1989.
R. Kurshan, “Analysis of discrete event coordination”, in Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, LNCS 430, J.W. deBakker, W.-P. de Roever, G. Rozenberg (eds.), Springer-Verlag 1990, pp. 414–453.
N.A. Lynch, H. Attiya, “Using mappings to prove timing properties”, MIT-LCS-TM-412.b, 1989.
Paul Loewenstein and David Dill, “Formal Verification of Cache Systems using Refinement Relations,” IEEE International Conference on Computer Design, 1990, pp. 228–233.
S.S. Lam, A.U. Shankar, “Protocol verification via projections”, IEEE Transactions on Software Engineering, SE-10(4):325–342, July 1984.
N.A. Lynch, M.R. Tuttle, “Hierarchical correctness proofs for distributed algorithms”, in Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, 1987, pp. 137–151.
R. Milner, “An algebraic definition of simulation between programs”, Proceedings of the 2nd International Joint Conference on Artificial Intelligence, British Computer Society, 1971, pp. 481–489.
D.M.R. Park, “Concurrency and automata on infinite sequences”, in Proc. 5th GI conference (P. Deussen. ed.), LNCS 104, 1981, pp. 167–183.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dill, D.L., Hu, A.J., Wong-Toi, H. (1992). Checking for language inclusion using simulation preorders. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_25
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive