Bounded analysis and decomposition for behavioural descriptions of components

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

Volumn 4037 LNCS, Issue , 2006, Pages 33-47

  Poizat, Pascal ^a   Royer, Jean Claude ^b   Salaün, Gwen ^c  

^a UNIVERSITY OF EVRY   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^c INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION;

BOUNDED ANALYSIS; CONCURRENCY; SYMBOLIC TRANSITION SYSTEMS (STS);

INTERFACES (COMPUTER);

EID: 33746256409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11768869_5     Document Type: Conference Paper

References (27)

1. R. Allen and D. Garlan. A Formal Basis for Architectural Connection. ACM Transactions on Software Engineering and Methodology, 6(3):213-249, 1997.
2. A. Arnold. Finite Transition Systems. International Series in Computer Science. Prentice-Hall, 1994.
3. S. Bardin, A. Finkel, and J. Leroux. FASTer Acceleration of Counter Automata in Practice. In Proc. of TACAS'04, volume 2988 of LNCS, pages 576-590. Springer, 2004.
4. T. Barros, L. Henrio, and E. Madelaine. Behavioural Models for Hierarchical Components. In Proc. of SPIN'05, volume 3639 of LNCS, pages 154-168. Springer-Verlag, 2005.
5. S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In Proc. of CAV '98, volume 1427 of LNCS, pages 319-331. Springer-Verlag, 1998.
6. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In Proc. of TACAS'99, volume 1579 of LNCS, pages 193-207. Springer-Verlag, 1999.
7. A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract Regular Model Checking. In Proc. of CAV'04, volume 3114 of LNCS, pages 372-386. Springer-Verlag, 2004.
8. A. Bracciali, A. Brogi, and C. Canal. A Formal Approach to Component Adaptation. Journal of Systems and Software, 74(1), 2005.
9. I. Brückner and H. Wehrheim. Slicing an Integrated Formal Method for Verification. In Proc. of ICFEM'05, volume 3785 of LNCS, pages 360-374. Springer-Verlag, 2005.
10. M. Calder, S. Maharaj, and C. Shankland. A Modal Logic for Full LOTOS Based on Symbolic Transition Systems. The Computer Journal, 45(1):55-61, 2002.
11. E. M. Clarke, O. Grumberg, and D. E. Long. Model-Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
12. D. Dams, R. Gerth, and O. Grumberg. Abstract Interpretation of Reactive Systems. ACM Transactions on Programming Languages and Systems, 19(2):253-291, 1997.
13. G. Delzanno. An Overview of MSR(C): A CLP-based Framework for the Symbolic Verification of Parameterized Concurrent Systems. In Proc. of WFLP'02, volume 76 of ENTCS. Elsevier, 2002.
14. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient Algorithms for Model Checking Pushdown Systems. In Proc. of CAV'00, volume 1855 of LNCS, pages 232-247. Springer-Verlag, 2000.
15. A. Finkel, P. McKenzie, and C. Picaronny. A Well-Structured Framework for Analysing Petri Nets Extensions, Information and Computation, 195(1-2):1-29, 2004.
16. H. Garavel, F. Lang, and R. Mateescu. An Overview of CADP 2001. EASST Newsletter, 4:13-24, 2001.
17. G. J. Holzmann. The Spin Model Checker, Primer and Reference Manual. Addison-Wesley, Reading, Massachusetts, 2003.
18. A. Ingólfsdóttir and H. Lin. A Symbolic Approach to Value-passing Processes, chapter 7 of Handbook of Process Algebra. Elsevier, 2001.
19. B. Jeannet, T. Jéron, V. Rusu, and E. Zinovieva. Symbolic Test Selection Based on Approximate Analysis. In Proc. of TACAS'05, volume 3440 of LNCS, pages 349-364. Springer Verlag, 2005.
20. J. Kramer, J. Magee, and S. Uchitel. Software Architecture Modeling and Analysis: A Rigorous Approach. In Proc. of SFM'03, volume 2804 of LNCS, pages 44-51. Springer-Verlag, 2003.
21. S. Leue, R. Mayr, and W. Wei. A Scalable Incomplete Test for the Boundedness of UML RT Models. In Proc. of TACAS'04, volume 2988 of LNCS, pages 327-341. Springer-Verlag, 2004.
22. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property Preserving Abstractions for the Verification of Concurrent Systems. Formal Methods in System Design, 6(1):11-44, 1995.
23. R. Mateescu. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In Proc. of TACAS'03, volume 2619 of LNCS, pages 81-96. Springer Verlag, 2003.
24. S. Moschoyiannis, M. W. Shields, and P. J. Krause. Modelling Component Behaviour with Concurrent Automata. In Proc. of FESCA '05, volume 114(3) of ENTCS, pages 199-220, 2005.
25. P. Poizat and J.-C. Royer. Korrigan: a Formal ADL with Full Data Types and a Temporal Glue. Technical Report 88-2003, LaMI, CNRS et Université d'Evry Val d'Essonne, September 2003.
26. P. Poizat, J.-C. Royer, and G. Salaün. Symbolic Bounded Analysis for Component Behavioural Protocols. Technical report, Écoles des Mines de Nantes, 2005. Available1 at http://www.emn.fr/x-inio/jroyer/rrBounded.pdf.
27. F. B. Schneider. Enforceable Security Policies. ACM Transactions on Information and System Security, 3(1):30-50, 2000.