-
1
-
-
84888210118
-
The ForSpec temporal language: A new temporal property-specification language
-
Proc. 8th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), Springer-Verlag
-
R. Armoni, L. Fix, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, E. Singerman, M.Y. Vardi, and Y. Zbar. The ForSpec temporal language: A new temporal property-specification language. In Proc. 8th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), Lecture Notes in Computer Science 2280, pages 296-311. Springer-Verlag, 2002.
-
(2002)
Lecture Notes in Computer Science
, vol.2280
, pp. 296-311
-
-
Armoni, R.1
Fix, L.2
Gerth, R.3
Ginsburg, B.4
Kanza, T.5
Landver, A.6
Mador-Haim, S.7
Tiemeyer, A.8
Singerman, E.9
Vardi, M.Y.10
Zbar, Y.11
-
2
-
-
84958756507
-
The temporal logic sugar
-
Proc. Conf. on Computer-Aided Verification
-
I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh. The temporal logic sugar. In Proc. Conf. on Computer-Aided Verification, LNCS 2102, pages 363-367, 2001.
-
(2001)
LNCS
, vol.2102
, pp. 363-367
-
-
Beer, I.1
Ben-David, S.2
Eisner, C.3
Fisman, D.4
Gringauze, A.5
Rodeh, Y.6
-
3
-
-
35048900689
-
20 states and beyond
-
June
-
20 states and beyond. Information and Computation, 98(2): 142-170, June 1992.
-
(1992)
Information and Computation
, vol.98
, Issue.2
, pp. 142-170
-
-
Burch, J.R.1
Clarke, E.M.2
McMillan, K.L.3
Dill, D.L.4
Hwang, L.J.5
-
4
-
-
0002147440
-
Simple on-the-fly automatic verification of linear temporal logic
-
P. Dembiski and M. Sredniawa, editors, Chapman & Hall, August
-
R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembiski and M. Sredniawa, editors, Protocol Specification, Testing, and Verification, pages 3-18. Chapman & Hall, August 1995.
-
(1995)
Protocol Specification, Testing, and Verification
, pp. 3-18
-
-
Gerth, R.1
Peled, D.2
Vardi, M.Y.3
Wolper, P.4
-
5
-
-
0033079595
-
Applications of asynchronous circuits
-
asynchronous circuits & systems
-
S.M. Nowick K. van Berkel, M.B. Josephs. Applications of asynchronous circuits. Proceedings of the IEEE, 1999. special issue on asynchronous circuits & systems.
-
(1999)
Proceedings of the IEEE
, Issue.SPEC. ISSUE
-
-
Nowick, S.M.1
Van Berkel, K.2
Josephs, M.B.3
-
7
-
-
0030672648
-
Formal verification in a commercial setting
-
R.P. Kurshan. Formal verification in a commercial setting. In Proc. Conf. on Design Automation (DAC'97), volume 34, pages 258-262, 1997.
-
(1997)
Proc. Conf. on Design Automation (DAC'97)
, vol.34
, pp. 258-262
-
-
Kurshan, R.P.1
-
9
-
-
84991920015
-
Complexity of solvable cases of the decision problem for the predicate calculus
-
H.R. Lewis. Complexity of solvable cases of the decision problem for the predicate calculus. In Foundations of Computer Science, volume 19, pages 35-47, 1978.
-
(1978)
Foundations of Computer Science
, vol.19
, pp. 35-47
-
-
Lewis, H.R.1
-
11
-
-
35248827148
-
Semantics of temporal e
-
T. F. Melham and F.G. Moller, editors, University of Glasgow, Department of Computing Science Technic al Report
-
M.J. Morley. Semantics of temporal e. In T. F. Melham and F.G. Moller, editors, Banff'99 Higher Order Workshop (Formal Methods in Computation). University of Glasgow, Department of Computing Science Technic al Report, 1999.
-
(1999)
Banff'99 Higher Order Workshop (Formal Methods in Computation)
-
-
Morley, M.J.1
-
12
-
-
84947756513
-
Alternating automata, the weak monadic theory of the tree and its complexity
-
Proc. 13th Int. Colloquium on Automata, Languages and Programming
-
D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th Int. Colloquium on Automata, Languages and Programming, LNCS 226, 1986.
-
(1986)
LNCS
, vol.226
-
-
Muller, D.E.1
Saoudi, A.2
Schupp, P.E.3
-
14
-
-
0022092438
-
The complexity of prepositional linear temporal logic
-
A.P. Sistla and E.M. Clarke. The complexity of prepositional linear temporal logic. Journal ACM, 32:733-749, 1985.
-
(1985)
Journal ACM
, vol.32
, pp. 733-749
-
-
Sistla, A.P.1
Clarke, E.M.2
-
16
-
-
0000451518
-
A combinatorial approach to the theory of ω-automata
-
W. Thomas. A combinatorial approach to the theory of ω-automata. Information and Computation, 48:261-283, 1981.
-
(1981)
Information and Computation
, vol.48
, pp. 261-283
-
-
Thomas, W.1
-
17
-
-
0005302867
-
The convenience of tilings
-
Complexity, Logic and Recursion Theory
-
P. van Emde Boas. The convenience of tilings. In Complexity, Logic and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathetaics, pages 331-363, 1997.
-
(1997)
Lecture Notes in Pure and Applied Mathetaics
, vol.187
, pp. 331-363
-
-
Van Emde Boas, P.1
-
18
-
-
84947731286
-
An automata-theoretic approach to linear temporal logic
-
Logics for Concurrency: Structure versus Automata
-
M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, LNCS 1043, pages 238-266, 1996.
-
(1996)
LNCS
, vol.1043
, pp. 238-266
-
-
Vardi, M.Y.1
-
20
-
-
0022704337
-
Automata-theoretic techniques for modal logics of programs
-
April
-
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2): 182-221, April 1986.
-
(1986)
Journal of Computer and System Science
, vol.32
, Issue.2
, pp. 182-221
-
-
Vardi, M.Y.1
Wolper, P.2
-
21
-
-
0001909357
-
Reasoning about infinite computations
-
November
-
M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
-
(1994)
Information and Computation
, vol.115
, Issue.1
, pp. 1-37
-
-
Vardi, M.Y.1
Wolper, P.2
|