How to make FDR spin LTL model checking of CSP by refinement

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

Volumn 2021 LNCS, Issue , 2001, Pages 99-118

  Leuschel, Michael ^a   Massart, Thierry ^b   Currie, Andrew ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FORMAL METHODS; SOFTWARE ENGINEERING;

CSP SPECIFICATIONS; INFINITE STATE SYSTEMS; LTL MODEL-CHECKING; REFINEMENT CHECKING; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 84881138058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45251-6_6     Document Type: Conference Paper

References (24)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21(4):181-185, October 1985.
3. A.Pnueli. The temporal logic of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
4. R. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
5. M. Butler and C. Morgan. Action systems, unbounded nondeterminism, and infinite traces. Formal Aspects of Computing, 7:37-53, 1995.
6. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
7. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
8. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626-643, Dec. 1996.
9. S. J. Creese and A. W. Roscoe. Data independent induction over structured networks. In International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '00), Las Vegas, USA, June 2000.
10. M. Leuschel, T. Massart, and A. Currie. How to make FDR spin: LTL model checking of CSP by refinement. Technical Report DSSE-TR-2000-10, Department of Electronics and Computer Science, University of Southampton, September 2000.
11. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85-107, 1997.
12. Formal Systems (Europe) Ltd. Failures-Divergence Refinement - FDR2 User Manual.
13. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Workshop on Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.
14. C. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
15. G. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
16. M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Proceedings of LOPSTR'99, LNCS 1817, pages 63-82, Venice, Italy, September 1999.
17. J. Magee and J. Kramer. Concurrency: State Models & Java Programs. Wiley, 1999.
18. K. L. McMillan. Symbolic Model Checking. PhD thesis, Boston, 1993.
19. A. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1997.
20. A. W. Roscoe and R. S. Lazic. Using logical relations for automated verification of data-independent CSP. In Proceedings of Oxford Workshop on Automated Formal Methods ENTCS, 1996.
21. R. Sedgewick. Algorithms in C++. Addison-Wesley, 1992.
22. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, July 1985.
23. A. Valmari. On-the-fly verification with stubborn sets. In C. Courcoubetis, editor, Proceedings of CAV'93, LNCS 697, pages 397-408. Springer-Verlag, 1993.
24. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of LICS'86, pages 332-344, 1986.