Computer-Aided Verification

This volume contains the proceedings of the second workshopon Computer Aided Verification, held at DIMACS, RutgersUniversity, June 18-21, 1990. Itfeatures theoreticalresults that lead to new or more powerful verificationmethods. Among these are advances in the use of binarydecision diagrams, dense time, reductions based upon partialorder representations and proof-checking in controllerverification. The motivation for holding a workshop oncomputer aided verification was to bring together work oneffective algorithms or methodologies for formalverification - as distinguished, say,from attributes oflogics or formal languages. The considerable interestgenerated by the first workshop, held in Grenoble, June 1989(see LNCS 407), prompted this second meeting. The generalfocus of this volume is on the problem of making formalverification feasible for various models of computation.Specific emphasis is on models associated with distributedprograms, protocols, and digital circuits. The general testof algorithm feasibility is to embed it into a verificationtool, and exercise that tool on realistic examples: theworkshop included sessionsfor the demonstration of newverification tools.