Sciweavers

26 search results - page 6 / 6
» Finding Lower Bounds for Nondeterministic State Complexity I...
Sort
View
SIGSOFT
2003
ACM
14 years 6 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...