This article presents an approach, which combines theorem proving-based refinement with model checking for state based real-time systems. Our verification flow starts from UML sta...
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Where services are offered on a commercial basis, the manner in which charges for service usage are calculated is of key importance. Services typically have associated with them a...
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Selfhealing gradients are a frequently used building block for distribut...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...