Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
ACM Transactions on Information and System Security (TISSEC)
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A formal approach to component adaptation
Journal of Systems and Software - Special issue: Automated component-based software engineering
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Modelling Component Behaviour with Concurrent Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A well-structured framework for analysing petri net extensions
Information and Computation
A generic on-the-fly solver for alternation-free boolean equation systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Slicing an integrated formal method for verification
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Symbolic test selection based on approximate analysis
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Behavioural models for hierarchical components
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
A Formal and Tool-Equipped Approach for the Integration of State Diagrams and Formal Datatypes
IEEE Transactions on Software Engineering
The STSLib Project: Towards a Formal Component Model Based on STS
Electronic Notes in Theoretical Computer Science (ENTCS)
Event strictness for components with complex bindings
Proceedings of the 2nd India software engineering conference
| Hi-index | 0.00 |
Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages should be able to deal with data types and with rich communication means. Symbolic Transition Systems (STS) support the definition of component models which take into account control, concurrency, communication and data types. However, verification of components described with protocol modelled by STS, especially model-checking, is difficult since they possibly involve different sources of infinity. In this paper, we propose the notions of bounded analysis and bounded decomposition. They can be used to test boundedness of systems and to generate finite simulations for them so that standard model-checking techniques may be applied for verification purposes.