Flat Acceleration in Symbolic Model Checking
Résumé
Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques” enhance the convergence of fixpoint computations by computing the transitive closure of some transitions. In this paper we develop a new framework for symbolic model checking with accelerations. We also propose and analyze new symbolic algorithms using accelerations to compute reachability sets.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...