Rodrigo T. Saad

Learn More
In this thesis, we propose and study new algorithms and data structures for model checking nite-state, concurrent systems. We focus on techniques that target shared memory, multi-cores architectures, that are a current trend in computer architectures. In this context, we present new algorithms and data structures for exhaustive parallel model checking that(More)
Verification via model-checking is a very demanding activity in terms of computational resources. While there are still gains to be expected from algorithmic improvements, it is necessary to take advantage of the advances in computer hardware to tackle bigger models. Recent improvements in his area take the form of multiprocessor and multicore architectures(More)
We propose an algorithm for parallel state space construction based on an original concurrent data structure, called a localization table, that aims at better spatial and temporal balance. Our proposal is close in spirit to algorithms based on distributed hash tables, with the distinction that states are dynamically assigned to processors, i.e. we do not(More)
In this work, we present new algorithms for exhaustive parallel model checking that are as efficient as possible, but also “friendly” with respect to the work-sharing policies that are used for the state space generation (e.g. a work-stealing strategy): at no point do we impose a restriction on the way work is shared among the processors. This includes both(More)
We propose a parallel algorithm for local, on the fly, model checking of a fragment of CTL that is well-suited for modern, multi-core architectures. This model-checking algorithm takes benefit from a parallel state space construction algorithm, which we described in a previous work, and shares the same basic set of principles: there are no assumptions on(More)
We propose new algorithms for parallel, exhaustive model checking on multiprocessor architectures. Our approach is designed to emphasize memory efficiency and concurrency and is compatible with common parallel work-sharing policies, such as work-stealing. Moreover, our algorithm makes no particular assumptions about the model or the state class abstractions(More)
We propose a novel algorithm for parallel state space construction based on an original data structure, called a localization table, that aims at better space and temporal balance. Our proposal is close in spirit to algorithms based on distributed hash tables with the distinction that states are dynamically assigned to processors; we do not rely on an(More)
  • 1