The following pages link to FM 2005: Formal Methods (Q5716900):
Displaying 8 items.
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- Factorization for Component-Interaction Automata (Q2891388) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Learning Minimal Separating DFA’s for Compositional Verification (Q3617752) (← links)
- On the effectiveness of a message-driven confidence-driven protocol for guarded software upgrading (Q4538485) (← links)
