Modular verification for a class of PLTL properties

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

Volumn 1945 LNCS, Issue , 2000, Pages 398-419

  Masson, Pierre Alain ^a   Mountassir, Hassan ^a   Julliand, Jacques ^a  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

B specification; Buchi automata; Fropositional linear temporal logic PLTL; Model checking; Modularity; Refinement; Verification

Indexed keywords

AUTOMATA THEORY; FORMAL METHODS; VERIFICATION;

BUCHI AUTOMATA; COMBINATORIAL EXPLOSION; LINEAR TEMPORAL LOGIC; MODULAR DECOMPOSITION; MODULAR VERIFICATION; MODULARITY; REFINEMENT; VERIFICATION OF DYNAMIC PROPERTIES; REFINEMENT PROCESS;

MODEL CHECKING;

EID: 34247884915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40911-4_23     Document Type: Conference Paper

References (21)

1. J.-R. Abrial. The B Book : Assigning Programs to Meanings. ISBN 0521-496195. Cambridge University Press, 1996.
2. J. R. Abrial and L. Mussat. Introducing dynamic constraints in b. In Second Conference on the B method, Prance, LNCS 1393, pages 83-128. Springer Verlag, April 1998.
3. A. Arnold. Systemes de transitions finis et semantique des processus communicants. Masson, 1992.
4. A. Arnold and S. Brlek. Automatic verification of properties in transition systems. Software-Practice and Experience, 25(6):579-596, 1995.
5. F. Bellegarde, J. Julliand, and O. Kouchnarenko. Ready-simulation is not ready to express a modular refinement relation. In Proc. Int. Conf. on Fondamental Aspects of Software Engineering, FASE'2000, volume 1783 of Lecture Notes in Computer Science, pages 266-283. Springer-Verlag, April 2000.
6. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
7. Cuellar, I. Wildgruber, and D. Barnard. Combining the design of industrial systems with effective verification techniques. In FME'94, LNCS n. 873, pages 639-658. Springer Verlag, 1994.
8. P. Godefroid. Partial-order methods for the verification of concurrent systems. LNCS, 1032, 1996.
9. P. Godefroid and G.-J. Holzmann. On the verification of temporal properties. In PSTV'93, June 1993.
10. G.-J. Holzmann. Design and validation of computer protocols. 1991.
11. G.-J. Holzmann. The model checker spin. In IEEE Trans. On Software Engineering, volume 23, 1996.
12. G.-J. Holzmann. State compression in spin. In 3rd SPIN Workshop, Twente University, April 1997.
13. H. Hungar. Combining model checking and theorem proving to verify parallel processes. In C. Courcoubetis, editor, 5th International Conference on Computer Aided Verification: CAV'93, number 697 in LNCS, Elounda, June/July 1993.
14. J. Julliand, P.A. Masson, and H. Mountassir. Modular verification of dynamic properties for reactive systems. In International Workshop on Integrated Formal Methods (IFM'99), pages 89-108, York, UK, June 1999. Springer Verlag.
15. K. Laster and O. Grumberg. Modular model-checking of software. In TACAS'98, Lisbon, March-April 1998.
16. Z. Manna and A. Pnuelli. The Temporal Logic of Reactive and Concurrent Systems: Specification. ISBN 0-387-97664-7. Springer-Verlag, 1992.
17. Z. Manna and A. Pnuelli. Temporal verification of reactive systems. ISBN 0-387- 94459-1. Springer Verlag, 1995.
18. R. Milner. Communication and Concurrency. Computer Science. Prentice-Hall, 1989.
19. H. Mountassir, F. Bellegarde, J. Julliand, and P.A. Masson. Cooperation entre preuve et model-checking pour verifier des proprietes LTL. In congres AF- ADL'2000, Grenoble, December 2000.
20. D. Peled and W. Penczeh. Using asynchronous biichi automata for efficient verification of concurrent systems. In Symposium on Protocol Specification Testing and Verification, pages 90-100, Warsaw, Pologne, June 1995.
21. D. A. Peled. Combining partial order reduction with on-the-fly model-checking. In CAV'94, LNCS n. 818, pages 377-390. Springer Verlag, June 1994.