Refined interfaces for compositional verification

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

Volumn 4229 LNCS, Issue , 2006, Pages 159-174

  Lang, Frédéric ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MATHEMATICAL OPERATORS; PARALLEL ALGORITHMS; SYNCHRONIZATION; VECTORS; FORMAL METHODS;

COMPOSITIONAL VERIFICATION; REFINED INTERFACES; STATE SPACE EXPLOSION; INTERFACE GENERATION; ORDERS OF MAGNITUDE; PARALLEL COMPOSITION OPERATORS; STATE-SPACE EXPLOSION; STATE-SPACE REDUCTION; STATES AND TRANSITIONS; SYNCHRONIZATION VECTORS;

INTERFACES (COMPUTER); INTERFACE STATES;

EID: 33750543126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888116_13     Document Type: Conference Paper

References (39)

1. A. Arnold. MEC: A System for Constructing and Analysing Transition Systems. In Proc. of the 1st Workshop on Automatic Verification Methods for Finite State Systems, LNCS vol. 407, 1989.
2. A. Bouajjani, J.-C. Fernandez, S. Graf, C. Rodriguez, and J. Sifakis. Safety for Branching Time Semantics. In Proc. of 18th ICALP. 1991.
3. A. Bouali, A. Ressouche, V. Roy, and R. de Simone. The Fc2Tools set: a Toolset for the Verification of Concurrent Systems. In Proc. of CAV'96, LNCS vol. 1102, 1996.
4. S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A Theory of Communicating Sequential Processes. Journal of the ACM, 31(3):560-599, 1984.
5. G. Chehaibar, H. Garavel, L. Mounier, N. Tawbi, and F. Zulian. Specification and Verification of the PowerScale Bus Arbitration Protocol: An Industrial Experiment with LOTOS. In Proc. of FORTE/PSTV'96. IFIP, Chapman & Hall, 1996. Full version available as INRIA Research Report RR-2958.
6. K. H. Cheung. Compositional Analysis of Complex Distributed Systems. PhD thesis, Hong Kong University of Science and Technology, 1998.
7. S. C. Cheung and J. Kramer. Enhancing Compositional Reachability Analysis with Context Constraints. In Proc. of the 1st ACM SIGSOFT International Symposium on the Foundations of Software Engineering. ACM Press, 1993.
8. S. C. Cheung and J. Kramer. Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints. In Proc. of the 3rd ACM SIGSOFT International Symposium on the Foundations of Software Engineering. ACM Press, 1995.
9. S. C. Cheung and J. Kramer. Context Constraints for Compositional Reachability. ACM Transactions on Software Engineering Methodology, 5(4):334-377, 1996.
10. J.-C. Fernandez. ALDEBARAN: un système de vérification par réduction de processus communicants. PhD thesis, Université Joseph Fourier (Grenoble), 1988.
11. J.-C. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodríguez, and J. Sifakis. A Toolbox for the Verification of LOTOS Programs. In Proc. of ICSE. ACM, 1992.
12. H. Garavel and F. Lang. SVL: a Scripting Language for Compositional Verification. In Proc. of FORTE'2001. IFIP, Kluwer Academic Publishers, 2001. Full version available as INRIA Research Report RR-4223.
13. H. Garavel, F. Lang, and R. Mateescu. An Overview of CADP 2001. European Association for Software Science and Technology Newsletter, 4:13-24, 2002.
14. Also available as INRIA Technical Report RT-0254 (2001).
15. H. Garavel and J. Sifakis. Compilation and Verification of LOTOS Specifications. In Proc. of PSTV'90. IFIP, North-Holland, 1990.
16. H. Gaxavel and M. Sighireanu. A Graphical Parallel Composition Operator for Process Algebras. In Proc. of FORTE/PSTV'99. IFIP, Kluwer, 1999.
17. D. Giannakopoulou. Model Checking for Concurrent Software Architectures. PhD thesis, Imperial College, University of London, 1999.
18. M. Goldsmith. Operational Semantics for Fun and Profit. In Proc. of the Symposium on the Occasion of 25 Years of CSP, LNCS vol. 3525, 2005.
19. S. Graf, B. Steffen, and G. Lüttgen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 8(5):607-616, 1996.
20. S. Graf and B. Steffen. Compositional Minimization of Finite State Systems. In Proc. of the 2nd Workshop on Computer-Aided Verification, LNCS vol. 531, 1990.
21. J. F. Groote and M. Reniers. Algebraic Process Verification. In Handbook of Process Algebra, chapter 17. North-Holland, 2001.
22. J.F. Groote and A. Ponse. Syntax and semantics of μ-CRL. In Proc. of Algebra of Communicating Processes, Workshops in Computing, 1995.
23. ISO/IEC. LOTOS - A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, International Organization for Standardization - Information Processing Systems - Open Systems Interconnection, Genève, 1989.
24. ISO/IEC. Open Distributed Processing - Reference Model. International Standard 10746, International Organization for Standardization - Information Processing Systems, Genève, 1995.
25. ISO/IEC. Enhancements to LOTOS (E-LOTOS). International Standard 15437:2001, International Organization for Standardization - Information Technology, Genève, 2001.
26. J.-P. Krimm. Application des ordres partiels à la génération compositionnelle de systèmes asynchrones. PhD thesis, Université Joseph Fourier, Grenoble, 2000.
27. J.-P. Krimm and L. Mounier. Compositional State Space Generation from LOTOS Programs. In Proc. of TACAS'97, LNCS vol. 1217, 1997.
28. F. Lang. EXP.OPEN 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-the-fly Verification Methods. In Proc. of IFM'2005, LNCS vol. 3771, 2005. Full version available as INRIA Research Report RR-5673.
29. J. Malhotra, S. A. Smolka, A. Giacalone, and R. Shapiro. A Tool for Hierarchical Design and Simulation of Concurrent Systems. In Proc. of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems, 1988. British Computer Society.
30. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
31. J. Romijn. Model Checking the HAVi Leader Election Protocol. Technical Report SEN-R9915, CWI, Amsterdam, The Netherlands, 1999.
32. A.W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
33. K. K. Sabnani, A. M. Lapone, and M. U. Uyar. An Algorithmic Procedure for Checking Safety Properties of Protocols. IEEE Transactions on Communications, 37(9):940-948, 1989.
34. K. C. Tai and V. Koppol. Hierarchy-Based Incremental Reachability Analysis of Communication Protocols. In Proc. of the IEEE International Conference on Network Protocols. IEEE Press, 1993.
35. K. C. Tai and V. Koppol. An Incremental Approach to Reachability Analysis of Distributed Programs. In Proc. of the 7th International Workshop on Software Specification and Design. IEEE Press, 1993.
36. F. Tronel, F. Lang, and H. Garavel. Compositional Verification Using CADP of the ScalAgent Deployment Protocol for Software Components. In Proc. of FMOODS'2003, LNCS vol. 2884, 2003. Full version available as INRIA Research Report RR-5012.
37. A. Valmari. Compositional State Space Generation. In Proc. of Advances in Petri Nets, LNCS vol. 674, 1993.
38. W. J. Yeh. Controlling State Explosion in Reachability Analysis. PhD thesis, Software Engineering Research Center Laboratory, Purdue University, 1993. Technical Report SERC-TR-147-P.
39. W. J. Yeh and M. Young. Compositional Reachability Analysis Using Process Algebra. In Proc. of the ACM SIGSOFT Symposium on Testing, Analysis, and Verification. ACM Press, 1991.