Combining independent specifications

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

Volumn 2029, Issue , 2001, Pages 45-59

  Reed, Joy N ^a   Sinclair, Jane E ^b  

^a OXFORD BROOKES UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SPECIFICATIONS;

COMPONENT SPECIFICATION; DEDUCTIVE FORMALISMS; EVENT-BASED MODEL; FORMAL FRAMEWORK; OPERATING PROCESS; PARALLEL COMPOSITION; PLUG-IN RELATIONSHIPS; SYSTEM ASPECTS;

MODEL CHECKING;

EID: 23044527468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45314-8_5     Document Type: Conference Paper

References (21)

1. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. JACM, 31:560-599, 1984.
2. R.J.R. Back and R. Kurki-Suonio. Decentralisation of process nets with centralised control. In 2nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 131-142, 1983.
3. S.D. Brookes and A.W. Roscoe. An improved failures model for communi- cating sequential processes. In Proc. Pittsburgh Seminar on Concurrency. Springer, 1985.
4. M.J. Butler. A CSP Approach to Action Systems. DPhil thesis, University of Oxford, 1992.
5. M.J. Butler. csp2b: A practical approach to combining CSP and B. In J. Woodcock J. Davies, J.M. Wing, editor, FM99 World Congress. Springer Verlag, 1999.
6. Sadie Creese and Joy Reed. Verifying end-to-end protocols using induction with CSP/FDR. In Proc. of IPPS/SPDP Workshop on Parallel and Distributed Processing, LNCS 1586, Lisbon, Portugal, 1999. Springer.
7. Formal Systems (Europe) Ltd. Failures Divergence Refinement. User Manual and Tutorial, version 2.11.
8. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
9. Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proc. of TACAS, volume 1055 of LNCS. Springer, 1996.
10. G. Lowe and A.W. Roscoe. Using CSP to detect errors in the TMN protocol. IEEE Trans. Soft. Eng., 23(10), 1997.
11. C. Meadows. The NRL protocol analyzer: An overview. J. Logic Program- ming, 19,20, 1994.
12. C.C. Morgan. Of wp and CSP. In D. Gries W.H.J. Feijen, A.G.M. van Gasteren and J. Misra, editors, Beauty is our business: a birthday salute to Edsger W. Dijkstra. Springer-Verlag, 1990.
13. A.W. Roscoe and R.S. Lazic. Using logical relations for automated veri_cation of data-independent CSP. In Oxford Workshop on Automated Formal Methods ENTCS, Oxford, UK, 1996.
14. A.W. Roscoe. Theory and Practice of Concurrency. Prentice Hall, 1998.
15. G.M. Reed and A.W. Roscoe. The timed failures-stability model for CSP. Theoretical Computer Science, 211:85-127, 1999.
16. J.N. Reed, J.E. Sinclair, and F. Guigand. Deductive reasoning versus model checking: two formal approaches for system development. In K. Taguchi K. Araki, A. Galloway, editor, Integrated Formal Methods 1999, York, UK, June 1999. Springer Verlag.
17. J.N. Reed, J.E. Sinclair, and G.M. Reed. Routing - a challenge to formal methods. In Proc. of International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, 1999. CSREA Press.
18. J.M. Spivey. The Z Notation: A Reference Manual. Prentice Hall, 2nd ed., 1992.
19. H. Treharne and S. Schneider. How to drive a B machine. To appear.
20. H. Treharne and Schneider S. Using a process algebra to control B operations. In K. Taguchi K. Araki, A. Galloway, editor, Integated Formal Methods, pages 437-456, York, UK, 1999. Springer Verlag.
21. J.C.P. Woodcock and C.C. Morgan. Refinement of state-based concurrent systems. In Proc. of VDM Symposium, LNCS 428. Springer-Verlag, 1990.