Abstraction and testing

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

Volumn 1708, Issue , 1999, Pages 738-757

  Schneider, Steve ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; SEMANTICS;

DENOTATIONAL APPROACH; DENOTATIONAL SEMANTICS;

FORMAL METHODS;

EID: 79952424807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48119-2_41     Document Type: Conference Paper

References (8)

1. [DJS92] J. Davies, D. Jackson, S. Schneider. Making things happen in Timed CSP. In Formal Techniques for Real-Time and Fault-Tolerant Systems, volume 573 of Lecture Notes in Computer Science. Springer Verlag, 1992.
2. [dNH84] R de Nicola and M Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(1), 1984.
3. [GH97] M Goldsmith and J Hulance. Application of CSP and FDR to safety-critical systems: Investigation of refinement properties of fault tolerance and prototype implementation of analysis techniques. DERA project report, 1997.
4. [Hen88] M Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
5. [Ros97] A W Roscoe. The Theory and Practice of Concurrency. Prentice-Hall,1997.
6. [RWW94] A W Roscoe, J. C. P Woodcock, L Wulf. Non-interference through determinism. In European Symposium on Research in Computer Security, volume 875 of Lecture Notes in Computer Science. Springer Verlag, 1994.
7. [Sch99a] S A Schneider. Abstraction and testing. Technical Report TR-99-02, Royal Holloway, 1999.
8. [Sch99b] S A Schneider. Concurrent and real-time systems: the CSP approach. John Wiley, 1999. to appear.