%0 Conference Proceedings
%F leroux05b
%A Bardin, S.
%A Finkel, A.
%A Leroux, J.
%A Schnoebelen, P.
%T Flat acceleration in symbolic model checking
%B 3rd Int. Symp. on Automated Technology for Verification and Analysis (ATVA'05)
%E Springer, 
%V 	 3707
%P 474-488
%S LNCS
%C Taipei, Taiwan
%X 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. Keywords: verification of infinite-state systems, symbolic model checking, acceleration
%U http://www.irisa.fr/vertecs/Publis/Ps/2005-ATVAa.pdf
%U http://dx.doi.org/10.1007/11562948_35
%8 October
%D 2005