While propositional modal logic is a standard tool, first-order modal logic is not. Indeed, it is not generally understood that conventional first-order syntax is insufficiently ex...
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
This position paper describes an approach to predict the performances of a Web application already in the early stages of application development. It leverages the wealth of inform...
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...