We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
Abstract. A promising approach towards evaluating adaptive systems is to decompose the adaptation process and evaluate the system in a “piece-wise” manner. This paper presents ...