Trace theory for automatic hierarchical verification of speed independent circuits. Memory efficient algorithms for the verification of temporal properties. Journal of the Association for Computing Machinery, 28(1):114–133, January 1981. International Congress of Mathematicians, 1962, pages 23–35. Theories of automata on ω-tapes: A simplified approach. On a decision method in restricted second order arithmetic. Finite automata, and sequential networks. Solving sequential conditions by finite-state strategies. Lecture Notes in Computer Science, Springer-Verlag, July 1989. Colloquium on Automata, Languages and Programming, volume 372, pages 1–17. Realizable and unrealizable concurrent program specifications. This process is experimental and the keywords may be updated as the learning algorithm improves. These keywords were added by machine and not by the authors. This paper provides an introduction to the theory of automata on infinite words and demonstrates its applications to program specification, verification, and synthesis. Unlike classical automata theory, which focused on automata on finite words, the applications to program specification, verification, and synthesis, use automata on infinite words, since the computations in which we are interested are typically infinite. More specifically, questions such as satisfiability of specifications and correctness of programs with respect to their specifications can be reduced to questions such as nonemptiness and containment of automata. By translating programs and specifications to automata, questions about programs and their specifications can be reduced to questions about automata. The automata-theoretic perspective considers the relationships between programs and their specifications as relationships between languages. Thus, programs and specifications can be viewed as descriptions of languages over some alphabet. These computations can be viewed as words over some alphabet. Both programs and specifications are in essence descriptions of computations. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |