-
2
-
-
0027986033
-
A compositional proof system for the modal μ -calculus
-
H.R. Anderson, C.P. Stirling, G. Winskel, A compositional proof system for the modal μ -calculus, in: Proceedings of 9th IEEE Symposium on Logic in Computer Science, 1994, pp. 144-153.
-
(1994)
Proceedings of 9th IEEE Symposium on Logic in Computer Science
, pp. 144-153
-
-
Anderson, H.R.1
Stirling, C.P.2
Winskel, G.3
-
3
-
-
84958757444
-
Compositional verification of secure Applet interactions
-
Proceedings of FASE'02
-
G. Barthe, D. Gurov, M. Huisman, Compositional verification of secure Applet interactions, in: Proceedings of FASE'02, Springer LNCS 2306, 2002, pp. 15-32.
-
(2002)
Springer LNCS
, vol.2306
, pp. 15-32
-
-
Barthe, G.1
Gurov, D.2
Huisman, M.3
-
6
-
-
35248827089
-
A spatial logic for concurrency (part II)
-
CONCUR 2002, Proceedings of 13th International Conference on Concurrency Theory
-
L. Caires, L. Cardelli, A spatial logic for concurrency (part II), in: CONCUR 2002, Proceedings of 13th International Conference on Concurrency Theory, Springer LNCS 2421, 2002, pp. 209-225.
-
(2002)
Springer LNCS
, vol.2421
, pp. 209-225
-
-
Caires, L.1
Cardelli, L.2
-
7
-
-
21844525982
-
Compositional proof systems for model checking infinite state processes
-
M. Dam, Compositional proof systems for model checking infinite state processes, in: International Conference on Concurrency Theory, 1995, pp. 12-26.
-
(1995)
International Conference on Concurrency Theory
, pp. 12-26
-
-
Dam, M.1
-
8
-
-
0009008220
-
Proving properties of dynamic process networks
-
Dam M. Proving properties of dynamic process networks. Inform. Comput. 140:1998;95-114.
-
(1998)
Inform. Comput.
, vol.140
, pp. 95-114
-
-
Dam, M.1
-
10
-
-
0009007806
-
Toward parametric verification of open distributed systems
-
A. Pnueli, H. Langmaack, & W.-P. de Roever. Springer
-
Dam M., Fredlund L., Gurov D. Toward parametric verification of open distributed systems. Pnueli A., Langmaack H., de Roever W.-P. Compositionality: the Significant Difference. 1998;Springer.
-
(1998)
Compositionality: The Significant Difference
-
-
Dam, M.1
Fredlund, L.2
Gurov, D.3
-
11
-
-
0036540342
-
μ-calculus with explicit points and approximations
-
Dam M., Gurov D. μ-calculus with explicit points and approximations J. Logic Comput. 12:2002;255-269.
-
(2002)
J. Logic Comput.
, vol.12
, pp. 255-269
-
-
Dam, M.1
Gurov, D.2
-
12
-
-
0031380305
-
Decidability of model-checking for infinite-state concurrent systems
-
Esparza J. Decidability of model-checking for infinite-state concurrent systems. Acta Inform. 34:1997;85-107.
-
(1997)
Acta Inform.
, vol.34
, pp. 85-107
-
-
Esparza, J.1
-
14
-
-
84942118207
-
Investigations into logical deduction
-
M.E. Szabo. North Holland Publishing Company. Originally published in German, 1935
-
Gentzen G. Investigations into logical deduction. Szabo M.E. The Collected Papers of Gerhard Gentzen. 1969;68-128 North Holland Publishing Company. Originally published in German, 1935.
-
(1969)
The Collected Papers of Gerhard Gentzen
, pp. 68-128
-
-
Gentzen, G.1
-
15
-
-
0022520256
-
A modal characterization of observational congruence on finite terms of CCS
-
Graf S., Sifakis J. A modal characterization of observational congruence on finite terms of CCS. Inform. Control. 68:1986;125-145.
-
(1986)
Inform. Control
, vol.68
, pp. 125-145
-
-
Graf, S.1
Sifakis, J.2
-
16
-
-
0021974161
-
Algebraic laws for nondeterminism and concurrency
-
Hennessy M., Milner R. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32:1985;137-161.
-
(1985)
J. Assoc. Comput. Mach.
, vol.32
, pp. 137-161
-
-
Hennessy, M.1
Milner, R.2
-
17
-
-
49049126479
-
Results on the propositional mu-calculus
-
Kozen D. Results on the propositional mu-calculus. Theoret. Comput. Sci. 27:1983;333-354.
-
(1983)
Theoret. Comput. Sci.
, vol.27
, pp. 333-354
-
-
Kozen, D.1
-
18
-
-
0003954103
-
-
Prentice Hall international series in computer science, Prentice Hall
-
R. Milner, Communication and Concurrency, Prentice Hall international series in computer science, Prentice Hall, 1989.
-
(1989)
Communication and Concurrency
-
-
Milner, R.1
-
20
-
-
24844444665
-
-
M.Sc. Dissertation, Division of Informatics, University of Edinburgh
-
U. Schöpp, Formal verification of processes, M.Sc. Dissertation, Division of Informatics, University of Edinburgh, 2001.
-
(2001)
Formal Verification of Processes
-
-
Schöpp, U.1
-
21
-
-
0942291405
-
Verifying temporal properties using explicit approximants: Completeness for context-free processes
-
Proceedings of FOSSACS 2002
-
U. Schöpp, A.K. Simpson, Verifying temporal properties using explicit approximants: completeness for context-free processes, In Proceedings of FOSSACS 2002, Springer LNCS 2303, 2002, pages 372-386.
-
(2002)
Springer LNCS
, vol.2303
, pp. 372-386
-
-
Schöpp, U.1
Simpson, A.K.2
-
24
-
-
2942627292
-
A note on global induction mechanisms in a μ -calculus with explicit approximations
-
C. Sprenger, M. Dam, A note on global induction mechanisms in a μ -calculus with explicit approximations, in: Proceedings of FICS'02, 2002.
-
(2002)
Proceedings of FICS'02
-
-
Sprenger, C.1
Dam, M.2
-
25
-
-
0022322350
-
Modal logics for communicating systems
-
Stirling C.P. Modal logics for communicating systems. Theoret. Comput. Sci. 49:1987;311-347.
-
(1987)
Theoret. Comput. Sci.
, vol.49
, pp. 311-347
-
-
Stirling, C.P.1
-
26
-
-
0001132880
-
Local model checking in the modal mu-calculus
-
Stirling C.P., Walker D. Local model checking in the modal mu-calculus. Theoret. Comput. Sci. 89:1991;161-177.
-
(1991)
Theoret. Comput. Sci.
, vol.89
, pp. 161-177
-
-
Stirling, C.P.1
Walker, D.2
-
29
-
-
0034711982
-
Completeness of Kozen's axiomatisation of the propositional μ -calculus
-
Walukiewicz I. Completeness of Kozen's axiomatisation of the propositional. μ -calculus Inform. Comput. 157:2000;142-182.
-
(2000)
Inform. Comput.
, vol.157
, pp. 142-182
-
-
Walukiewicz, I.1
-
30
-
-
0009053815
-
A complete proof system for SCCS with modal assertions
-
Winskel G. A complete proof system for SCCS with modal assertions. Fundam. Inform. IX:1986;401-420.
-
(1986)
Fundam. Inform.
, vol.9
, pp. 401-420
-
-
Winskel, G.1
|