Specification of communicating processes: Temporal logic versus refusals-based refinement

Formal Aspects of Computing

Volumn 20, Issue 3, 2008, Pages 277-294

  Lowe, Gavin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

CSP; Refinement testing; Refusals; Specification; Temporal logic

Indexed keywords

ALGEBRA; FAILURE ANALYSIS; MATHEMATICAL MODELS; SPECIFICATIONS;

COMMUNICATING SEQUENTIAL PROCESSES (CSP); REFINEMENT TESTING;

TEMPORAL LOGIC;

EID: 43449088254     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-007-0065-0     Document Type: Article

References (21)

1. Aceto L, Ingólfsdóttir A (1999) Testing Hennessy-Milner logic with recursion. In: Foundations of software science and computation structure, pp 41-55
2. Boudol G, Larsen KG (1992) Graphical versus logical specifications. Theor Comput Sci 106(1):3-20
3. Clarke EM, Emerson EA, Sistla AP (1986) Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans Program Lang Syst 8(2):244-263
4. Hennessy M, Milner R (1985) Algebraic laws for nondeterminism and concurrency. J ACM 32:137-161
5. Hoare CAR (1985) Communicating sequential processes. Prentice Hall, Englewood Cliffs
6. Holzmann G (1997) The model checker SPIN. IEEE Trans Softw Eng 23(5):279-295
7. Holzmann G (2003) The SPIN model checker. Addison-Wesley, Reading
8. Jackson D (1992) Logic verification of reactive software systems. D. Phil thesis, Oxford University
9. Leuschel M, Massart T, Currie A (2001) How to make FDR spin: LTL model checking of CSP by refinement. In: Proceedings of formal methods Europe FME'2001, LNCS 2021. Springer, Heidelberg, pp 99-118
10. Lowe G (1998) Casper: A compiler for the analysis of security protocols. J Comput Secur 6:53-84
11. Mukarram A (1993) A refusal testing model for CSP. D. Phil thesis, Oxford
12. Phillips I (1987) Refusal testing. Theor Comput Sci 50:241-284
13. Pnueli A (1981) The temporal logic of concurrent programs. Theor Comput Sci 13:45-60
14. Roscoe AW (1994) Model-checking CSP. In: A classical mind, essays in honour of C.A.R. Hoare. Prentice-Hall, Englewood Cliffs
15. Roscoe AW (1997) The theory and practice of concurrency. Prentice Hall, Englewood Cliffs
16. Roscoe AW (2005) On the expressive power of CSP refinement. Form Aspects Comput 17(2):93-112
17. Syverson P, Meadows C (1996) A formal language for cryptographic protocol requirements. Des Codes Cryptogr 7(1,2):27-59
18. Vardi M, Wolper P (1986) An automata-theoretic approach to automatic program validation. In: Proceedings of LICS'86, pp 332-344
19. Wolper P (1983) Temporal logic can be more expressive. Inf Control 56(1-2):72-99
20. Wolper P (2001) Constructing automata from temporal logic formulas: A tutorial. In: Lectures on formal methods in performance analysis (First EEF/Euro Summer School on Trends in Computer Science), LNCS 2090. Springer, Heidelberg, pp 261-277
21. Zakiuddin I, Moffat N, Goldsmith M, Whitworth T (2002) Property based compression strategies. In: Proceedings of the second workshop on automated verification of critical systems (AVoCS 2002)