In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
Increasingly, computer software must adapt dynamically to changing conditions. The correctness of adaptation cannot be rigorously addressed without precisely specifying the require...
Ji Zhang, Zhinan Zhou, Betty H. C. Cheng, Philip K...
In this paper we present our experiences in using symbolic model checking to analyze a specification of a software system for aircraft collision avoidance. Symbolic model checking ...
Richard J. Anderson, Paul Beame, Steve Burns, Will...
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
While implicit invocation (publish-subscribe) systems have goodengineering properties, they are difficult toreason about and to test. Model checking such systems is an attractive...