![]() 313–324 in Proceedings of the 20th International Colloquium on Automata, Languages, and Programming (ICALP), A. Ibarra, O.H., Jiang, T., Tran, N., and Wang, H., 1993, “New decidability results concerning two way counter machines and applications,” pp. Ibarra, O.H., 1978, “Reversal-bounded multicounter machines and their decision problems,” Journal of the ACM 25(1), 116–133. and Ullman, J.D., 1979, Introduction to Automata Theory, Languages and Computation, Reading, MA: Addison-Wesley. and Raz, D., 1993, “Deciding properties of nonregular programs,” SIAM Journal of Computing 22(4), 857–874. Ginsburg, S., 1966, The Mathematical Theory of Context-Free Languages, New York: McGraw-Hill. 155–166 in Proceedings of the International Conference on Computer-Aided Verification (CAV), O. Thesis, Indiana University.įisler, K., 1997, “Containment of regular languages in non-regular timing diagram languages is decidable,” pp. Börger, ed., Oxford: Oxford Science Publications.ĭillon, L.K., Kutty, G., Moser, L.E., Melliar-Smith, P.M., and Ramakrishna, Y.S., 1993, “A graphical interval logic for specifying concurrent systems,” Technical Report, UCSB.įisler, K., 1996, “A unified approach to hardware verification through a heterogeneous logic of design diagrams,” Ph.D. 331–409 in Specification and Validation Methods, E. ![]() ![]() Cornell, eds., Berlin: Springer-Verlag.ĭamm, W., Josko, B., and Schlör, R., 1995, “Specification and verification of VHDL-based system-level hardware designs,” pp. and Khordoc, K., 1995, “Interface specifications with conjunctive timing constraints: Realizability and compatibility,” in Second AMAST Workshop on Real-Time Systems, D. 592–601 in Proceedings of the 25th ACM Symposium on the Theory of Computing, Association for Computing Machinery, ed., New York: ACM Press.īerkane, B., Gandrabur, S., and Cerny, E., 1996, “Timing diagrams: Semantics and timing analysis,” LASSO, University of Montreal.īrzozowski, J.A., Gahlinger, T., and Mavaddat, F., 1991, “Consistency and satisfiability of waveform timing specifications,” Networks 21, 91–107.Ĭerny, E. and Schneider, F.B., 1985, “Defining liveness,” Information Processing Letters 21, 181–185.Īlur, R., Henzinger, T.A., and Vardi, M.Y., 1993, “Parametric real-time reasoning,” pp.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |