According to Parnas's information hiding principle and Baldwin and Clark's design rule theory, the key step to decomposing a system into modules is to determine the desi...
Sunny Huynh, Yuanfang Cai, Yuanyuan Song, Kevin J....
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Testing compositions of web services is complex, due to their distributed nature and asynchronous behaviour. However, research in this field is scarce. We propose a new testing me...