-
1
-
-
0000627069
-
Appraising fairness in languages for distributed programming
-
K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226–241, 1988.
-
(1988)
Distributed Computing
, vol.2
, pp. 226-241
-
-
Apt, K.R.1
Francez, N.2
Katz, S.3
-
2
-
-
0037917924
-
An overview of SAL
-
C. Michael Holloway, editor, Hampton, VA
-
Saddek Bensalem, Vijay Ganesh, Yassine Lakhnech, Cesar Munoz, Sam Owre, Harald Rueß, John Rushby, Vlad Rusu, Hassen Saidi, N. Shankar, Eli Singerman, and Ashish Tiwari. An overview of SAL. In C. Michael Holloway, editor, LFM 2000: Fifth NASA Langley Formal Methods Workshop, pages 187–196, Hampton, VA, June 2000. Available at http://shemesh.larc.nasa.gov/fm/Lfm2000/Proc/.
-
(2000)
LFM 2000: Fifth NASA Langley Formal Methods Workshop
, pp. 187-196
-
-
Bensalem, S.1
Ganesh, V.2
Lakhnech, Y.3
Munoz, C.4
Owre, S.5
Rueß, H.6
Rushby, J.7
Rusu, V.8
Saidi, H.9
Shankar, N.10
Singerman, E.11
Tiwari, A.12
-
4
-
-
0346353138
-
-
Stanford University
-
N. Bjorner, A. Browne, E. Chang, M. Colon, A. Kapur, Z. Manna, H.B. Simpa, and T.E. Uribe. Step: The stanford temporal prover - user’s manual. Technical Report STAN-CS-TR-95-1562, Department of Computer Science, Stanford University, November 1995.
-
(1995)
Step: The Stanford Temporal Prover - User’s Manual. Technical Report STAN-CS-TR-95-1562, Department of Computer Science
-
-
Bjorner, N.1
Browne, A.2
Chang, E.3
Colon, M.4
Kapur, A.5
Manna, Z.6
Simpa, H.B.7
Uribe, T.E.8
-
7
-
-
84960853881
-
Model checking programs
-
ASE), September
-
G. Brat, K. Havelund, S. Park, and W. Visser. Model checking programs. In In IEEE International Conference on Automated Software Engineering (ASE), September 2000.
-
In IEEE International Conference on Automated Software Engineering
, pp. 2000
-
-
Brat, G.1
Havelund, K.2
Park, S.3
Visser, W.4
-
8
-
-
35048900689
-
Symbolic model checking: 1020 states and beyond
-
J.R. Burch, E.M. Clarke, K.L. McMillan, D. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142–170, 1992.
-
(1992)
Information and Computation
, vol.98
, pp. 142-170
-
-
Burch, J.R.1
Clarke, E.M.2
McMillan, K.L.3
Dill, D.4
Hwang, L.J.5
-
10
-
-
84948168602
-
DSPIN: A dynamic extension of SPIN
-
C. Demartini, R. Iosif, and R. Sisto. dSPIN: A dynamic extension of SPIN. In SPIN, pages 261–276, 1999.
-
(1999)
SPIN
, pp. 261-276
-
-
Demartini, C.1
Iosif, R.2
Sisto, R.3
-
13
-
-
0023365727
-
Statecharts: A visual formalism for complex systems
-
D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8:231–274, 1987.
-
(1987)
Science of Computer Programming
, vol.8
, pp. 231-274
-
-
Harel, D.1
-
14
-
-
0025416878
-
Statemate: A working environment for the development of complex reactive systems
-
D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull- Trauring, and M. Trakhtenbrot. Statemate: a working environment for the development of complex reactive systems. IEEE Trans. on Software Eng., 16(4):403–414, April 1990.
-
(1990)
IEEE Trans. On Software Eng.
, vol.16
, Issue.4
, pp. 403-414
-
-
Harel, D.1
Lachover, H.2
Naamad, A.3
Pnueli, A.4
Politi, M.5
Sherman, R.6
Shtull-Trauring, A.7
Trakhtenbrot, M.8
-
15
-
-
84944196475
-
Using the bandera tool set to model-check properties of concurrent java software
-
June 2001. Invited tutorial paper
-
J. Hatcliff and M. Dwyer. Using the bandera tool set to model-check properties of concurrent java software. In International Conference on Concurrency Theory (CONCUR), June 2001. Invited tutorial paper.
-
International Conference on Concurrency Theory (CONCUR)
-
-
Hatcliff, J.1
Dwyer, M.2
-
21
-
-
0043055250
-
Refinement with global equivalence proofs in temporal logic
-
D. Peled, V. Pratt, and G. Holzmann, editors, American Mathematical Society, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol
-
S. Katz. Refinement with global equivalence proofs in temporal logic. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 59–78. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.
-
(1997)
Partial Order Methods in Verification
, pp. 59-78
-
-
Katz, S.1
-
23
-
-
0025506042
-
-
Interleaving set temporal logic. Theoretical Computer Science, 75:263–287, 1990. Preliminary version appeared in the 6th ACM-PODC
-
S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75:263–287, 1990. Preliminary version appeared in the 6th ACM-PODC, 1987.
-
(1987)
-
-
Katz, S.1
Peled, D.2
-
24
-
-
84944245652
-
Translations between texual transition systems and petri nets
-
Turku, Finland, May
-
K. Korenblat, O. Grumberg, and S. Katz. Translations between texual transition systems and petri nets. In Third international conference on Integrated Formal Methods (IFM’02), Turku, Finland, May 2002.
-
Third International Conference on Integrated Formal Methods (IFM’02)
, pp. 2002
-
-
Korenblat, K.1
Grumberg, O.2
Katz, S.3
-
25
-
-
84944225992
-
-
Computer-aided Verification of Coordinating Processes. Princeton University Press
-
R.P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.
-
(1994)
-
-
Kurshan, R.P.1
-
26
-
-
84944230498
-
-
The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag
-
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
-
(1992)
-
-
Manna, Z.1
Pnueli, A.2
-
27
-
-
84944185701
-
-
Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers
-
K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
-
(1993)
-
-
McMillan, K.L.1
-
28
-
-
84944271779
-
-
http://wwwbrauer.informatik.tu-muenchen.de/gruppen/theorie/KIT/.
-
-
-
-
29
-
-
0029251055
-
Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS
-
Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, February 1995.
-
(1995)
IEEE Transactions on Software Engineering
, vol.21
, Issue.2
, pp. 107-125
-
-
Owre, S.1
Rushby, J.2
Shankar, N.3
Von Henke, F.4
|