Distributed on-the-fly model checking and test case generation

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

Volumn 3925 LNCS, Issue , 2006, Pages 126-145

  Joubert, Christophe ^a   Mateescu, Radu ^a,b  

^a INRIA RHÔNE ALPES   (France)

^b UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DATA STORAGE EQUIPMENT; GAME THEORY; MATHEMATICAL MODELS; REAL TIME SYSTEMS;

BOOLEAN EQUATION SYSTEMS (BES); COMPLETE TEST GRAPH (CTG); CONCURRENT SYSTEM; MB-DSOLVE;

CONCURRENT ENGINEERING;

EID: 33745772613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691617_8     Document Type: Conference Paper

References (33)

1. H. R. Andersen. Model checking and boolean graphs. Th. Comp. Sci., 126(1):3-30, April 1994.
2. H. R. Andersen and B. Vergauwen. Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion. In Proc. of CAV'95, LNCS vol. 939, pp. 142-154.
3. J. Barnat, L. Brim, and J. Stribrna. Distributed LTL model-checking in SPIN. In Proc. of SPIN'01, LNCS vol. 2057, pp. 200-216.
4. D. Bergamini, N. Descoubes, Ch. Joubert, and R. Mateescu. BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking. In Proc. of Tacas'05, LNCS vol. 3440, pp. 581-585.
5. B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free mu-calculus. In Proc. of SPIN02, LNCS vol. 2318, pp. 128-147.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications. ACM Trans. on Prog. Lang. and Systems 8(2):244-263, 1986.
7. X. Du, S. A. Smolka, and R. Cleaveland. Local Model Checking and Protocol Analysis. Springer Int. J. on Software Tools for Technology Transfer (STTT), 2(3):219-241, 1999.
8. E. A. Emerson and C-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In Proc. of the 1st LICS, pp. 267-278, 1986.
9. M. J. Fischer and R. E. Ladner. Propositional Dynamic Logic of Regular Programs. J. of Computer and System Sciences, 18(2):194-211, 1979.
10. H. Garavel. OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation, and Testing. In Proc. of TACAS'98, LNCS vol. 1384, pp. 68-84.
11. H. Garavel, F. Lang, and R. Mateescu. An Overview of CADP 2001. European Assoc. for Software Science and Technology (EASST) Newsletter, 4:13-24, 2002.
12. H. Hermanns and Ch. Joubert. A Set of Performance and Dependability Analysis Components for CADP. In Proc. of TACAS'03, LNCS vol. 2619, pp. 425-430.
13. F. Holmén, M. Leucker, and M. Lindström. UppDMC - A Distributed Model Checker for Fragments of the μ-calculus. In Proc. of PDMC'04, ENTCS vol. 128, pp. 91-105.
14. G. Holzmann. The SPIN Model Checker - Primer and Reference Manual. Addison-Wesley, 2003.
15. S. T. Huang and P. W. Kao. Detecting Termination of Distributed Computations by External Agents. J. of Inf. Sci. and Engineering, 7(2):187-201, 1991.
16. C. Jard and T Jéron. TGV: Theory, Principles and Algorithms. Springer Int. J. on Software Tools for Technology Transfer (STTT), 7(4):297-315, 2005.
17. Ch. Joubert and R. Mateescu. Distributed On-the-Fly Equivalence Checking. In Proc. of PDMC'04, ENTCS vol. 128, pp. 47-62.
18. Ch. Joubert and R. Mateescu. Distributed Local Resolution of Boolean Equation Systems. In Proc. of PDP'05. IEEE Computer Society Press.
19. D. Kozen. Results on the Propositional μ-calculus. Th. Comp. Sci., 27:333-354, 1983.
20. K. G. Larsen. Proof Systems for Hennessy-Milner logic with Recursion. In Proc. of CAAP'88, LNCS vol. 299, pp. 215-230.
21. F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Proc. of SPIN'99, LNCS vol. 1680, pp. 22-39.
22. 2. In Proc. of PDMC'03, ENTCS vol. 89, pp. 4-16.
23. A. Mader. Verification of Modal Properties Using Boolean Equation Systems. VERSAL 8, Bertz Verlag, Berlin, 1997.
24. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume I: Specification. Springer-Verlag, 1992.
25. R. Mateescu. Efficient Diagnostic Generation for Boolean Equation Systems. In Proc. of TACAS'00, LNCS vol. 1785, pp. 251-265.
26. R. Mateescu. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In Proc. of TACAS'03, LNCS vol. 2619, pp. 81-96.
27. R. Mateescu. On-the-fly state space reductions for weak equivalences. In Proc. of FMICS'2005.
28. R. Mateescu. CAESAR_SOLVE: A Generic Library for On-the-Fly Resolution of Alternation-Free Boolean Equation Systems. Springer Int. J. on Software Tools for Technology Transfer (STTT), 2006.
29. R. Mateescu and M. Sighireanu. Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-Calculus. Sci. of Comp. Programming, 46(3):255-281, 2003.
30. F. Mattern. Algorithms for Distributed Termination Detection. Distributed Computing, 2:161-175, 1987.
31. G. Pace, F. Lang, and R. Mateescu. Calculating τ-Confluence Compositionally. In Proc. of CAV'03, LNCS vol. 2725, pp. 446-459.
32. P. Stevens and C. Stirling. Practical Model-Checking using Games. In Proc. of TACAS'98, LNCS vol. 1384, pp. 85-101.
33. J. Tretmans. Test Generation with Inputs, Outputs and Repetitive Quiescence. Software - Concepts and Tools, 17(3):103-120, 1996.