AN AUTOMATA-BASED APPROACH TO CSCW VERIFICATION

Abstract

Software development for computer-supported cooperative work (CSCW) is a notoriously difficult task, involving often concurrent processes which are bound up with rigid timing constraints. To cope effectively with this difficulty, we propose in this paper the use of abstract finite-state models. The utility of these models is illustrated by encoding a CSCW system that we have built into finite-state automata, specifying in them a number of desired properties with temporal logic, and verifying these properties with model checking. By incorporating timing constraints into this process, we also gain insight into the usability of our system in real cooperative scenarios.