Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
Electronic mail is an unquestionably vital component of the Internet infrastructure. While the general perception of email is that it "just works," surprisingly little d...
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...