From philosophical to industrial logics

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

Volumn 5378 LNAI, Issue , 2009, Pages 89-115

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FOURIER TRANSFORMS; MACHINERY; MATHEMATICAL TRANSFORMATIONS; PHILOSOPHICAL ASPECTS; SPECIFICATION LANGUAGES;

EFFECTIVE ALGORITHMS; INFINITE WORDS; MODEL-CHECKING TOOLS; PROGRAM VERIFICATIONS; SECOND-ORDER LOGIC;

MODEL CHECKING;

EID: 59149092460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92701-3_7     Document Type: Conference Paper

References (145)

1. Davis, M.: Engines of Logic: Mathematicians and the Origin of the Computer. Norton (2001)
2. B̈orger, E., Gr̈adel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1996)
3. Dreben, D., Goldfarb, W.D.: The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley, Reading (1979)
4. L̈owenheim, L.: ̈Uber M̈oglichkeiten im Relativkalk̈ull (On possibilities in the claculus of relations). Math. Ann. 76, 447-470 (1915); Translated in From Frege to G̈odel, van Heijenoort. Harvard Univ. Press (1971)
5. Skolem, T.: Untersuchung ̈uber Axiome des Klassenkalk̈uls und ̈uber Produktations- und Summationsprobleme, welche gewisse Klassen von Aussagen betreffen (Investigations of the axioms of the calculusof classes and on product and sum problems that are connected with certain class of statements). Videnskabsakademiet i Kristiania, Skrifter I 3 (1919); Translated in Selected Works in Logic by Th. Skolem", Fenstak, J.E., Scand. Univ. Books, Universitetsforlaget, Oslo, 67-101(1970)
6. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
7. B̈uchi, J.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik und Grundl. Math. 6, 66-92 (1960)
8. B̈uchi, J., Elgot, C., Wright, J.: The non-existence of certain algorithms for finite automata theory (abstract). Notices Amer. Math. Soc. 5, 98 (1958)
9. Elgot, C.: Decision problems of finite-automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21-51 (1961)
10. Trakhtenbrot, B.: The synthesis of logical nets whose operators are described in terms of one-place predicate calculus. Doklady Akad. Nauk SSSR 118(4), 646-649 (1958)
11. Trakhtenbrot, B.: Certain constructions in the logic of one-place predicates. Doklady Akad. Nauk SSSR 138, 320-321 (1961)
12. Trakhtenbrot, B.: Finite automata and monadic second order logic. Siberian Math. J. 3, 101-131 (1962) (in Russian); English translation In: AMS Transl. 59, 23-55 (1966)
13. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 115-125 (1959)
14. Meyer, A.R.: Weak monadic second order theory of successor is not elementary recursive. In: Proc. Logic Colloquium. Lecture Notes in Mathematics, vol. 453, pp. 132-154. Springer, Heidelberg (1975)
15. Stockmeyer, L.: The complexity of decision procedures in Automata Theory and Logic. PhD thesis, MIT, Project MAC Technical Report TR-133 (1974)
16. Church, A.: Applicaton of recursive arithmetics to the problem of circuit synthesis. In: The Summer Institute for Symbolic Logic, Communications Research Division, Institute for Defense Analysis, pp. 3-50 (1957)
17. Lamport, L.: "Sometimes" is sometimes "not never" - on the temporal logic of programs. In: Proc. 7th ACM Symp. on Principles of Programming Languages, pp. 174-185 (1980)
18. Church, A.: Logic, arithmetics, and automata. In: Proc. Int. Congress of Mathematicians, 1962, Institut Mittag-Leffler, pp. 23-35 (1963)
19. B̈uchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295-311 (1969)
20. Kupferman, O., Piterman, N., Vardi, M.: Safraless compositional synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 31-44. Springer, Heidelberg (2006)
21. Kupferman, O., Vardi, M.: Safraless decision procedures. In: Proc. 46th IEEE Symp. on Foundations of Computer Science, pp. 531-540 (2005)
22. Rabin, M.: Automata on infinite objects and Churchs problem. Amer. Mathematical Society (1972)
23. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1-13. Springer, Heidelberg (1995)
24. B̈uchi, J.: On a decision method in restricted second order arithmetic. In: Proc. Int. Congress on Logic, Method, and Philosophy of Science, 1960, pp. 1-12. Stanford University Press (1962)
25. Trakhtenbrot, B., Barzdin, Y.: Finite Automata. North Holland, Amsterdam (1973)
26. Sakoda, W., Sipser, M.: Non-determinism and the size of two-way automata. In: Proc. 10th ACM Symp. on Theory of Computing, pp. 275-286 (1978)
27. Vardi, M.Y.: The b̈uchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 12-22. Springer, Heidelberg (2007)
28. Øhrstrøm, P., Hasle, P.: Temporal Logic: from Ancient Times to Artificial Intelligence. In: Studies in Linguistics and Philosophy, vol. 57. Kluwer, Dordrecht (1995)
29. Prior, A.: Modality de dicto and modality de re. Theoria 18, 174-180 (1952)
30. Rescher, N., Urquhart, A.: Temporal Logic. Springer, Heidelberg (1971)
31. Prior, A.: Time and Modality. Oxford University Press, Oxford (1957)
32. Vardi, M.: Branching vs. linear time: Final showdown. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 1-22. Springer, Heidelberg (2001)
33. Prior, A.: Modality and quantification in s5. J. Symbolic Logic 21, 60-62 (1956)
34. Kripke, S.: A completeness theorem in modal logic. Journal of Symbolic Logic 24, 1-14 (1959)
35. Prior, A.: Past, Present, and Future. Clarendon Press (1967)
36. Kamp, J.: Tense Logic and the Theory of Order. PhD thesis, UCLA (1968)
37. Etessami, K., Vardi, M., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279-295 (2002)
38. Thomas, W.: Star-free regular sets of ?-sequences. Information and Control 42(2), 148-156 (1979)
39. Elgot, C., Wright, J.: Quantifier elimination in a problem of logical design. Michigan Math. J. 6, 65-69 (1959)
40. McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
41. Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symp. on Foundations of Computer Science, pp. 46-57 (1977)
42. Goldblatt, R.: Logic of time and computation. Technical report, CSLI Lecture Notes, no.7. Stanford University (1987)
43. Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196-218. Springer, Heidelberg (1985)
44. Markey, N.: Temporal logic with past is exponentially more succinct. EATCS Bulletin 79, 122-128 (2003)
45. Vardi, M.: A temporal fixpoint calculus. In: Proc. 15th ACM Symp. on Principles of Programming Languages, pp. 250-259 (1988)
46. Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Proc. 7th ACM Symp. on Principles of Programming Languages, pp. 163-173 (1980)
47. Pnueli, A., Zuck, L.: In and out of temporal logic. In: Proc. 8th IEEE Symp. on Logic in Computer Science, pp. 124-135 (1993)
48. Meyer, A.: Ten thousand and one logics of programming. Technical report, MIT, MIT-LCS-TM-150 (1980)
49. Keller, R.: Formal verification of parallel programs. Communications of the ACM 19, 371-384 (1976)
50. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)
51. Halpern, J., Reif, J.: The propositional dynamic logic of deterministic, wellstructured programs (extended abstract). In: Proc. 22nd IEEE Symp. on Foundations of Computer Science, pp. 322-334 (1981)
52. Halpern, J., Reif, J.: The propositional dynamic logic of deterministic, wellstructured programs. Theor. Comput. Sci. 27, 127-165 (1983)
53. Sistla, A.: Theoretical issues in the design of distributed and concurrent systems. PhD thesis, Harvard University (1983)
54. Sistla, A., Clarke, E.: The complexity of propositional linear temporal logics. In: Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 159-168 (1982)
55. Sistla, A., Clarke, E.: The complexity of propositional linear temporal logic. Journal of the ACM 32, 733-749 (1985)
56. Wolper, P.: Temporal logic can be more expressive. In: Proc. 22nd IEEE Symp. on Foundations of Computer Science, pp. 340-348 (1981)
57. Wolper, P.: Temporal logic can be more expressive. Information and Control 56(1- 2), 72-99 (1983)
58. Pratt, V.: A near-optimal method for reasoning about action. Journal of Computer and Systems Science 20(2), 231-254 (1980)
59. Clarke, E., Emerson, E.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52-71. Springer, Heidelberg (1982)
60. Queille, J., Sifakis, J.: Specification and verification of concurrent systems in Cesar. In: Proc. 9th ACM Symp. on Principles of Programming Languages. LNCS, vol. 137. Springer, Heidelberg (1982)
61. Ben-Ari, M., Manna, Z., Pnueli, A.: The logic of nexttime. In: Proc. 8th ACM Symp. on Principles of Programming Languages, pp. 164-176 (1981)
62. Clarke, E., Emerson, E., Sistla, A.: Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In: Proc. 10th ACM Symp. on Principles of Programming Languages, pp. 117-126 (1983)
63. Clarke, E., Emerson, E., Sistla, A.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languagues and Systems 8(2), 244-263 (1986)
64. Vardi, M.: The complexity of relational query languages. In: Proc. 14th ACM Symp. on Theory of Computing, pp. 137-146 (1982)
65. Clarke, E., Grumberg, O.: Avoiding the state explosion problem in temporal logic model-checking algorithms. In: Proc. 16th ACM Symp. on Principles of Distributed Computing, pp. 294-303 (1987)
66. Browne, M., Clarke, E., Dill, D., Mishra, B.: Automatic verification of sequential circuits using temporal logic. IEEE Transactions on Computing C-35, 1035-1044 (1986)
67. Clarke, E., Mishra, B.: Hierarchical verification of asynchronous circuits using temporal logic. Theoretical Computer Science 38, 269-291 (1985)
68. Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, L.: Symbolic model checking: 1020 states and beyond. In: Proc. 5th IEEE Symp. on Logic in Computer Science, pp. 428-439 (1990)
69. Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, L.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2), 142-170 (1992)
70. McMillan, K.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
71. Clarke, E.: The birth of model checking. In: Ramanujam, R., Sarukkai, S. (eds.) ICLA 2009. LNCS (LNAI), vol. 5378. Springer, Heidelberg (2009)
72. Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: Proc. 12th ACM Symp. on Principles of Programming Languages, pp. 97-107 (1985)
73. Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation 115(1), 1-37 (1994)
74. Wolper, P., Vardi, M., Sistla, A.: Reasoning about infinite computation paths. In: Proc. 24th IEEE Symp. on Foundations of Computer Science, pp. 185-194 (1983)
75. Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st IEEE Symp. on Logic in Computer Science, pp. 332- 344 (1986)
76. Kupferman, O., Vardi, M.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic 2(2), 408-429 (2001)
77. Sistla, A., Vardi, M., Wolper, P.: The complementation problem for B̈uchi automata with applications to temporal logic. Theoretical Computer Science 49, 217-237 (1987)
78. Courcoubetis, C., Vardi, M., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 233-242. Springer, Heidelberg (1990)
79. Courcoubetis, C., Vardi, M., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design 1, 275-288 (1992)
80. Bryant, R.: Graph-based algorithms for Boolean-function manipulation. IEEE Transactions on Computing C-35(8), 677-691 (1986)
81. Emerson, E., Lei, C.L.: Efficient model checking in fragments of the propositional μ-calculus. In: Proc. 1st IEEE Symp. on Logic in Computer Science, pp. 267-278 (1986)
82. Clarke, E., Grumberg, O., Hamaguchi, K.: Another look at LTL model checking. In: Proc 6th Int. Conf. on Computer Aided Verification. LNCS, pp. 415-427. Springer, Heidelberg (1994)
83. Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Dembiski, P., Sredniawa, M. (eds.) Protocol Specification, Testing, and Verification, pp. 3-18. Chapman & Hall, Boca Raton (1995)
84. Holzmann, G.: The model checker SPIN. IEEE Transactions on Software Engineering 23(5), 279-295 (1997)
85. Vardi, M.: Automata-theoretic model checking revisited. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 137-150. Springer, Heidelberg (2007)
86. Brayton, R., Hachtel, G., Sangiovanni-Vincentelli, A., Somenzi, F., Aziz, A., Cheng, S.T., Edwards, S., Khatri, S., Kukimoto, T., Pardo, A., Qadeer, S., Ranjan, R., Sarwary, S., Shiple, T., Swamy, G., Villa, T.: VIS: a system for verification and synthesis. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 428-432. Springer, Heidelberg (1996)
87. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: Nusmv 2: An opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359-364. Springer, Heidelberg (2002)
88. Duret-Lutz, A., Poitrenaud, D.: SPOT: An extensible model checking library using transition-based generalized b̈uchi automata. In: Proc. 12th Intl Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp. 76-83. IEEE Computer Society, Los Alamitos (2004)
89. Aggarwal, S., Kurshan, R.: Automated implementation from formal specification. In: Proc. 4th Intl Workshop on Protocol Specification, Testing and Verification, pp. 127-136. North-Holland, Amsterdam (1984)
90. Aggarwal, S., Kurshan, R., Sharma, D.: A language for the specification and analysis of protocols. In: Proc. 3rd Intl. Workshop on Protocol Specification, Testing, and Verification, pp. 35-50. North-Holland, Amsterdam (1983)
91. Kurshan, R.: Analysis of discrete event coordination. In: de Bakker, J., de Roever, W., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 414-453. Springer, Heidelberg (1990)
92. Sabnani, K., Wolper, P., Lapone, A.: An algorithmic technique for protocol verification. In: Proc. Globecom 1985 (1985)
93. Kurshan, R.: Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, Princeton (1994)
94. Hardin, R., Harel, Z., Kurshan, R.: COSPAN. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 423-427. Springer, Heidelberg (1996)
95. Kurshan, R.: Verification technology transfer. In: Proc. 2006 Workshop on 25 Years of Model Checking. Lecture Notes in Conmputer Science. Springer, Heidelberg (2007)
96. Pnueli, A.: Linear and branching structures in the semantics and logics of reactive systems. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 15-32. Springer, Heidelberg (1985)
97. Sistla, A., Vardi, M., Wolper, P.: The complementation problem for B̈uchi automata with applications to temporal logic. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 465-474. Springer, Heidelberg (1985)
98. Banieqbal, B., Barringer, H.: Temporal logic with fixed points. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol. 398, pp. 62-74. Springer, Heidelberg (1987)
99. Vardi, M.: Unified verification theory. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds.) Temporal Logic in Specification. LNCS, vol. 398, pp. 202-212. Springer, Heidelberg (1989)
100. Pratt, V.: Semantical considerations on Floyd-Hoare logic. In: Proc. 17th IEEE Symp. on Foundations of Computer Science, pp. 109-121 (1976)
101. Burstall, R.: Program proving as hand simulation with a little induction. In: Information Processing 1974, Stockholm, Sweden, International Federation for Information Processing, pp. 308-312. North-Holland, Amsterdam (1974)
102. Constable, R.: On the theory of programming logics. In: Proc. 9th ACM Symp. on Theory of Computing, pp. 269-285 (1977)
103. Engeler, E.: Algorithmic properties of structures. Math. Syst. Theory 1, 183-195 (1967)
104. Salwicki, A.: Algorithmic logic: a tool for investigations of programs. In: Butts, R., Hintikka, J. (eds.) Logic Foundations of Mathematics and Computability Theory, pp. 281-295. Reidel (1977)
105. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
106. Apt, K., Olderog, E.: Verification of Sequential and Concurrent Programs. Springer, Heidelberg (2006)
107. Fischer, M., Ladner, R.: Propositional modal logic of programs (extended abstract). In: Proc. 9th ACM Symp. on Theory of Computing, pp. 286-294 (1977)
108. Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. Journal of Computer and Systems Science 18, 194-211 (1979)
109. Pratt, V.: A practical decision method for propositional dynamic logic: Preliminary report. In: Proc. 10th Annual ACM Symposium on Theory of Computing, pp. 326-337 (1978)
110. Harel, D., Sherman, R.: Looping vs. repeating in dynamic logic. Inf. Comput. 55(1-3), 175-192 (1982)
111. Streett, R.: A propositional dynamic logic for reasoning about program divergence. PhD thesis, M.Sc. Thesis, MIT (1980)
112. Street, R.: Propositional dynamic logic of looping and converse. In: Proc. 13th ACM Symp. on Theory of Computing, pp. 375-383 (1981)
113. Streett, R.: Propositional dynamic logic of looping and converse. Information and Control 54, 121-141 (1982)
114. Kozen, D.: Results on the propositional μ-calculus. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 348-359. Springer, Heidelberg (1982)
115. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333-354 (1983)
116. Bradfield, J., Stirling, C.: PDL and modal μ-calculus. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic. Elsevier, Amsterdam (2006)
117. Emerson, E., Clarke, E.: Characterizing correctness properties of parallel programs using fixpoints. In: Proc. 7th Int. Colloq. on Automata, Languages, and Programming, pp. 169-181 (1980)
118. Park, D.: Finiteness is μ-ineffable. Theoretical Computer Science 3, 173-181 (1976)
119. Pratt, V.: A decidable μ-calculus: preliminary report. In: Proc. 22nd IEEE Symp. on Foundations of Computer Science, pp. 421-427 (1981)
120. Emerson, E., Halpern, J.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and Systems Science 30, 1-24 (1985)
121. Emerson, E., Halpern, J.: "Sometimes" and "not never" revisited: On branching versus linear time. In: Proc. 10th ACM Symp. on Principles of Programming Languages, pp. 127-140 (1983)
122. Emerson, E., Halpern, J.: Sometimes and not never revisited: On branching versus linear time. Journal of the ACM 33(1), 151-178 (1986)
123. Harel, D., Kozen, D., Parikh, R.: Process logic: Expressiveness, decidability, completeness. J. Comput. Syst. Sci. 25(2), 144-170 (1982)
124. Vardi, M., Wolper, P.: Yet another process logic. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 501-512. Springer, Heidelberg (1984)
125. Harel, D., Peleg, D.: Process logic with regular formulas. Theoreti. Comp. Sci. 38(2-3), 307-322 (1985)
126. Hafer, T., Thomas, W.: Computation tree logic CTL- and path quantifiers in the monadic theory of the binary tree. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 269-279. Springer, Heidelberg (1987)
127. Beer, I., Ben-David, S., Landver, A.: On-the-fly model checking of RCTL formulas. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 184-194. Springer, Heidelberg (1998)
128. Beer, I., Ben-David, S., Eisner, C., Fisman, D., Gringauze, A., Rodeh, Y.: The temporal logic Sugar. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 363-367. Springer, Heidelberg (2001)
129. Fix, L.: Fifteen years of formal property verification at Intel. In: Proc. 2006 Workshop on 25 Years of Model Checking. LNCS. Springer, Heidelberg (2007)
130. Fix, L., Kamhi, G.: Adaptive variable reordering for symbolic model checking. In: Proc. ACM/IEEE Intl. Conf. on Computer Aided Design, pp. 359-365 (1998)
131. Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., Vardi, M.: Benefits of bounded model checking at an industrial setting. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 436-453. Springer, Heidelberg (2001)
132. Armoni, R., Fix, L., Flaisher, A., Gerth, R., Ginsburg, B., Kanza, T., Landver, A., Mador-Haim, S., Singerman, E., Tiemeyer, A., Vardi, M., Zbar, Y.: The For- Spec temporal logic: A new temporal property-specification logic. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 211-296. Springer, Heidelberg (2002)
133. Bustan, D., Flaisher, A., Grumberg, O., Kupferman, O., Vardi, M.: Regular vacuity. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 191- 206. Springer, Heidelberg (2005)
134. van Berkel, C.H., Josephs, M.B., Nowick, S.M.: Applications of asynchronous circuits. Proceedings of the IEEE 87(2), 223-233 (1999)
135. A comparison of reset control methods: Application note 11 (summit Microelectronics, Inc.) (1999), http://www.summitmicro.com/tech support/notes/note11.htm
136. Vardi, M.: Nontraditional applications of automata theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 575-597. Springer, Heidelberg (1994)
137. Gastin, P., Oddoux, D.: Fast LTL to B̈uchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53-65. Springer, Heidelberg (2001)
138. Morley, M.: Semantics of temporal e. In: Melham, T.F., Moller, F. (eds.) Banff 1999 Higher Order Workshop (Formal Methods in Computation), University of Glasgow, Department of Computing Science Technical Report (1999)
139. Eisner, C., Fisman, D.: A Practical Introduction to PSL. Springer, Heidelberg (2006)
140. Armoni, R., Bustan, D., Kupferman, O., Vardi, M.: Resets vs. aborts in linear temporal logic. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 65-80. Springer, Heidelberg (2003)
141. Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Van Campenhout, D.: Reasoning with temporal logic on truncated paths. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 27-39. Springer, Heidelberg (2003)
142. Eisner, C., Fisman, D., Havlicek, J., McIsaac, A., Van Campenhout, D.: The definition of a temporal clock operator. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 857-870. Springer, Heidelberg (2003)
143. Eisner, C., Fisman, D., Havlicek, J.: A topological characterization of weakness. In: Proc. 24th ACM Symp. on Principles of Distributed Computing, pp. 1-8 (2005)
144. Harel, D., Peleg, D.: More on looping vs. repeating in dynamic logic. Inf. Process. Lett. 20(2), 87-90 (1985)
145. Vijayaraghavan, S., Ramanathan, M.: A Practical Guide for SystemVerilog Assertions. Springer, Heidelberg (2005)